Thread: May 2021
View Single Post
Old 2021-05-02, 12:30   #2
Walter
 
"Walter S. Gisler"
Sep 2020
Switzerland

11 Posts
Default

I believe there are some mistakes in the problem statement, can anyone confirm this?

1.
For every natural number n, we have that for some k, n is equivalent to a_k modulo m_k (i.e. m_k divides n-a_k ).

Shouldn't this be: For every natural number n, we have that for some k, a_k is equivalent to n modulo m_k

2.
one can prove that this sequence does not contain any primes by using the following easy-to-prove identity, which holds for any Fibonacci-like sequence: A_{m+n} = A_mF_{n-1} + A_{m+1}F_n .

And this one: A_{m+n+1} = A_mF_{n-1} + A_{m+1}F_n ?
Walter is offline   Reply With Quote