mersenneforum.org  

Go Back   mersenneforum.org > Fun Stuff > Puzzles

Reply
 
Thread Tools
Old 2021-05-04, 14:34   #12
Kebbaj
 
Kebbaj's Avatar
 
"Kebbaj Reda"
May 2018
Casablanca, Morocco

3·31 Posts
Default

Quote:
Originally Posted by Kebbaj View Post
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.
Sorry, in my answer, I meant if A0 and A1 are not coprime then the sequence would be trivial.
Kebbaj is offline   Reply With Quote
Old 2021-05-04, 16:45   #13
uau
 
Jan 2017

11510 Posts
Default

Quote:
Originally Posted by Dr Sardonicus View Post
The condition that the initial terms be relatively prime seems to have been assumed, but should have been stated.
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.
uau is offline   Reply With Quote
Old 2021-05-05, 08:04   #14
Dieter
 
Oct 2017

2·59 Posts
Default

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.
Dieter is offline   Reply With Quote
Old 2021-05-05, 11:48   #15
Walter
 
"Walter S. Gisler"
Sep 2020
Switzerland

11 Posts
Default

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 A_0 and A_1 that satisfy
A_0 is equivalent to F_{m_k-a_k} modulo  p_k
 A_1 is equivalent to  F_{m_k-a_k+1} modulo  p_k
Should there be a A_0 and A_1 that satisfies this for every k? Or is it sufficient if it is satisfied for one k? 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 A_0 and A_1 that satisfies it for all k in my solution.
Walter is offline   Reply With Quote
Old 2021-05-05, 12:06   #16
Dr Sardonicus
 
Dr Sardonicus's Avatar
 
Feb 2017
Nowhere

10010110011002 Posts
Default

Quote:
Originally Posted by Walter View Post
Quote:
Given this set, one can generate A_0 and A_1 that satisfy
A_0 is equivalent to F_{m_k-a_k} modulo  p_k
 A_1 is equivalent to  F_{m_k-a_k+1} modulo  p_k
Should there be a A_0 and A_1 that satisfies this for every k?
Yes. Using the condition that the pk are distinct, the existence of simultaneous solutions to all the congruences is guaranteed by the Chinese Remainder Theorem (CRT).
Dr Sardonicus is offline   Reply With Quote
Old 2021-05-05, 17:13   #17
Walter
 
"Walter S. Gisler"
Sep 2020
Switzerland

11 Posts
Default

Quote:
Originally Posted by Dr Sardonicus View Post
Yes. Using the condition that the pk are distinct, the existence of simultaneous solutions to all the congruences is guaranteed by the Chinese Remainder Theorem (CRT).
Ah, right. That makes perfect sense.
Walter is offline   Reply With Quote
Old 2021-05-15, 20:14   #18
Kebbaj
 
Kebbaj's Avatar
 
"Kebbaj Reda"
May 2018
Casablanca, Morocco

3·31 Posts
Default

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 2021-05-15 at 20:15
Kebbaj is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
April 2021 Xyzzy Puzzles 25 2021-05-04 22:37
March 2021 tgan Puzzles 0 2021-02-28 13:30
January 2021 tgan Puzzles 36 2021-02-09 21:29
February 2021 Xyzzy Puzzles 11 2021-02-04 14:53

All times are UTC. The time now is 10:24.


Mon Sep 20 10:24:03 UTC 2021 up 59 days, 4:53, 0 users, load averages: 1.28, 1.28, 1.25

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

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.