Hi,
> If P is the set of primes, how do I write a program ...
1. Do you plan to write this in Python?
2. What have you tried so far?
3. Does it work?
Lutz
--
https://mail.python.org/mailman/listinfo/python-list
Sometimes the simplest things...
I am wondering about congruences/patterns in Q.
--
https://mail.python.org/mailman/listinfo/python-list
On 2018-09-23 19:59, Musatov wrote:
If P is the set of primes, how do I write a program outputting the values of Q
as an integer sequence with 1 integer of Q for each N?
Let the first prime be P1
P1=2
so if
N=0, Q=-1
as
2=(2^0) - (-1)
Let the second prime be P2
P2=3
so if
N=1, Q=-1
as
3=(2^1
If P is the set of primes, how do I write a program outputting the values of Q
as an integer sequence with 1 integer of Q for each N?
Let the first prime be P1
P1=2
so if
N=0, Q=-1
as
2=(2^0) - (-1)
Let the second prime be P2
P2=3
so if
N=1, Q=-1
as
3=(2^1) - (-1)
Let the third prime be P3
P
