APMO 1998-5
Determine the largest of all integers $n$ with the property that $n$ is divisible by all natural numbers $\leq \sqrt[3]{n}$
$\color{blue}{\textit{To}} \color{red}{\textit{ problems }} \color{blue}{\textit{I am encountering with-}} \color{green}{\textit{AVADA KEDAVRA!}}$
- Phlembac Adib Hasan
- Posts:1016
- Joined:Tue Nov 22, 2011 7:49 pm
- Location:127.0.0.1
- Contact:
Re: APMO 1998-5
Bartrand's postulate can help here.
Welcome to BdMO Online Forum. Check out Forum Guides & Rules
Re: APMO 1998-5
Will you please assert the Postulate named as "Bartrand's postulate"?
$\color{blue}{\textit{To}} \color{red}{\textit{ problems }} \color{blue}{\textit{I am encountering with-}} \color{green}{\textit{AVADA KEDAVRA!}}$
- Phlembac Adib Hasan
- Posts:1016
- Joined:Tue Nov 22, 2011 7:49 pm
- Location:127.0.0.1
- Contact:
Re: APMO 1998-5
For $n>1$, there is a prime between $n$ and $2n$.SANZEED wrote:Will you please assert the Postulate named as "Bartrand's postulate"?
Welcome to BdMO Online Forum. Check out Forum Guides & Rules
Re: APMO 1998-5
Let's say you don't know Bertrand's Postulate, nor its proof. How will solve it then? It has at least one fully elementary solution.
Note the number of my posts. Remember the number. There is a magic.
Note the number of my posts. Remember the number. There is a magic.
One one thing is neutral in the universe, that is $0$.