Browse · MathNet
PrintSAMC
Saudi Arabia number theory
Problem
a) Prove that for each positive integer there is a unique positive integer such that
b) Prove that is divisible by and find the quotient.
b) Prove that is divisible by and find the quotient.
Solution
(a) Let , where are positive integers, Then hence If is even, consider and we have If is odd, consider and we have
(b) If is even, then we have , where where is the Fibonacci number. In this case we get , hence and the quotient is .
(b) If is even, then we have , where where is the Fibonacci number. In this case we get , hence and the quotient is .
Final answer
F_{2010}^2
Techniques
Techniques: modulo, size analysis, order analysis, inequalitiesRecurrence relations