mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Puzzles (https://www.mersenneforum.org/forumdisplay.php?f=18)
-   -   May 2021 (https://www.mersenneforum.org/showthread.php?t=26757)

Kebbaj 2021-05-04 14:34

[QUOTE=Kebbaj;577554]If A0 and A1 are coprime, the sequance would be trivial: “easy common factor of the sequence with no prime “. So for the sequence to be interesting it is essential that A0 and A1 would be coprime.
GCD[A0,A1] must be = 1.

I think that the webmaster did not write the relation of divisiblity between A0 and A1 because the question was to find a sequence of triplets with the conditions quoted 1 to 4 ”and the A0 A1 are simply to explain the goal of the question.[/QUOTE]

Sorry, in my answer, I meant if A0 and A1 are not coprime then the sequence would be trivial.

uau 2021-05-04 16:45

[QUOTE=Dr Sardonicus;577605]The condition that the initial terms be relatively prime seems to have been assumed, but should have been stated.[/QUOTE]
The sentence "Our goal is to see how to generate a Fibonacci-like 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.

Dieter 2021-05-05 08:04

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.

Walter 2021-05-05 11:48

I believe I have solved the first part of the problem. I.e. I have a set of T triplets that satisfy the conditions 1-4.

However, I am a bit confused by the second part:

[QUOTE]Given this set, one can generate [TEX]A_0[/TEX] and [TEX]A_1[/TEX] that satisfy
[TEX]A_0[/TEX] is equivalent to [TEX]F_{m_k-a_k} modulo p_k[/TEX]
[TEX] A_1[/TEX] is equivalent to [TEX] F_{m_k-a_k+1} modulo p_k[/TEX][/QUOTE]

Should there be a [TEX]A_0[/TEX] and [TEX]A_1[/TEX] that satisfies this for every [TEX]k[/TEX]? Or is it sufficient if it is satisfied for one [TEX]k[/TEX]? The problem specification isn't so clear about this, or am I missing something? I haven't checked my solution in detail yet, but currently, my intuition is that there isn't a pair of [TEX]A_0[/TEX] and [TEX]A_1[/TEX] that satisfies it for all k in my solution.

Dr Sardonicus 2021-05-05 12:06

[QUOTE=Walter;577696][QUOTE]Given this set, one can generate [TEX]A_0[/TEX] and [TEX]A_1[/TEX] that satisfy
[TEX]A_0[/TEX] is equivalent to [TEX]F_{m_k-a_k} modulo p_k[/TEX]
[TEX] A_1[/TEX] is equivalent to [TEX] F_{m_k-a_k+1} modulo p_k[/TEX][/QUOTE]Should there be a [TEX]A_0[/TEX] and [TEX]A_1[/TEX] that satisfies this for every [TEX]k[/TEX]?[/quote]Yes. Using the condition that the p[sub]k[/sub] are distinct, the existence of simultaneous solutions to all the congruences is guaranteed by the Chinese Remainder Theorem (CRT).

Walter 2021-05-05 17:13

[QUOTE=Dr Sardonicus;577698]Yes. Using the condition that the p[sub]k[/sub] are distinct, the existence of simultaneous solutions to all the congruences is guaranteed by the Chinese Remainder Theorem (CRT).[/QUOTE]

Ah, right. That makes perfect sense.

Kebbaj 2021-05-15 20:14

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?


All times are UTC. The time now is 22:08.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.