Browse · MathNet
PrintKorean Mathematical Olympiad
South Korea number theory
Problem
A positive integer is said to be an "n-good number" if it satisfies the following two properties: (Property 1) is divisible by at least distinct primes (Property 2) There exist distinct positive divisors of such that Show that there exists an "n-good number" for each .
Solution
We use an induction on .
a. For , put . Since , is divisible by 6 distinct primes. Moreover, since we have
Hence, by multiplying both sides of above equality by , we get where each term of the right hand side is a divisor of .
b. Suppose there is an -good number . Put Then Hence is a sum of distinct divisors. Since , prime divisors of are different from those of . Since has at least one prime divisor, and since has at least distinct prime divisors, has at least distinct prime divisors. Therefore is a -good number.
a. For , put . Since , is divisible by 6 distinct primes. Moreover, since we have
Hence, by multiplying both sides of above equality by , we get where each term of the right hand side is a divisor of .
b. Suppose there is an -good number . Put Then Hence is a sum of distinct divisors. Since , prime divisors of are different from those of . Since has at least one prime divisor, and since has at least distinct prime divisors, has at least distinct prime divisors. Therefore is a -good number.
Techniques
Prime numbersGreatest common divisors (gcd)Induction / smoothing