#finding a pattern in a sequence

8 messages · Page 1 of 1 (latest)

proud sleetBOT
hollow maple
#

This is a problem about the Chinese remainder theorem, except that branches 1 and 3 will never hit the goal at the same time

molten ledge
hollow maple
#

Yes

molten ledge
#

Is that to say that, it doesn’t matter the initial number and the repeating number for any of the branches, so long as the repeating number is different for each branch?

#

(Sorry I’m not familiar with the Chinese remainder theorem)

grizzled dock
molten ledge
#

Thanks. It was bestowed upon me in this server.
Back to the question at hand tho.

What does one do when the numbers you want to calculate the CRT are not relative primes?