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 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"):
https://github.com/panicz/pamphlet
HTH
Panicz
--
You received this message because you are subscribed to the Google Groups
"Racket Users" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to racket-users+unsubscr...@googlegroups.com.
To view this discussion on the web visit
https://groups.google.com/d/msgid/racket-users/1240f18d-fcee-4daa-8497-7c66fcd22c0d%40googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
