Den tor. 11. jul. 2019 kl. 15.40 skrev Bob Heffernan <
bob.heffer...@gmail.com>:
> On 19-07-11 09:31, James Geddes wrote:
> > Indeed, I would have thought that the calculation time would be
> > entirely dominated by the test for primality, and especially what
> > happens once the candidate primes
On Tuesday, July 9, 2019 at 8:09:04 AM UTC-4, Bob Heffernan wrote:
>
> Dear all,
>
> I recently wanted to count the number of primes in the sequences 2^n+3
> and 2^n-3 (and a few more besides) where n is a positive integer.
>
>
Hi Bob. This has nothing to do with Racket, and you may already k
If I may, let me address the (at least) four dimensions of coding that have
come up in this thread, as concretely as possible but with some generalizations
added:
1. Performance
Generally speaking, Python is a thin layer over C. It comes with almost all the
performance advantages of C and
On 19-07-11 00:44, Maciek Godek wrote:
> I also think that functional programming perhaps seems to make little sense
> in a small scale, but as your programs grow large, it becomes increasingly
> important.
Maciek,
You know, I think you might be right and I think this might be at the
root of my
On 19-07-11 09:31, James Geddes wrote:
> Indeed, I would have thought that the calculation time would be
> entirely dominated by the test for primality, and especially what
> happens once the candidate primes are bigger than 2^64 and can no
> longer be represented by a single word.
James,
I assum
I am also interested in this problem, because many of my colleagues use Python
and "isn't Python faster?" is a common argument. (Albeit one that I think is
more of a rationalisation than an reason.)
In this case, however, I would not have thought that there's any prima facie
reason why the Pyth
Hi Bob!
W dniu czwartek, 11 lipca 2019 03:36:32 UTC+2 użytkownik Bob Heffernan
napisał:
>
> On 19-07-10 02:46, Maciek Godek wrote:
> > A while ago, I wrote a booklet which used almost the same problem to
> > introduce to, what you called nicely in the title of this thread,
> "thinking
> > in
On 19-07-10 02:46, Maciek Godek wrote:
> A while ago, I wrote a booklet which used almost the same problem to
> introduce to, what you called nicely in the title of this thread, "thinking
> in Scheme", so if you're interested, you may want to check out the first
> chapter ("Introduction"):
Maci
W dniu wtorek, 9 lipca 2019 14:09:04 UTC+2 użytkownik Bob Heffernan napisał:
>
> Dear all,
>
> I recently wanted to count the number of primes in the sequences 2^n+3
> and 2^n-3 (and a few more besides) where n is a positive integer.
>
>
Hi!
A while ago, I wrote a booklet which used almost the
9 matches
Mail list logo
