Browse · MathNet
PrintBelarusian Mathematical Olympiad
Belarus number theory
Problem
A positive integer is called nice if it is equal to the sum of the fourth powers of certain five distinct its divisors. (A divisor may be equal to or to the number itself.)
a) Prove that any nice number is divisible by .
b) Are there infinitely many nice numbers?
a) Prove that any nice number is divisible by .
b) Are there infinitely many nice numbers?
Solution
Answer: b) there are an infinite number of nice numbers.
a) Let be a nice number, i.e. , where , , are the distinct divisors of . If some divisor of is divisible by , then is divisible by . So we suppose that are not divisible by . Then their fourth powers are congruent to modulo . Indeed, if (), then () and , i.e. is congruent to modulo ; if (), then () and , i.e. is congruent to modulo . Therefore, the fourth power of any divisor is congruent to modulo , i.e. , and it follows that is divisible by .
b) Let there exist a nice number , i.e. , where are some positive integers and . If are distinct divisors of , consider the number , where is any positive integer greater than . It is obvious that are distinct divisors of , and So there are infinitely many nice numbers if there exists at least one nice number. It remains to note that the number is nice. Indeed, it is evident that is divisible by . Since the numbers , and are congruent modulo , the number is divisible by . Since is even and divisible by , we see that is divisible by . Besides, whence we see that is divisible by . Thus, is nice.
a) Let be a nice number, i.e. , where , , are the distinct divisors of . If some divisor of is divisible by , then is divisible by . So we suppose that are not divisible by . Then their fourth powers are congruent to modulo . Indeed, if (), then () and , i.e. is congruent to modulo ; if (), then () and , i.e. is congruent to modulo . Therefore, the fourth power of any divisor is congruent to modulo , i.e. , and it follows that is divisible by .
b) Let there exist a nice number , i.e. , where are some positive integers and . If are distinct divisors of , consider the number , where is any positive integer greater than . It is obvious that are distinct divisors of , and So there are infinitely many nice numbers if there exists at least one nice number. It remains to note that the number is nice. Indeed, it is evident that is divisible by . Since the numbers , and are congruent modulo , the number is divisible by . Since is even and divisible by , we see that is divisible by . Besides, whence we see that is divisible by . Thus, is nice.
Final answer
a) Every nice number is divisible by five. b) Yes, there are infinitely many nice numbers.
Techniques
Fermat / Euler / Wilson theoremsFactorization techniques