Let $n$ a positive integer, $n > 1$. The number $n$ is wonderful if the number is divisible by sum of the your prime factors. For example; $90$ is wondeful, because $90 = 2 \times 3^2\times 5$ and $2 + 3 + 5 = 10, 10$ divides $90$. Show that, exist a number "wonderful" with at least $10^{2002}$ distinct prime numbers.
Problem
Source: Cono Sur 2002
Tags: number theory, prime factorization, cono sur
Isogonal
15.08.2017 03:19
Assume Goldbach's Conjecture. Then choose the first $10^{2002} + 1$ primes. Their product $P$ will be even, and so will their sum $S < P$. Thus $P-S$ is even and can be written as $p+q$ with them both prime. Adding $p, q$ to our list of primes, we have $S' = S + p + q = P$, and $P' = Ppq$ which is divisible by $S'$.
Choose $10^{2002}$ arbitrary primes. Let the product be $P$, and the sum be $S$. Consider the smallest prime factor of $P-S$, $q$. Then $P-S$ can be written as $\sum_{n=1}^{N}q$. Adding $q, \ldots, q$ to our list of primes, we have $S' = S + q + \ldots + q = P$, and $P' = q^{N} \cdot P$ which is divisible by $S'$.
I hope I did not make an error.
TeamGuam2015
15.08.2017 04:20
Isogonal wrote: Assume Goldbach's Conjecture. But how can you just assume Goldbach's Conjecture? Unless you happen to have a simple proof...
mathwiz0803
15.08.2017 06:39
Goldbach's Conjecture has been proven for insanely large primes, so I think it is safe to assume it.