Remaindle

Chinese Remainder Theorem

Rules

For each game, a random integer is picked between 0 and 2000. You have 6 guesses to guess the number. Each guess will be associated with a prime number, given in increasing order. For a guess, x, associated with prime p, the game will tell you the remainder of the target number, t, minus your guess mod p, that is, the game will return

(t-x) mod p.

Good luck!
Clicking "New Game" before finishing the current game is considered losing.

Mode Selection


In learner mode: you will not be allowed to enter a guess which is ruled out by the given information.
In normal mode: you cannot guess the same number twice, but you will not be prevented from entering a guess which is ruled out by the given information.
In hard mode: you lose if you guess the same number twice or enter a guess which is ruled out by the given information.

Dark Mode:

Customization

Upper bound:

Upper bound for the next game: 2000

You may change the upper bound for the target number to up to 500,000 (half a million), it will be applied starting the next game. The number of guesses will change accordingly to ensure that it's always possible to correctly identify the target.