20210504, 14:34  #12  
"Kebbaj Reda"
May 2018
Casablanca, Morocco
136_{8} Posts 
Quote:


20210504, 16:45  #13 
Jan 2017
2^{3}×3×5 Posts 
The sentence "Our goal is to see how to generate a Fibonaccilike sequence without any prime numbers." would make more sense if it ruled out the obvious and trivial common factors solution. But I don't think this affects the problem itself  the stated requirement is to find a set of tuples, not just A0 and A1, so the lack of the condition doesn't make much difference. Given the form of the required answer, it doesn't seem to allow any trivial solution that would otherwise be forbidden.

20210505, 08:04  #14 
Oct 2017
11^{2} Posts 
The text of the challenge is updated.
1) F_0 = 0 2) It's explicitly formulated that A_0 and A_1 have to be relatively prime. 
20210505, 11:48  #15  
"Walter S. Gisler"
Sep 2020
Switzerland
11 Posts 
I believe I have solved the first part of the problem. I.e. I have a set of T triplets that satisfy the conditions 14.
However, I am a bit confused by the second part: Quote:


20210505, 12:06  #16 
Feb 2017
Nowhere
2×2,503 Posts 
Yes. Using the condition that the p_{k} are distinct, the existence of simultaneous solutions to all the congruences is guaranteed by the Chinese Remainder Theorem (CRT).

20210505, 17:13  #17 
"Walter S. Gisler"
Sep 2020
Switzerland
B_{16} Posts 

20210515, 20:14  #18 
"Kebbaj Reda"
May 2018
Casablanca, Morocco
2×47 Posts 
The error of ak condition (1.) is always in the text even after the update? ak can take the value 0. !!
ak =0 is equivalent to ak = 60 but the condition 1 limits ak to the maximum of mk. On other hand i try to have a matrix of less than 17 elements triplets, but it may be impossible? Last fiddled with by Kebbaj on 20210515 at 20:15 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
April 2021  Xyzzy  Puzzles  25  20210504 22:37 
March 2021  tgan  Puzzles  0  20210228 13:30 
January 2021  tgan  Puzzles  36  20210209 21:29 
February 2021  Xyzzy  Puzzles  11  20210204 14:53 