Can every sufficiently large integer be written in the form $a^{100} + b^{101} + c^{102} + d^{103} + e^{104}$ for some non-negative integers $a$, $b$, $c$, $d$ and $e$? I'm only 15 so if u could please write as elemntary as you can! I know that this problem can be solved elementary :)
|
No, it is not possible. Given a large integer $N$, there are $N^{\frac 1{100}}$ smaller numbers of the form $a^{100}$. There are even fewer of the forms with higher exponents. This means you can express less than $(N^{\frac 1{100}})^5=N^{\frac 1{20}} \lt N$ numbers this way. |
|||||||||||
|
|
Let $A=\{n\in\mathbb N: \exists a,b,c,d,e\in\mathbb N: n= a^{100}+b^{101}+c^{102}+d^{103}+e^{104}\}$. For $N>0$, let $A_N=\{n<N: n\in A\}$. If your statement were true, we'd have, amongst other things, that $\lim_{N\to\infty} |A_N|/N =1$. Now write $n=1+\lfloor\sqrt[100]N\rfloor$. Then the set of $5$-tuples $(a,b,c,d,e)$ such that $a^{100}+b^{101}+c^{102}+d^{103}+e^{104}<N$ is at most $n^5$. Therefore, $$|A_N|<(1+\lfloor \sqrt[100]N\rfloor)^5$$ I think it is therefore pretty obvious that $|A_N|/N\to 0$ as $N\to\infty$. This is a much stronger result than negating your result - it says that $|A_N|=O(\sqrt[20]N)$, which is a very sparse set. |
||||
|
|
