Browse · MathNet
PrintOpen Contests
Estonia number theory
Problem
Find all remainders which one can get when dividing by an integer which satisfies for some integer .
Solution
Numbers and give the same remainder when dividing by . Also, is odd and gives the remainder or when dividing by . The only possibility to get as the remainder is when , but then which leads to a contradiction, since if is divisible by , it is also divisible by , but is not divisible by . Hence the remainder of is both when dividing by or , consequently its remainder when dividing by is .
The remainder is possible: take and (or and ).
The remainder is possible: take and (or and ).
Final answer
1
Techniques
Polynomials mod pChinese remainder theoremPrime numbers