Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2024 USAMO Problems/Problem 1"

(→‎See Also)
(→‎Solution (Explanation of Video))
Line 17: Line 17:
  
 
~alexanderruan
 
~alexanderruan
 +
 +
As listed above, <math>n=3</math> and <math>n=4</math> work but <math>n=5</math> and <math>n=6</math> don't. Assume <math>n>6</math>, let <math>p</math> be the smallest positive integer that doesn't divide <math>n!</math>. It is easy to see <math>p</math> is the smallest prime greater than <math>n</math>. It is easy to see that both <math>p-1</math> and <math>p+1</math> are divisors of <math>n!</math> Let <math>q</math> be the smallest positive integer greater than <math>p</math> that is 2 mod 6. We see that either <math>q=p+3</math> or <math>q=p+1</math> but <math>q</math>, <math>q+1</math>, <math>q+2</math> must all be divisors of <math>n!</math> giving a difference of 1 after a difference of 2. Therefore, all <math>n>6</math> fail.
 +
~mathophobia
  
 
==Video Solution==
 
==Video Solution==

Revision as of 17:21, 12 May 2024

Find all integers $n \geq 3$ such that the following property holds: if we list the divisors of $n !$ in increasing order as $1=d_1<d_2<\cdots<d_k=n!$, then we have \[d_2-d_1 \leq d_3-d_2 \leq \cdots \leq d_k-d_{k-1} .\]

Solution (Explanation of Video)

We can start by verifying that $n=3$ and $n=4$ work by listing out the factors of $3!$ and $4!$. We can also see that $n=5$ does not work because the terms $15, 20$, and $24$ are consecutive factors of $5!$. Also, $n=6$ does not work because the terms $6, 8$, and $9$ appear consecutively in the factors of $6!$.

Note that if we have a prime number $p>n$ and an integer $k>p$ such that both $k$ and $k+1$ are factors of $n!$, then the condition cannot be satisfied.

If $n\geq7$ is odd, then $(2)(\frac{n-1}{2})(n-1)=n^2-2n+1$ is a factor of $n!$. Also, $(n-2)(n)=n^2-2n$ is a factor of $n!$. Since $2n<n^2-2n$ for all $n\geq7$, we can use Bertrand's Postulate to show that there is at least one prime number $p$ such that $n<p<n^2-2n$. Since we have two consecutive factors of $n!$ and a prime number between the smaller of these factors and $n$, the condition will not be satisfied for all odd $n\geq7$.

If $n\geq8$ is even, then $(2)(\frac{n-2}{2})(n-2)=n^2-4n+4$ is a factor of $n!$. Also, $(n-3)(n-1)=n^2-4n+3$ is a factor of $n!$. Since $2n<n^2-4n+3$ for all $n\geq8$, we can use Bertrand's Postulate again to show that there is at least one prime number $p$ such that $n<p<n^2-4n+3$. Since we have two consecutive factors of $n!$ and a prime number between the smaller of these factors and $n$, the condition will not be satisfied for all even $n\geq8$.

Therefore, the only numbers that work are $n=3$ and $n=4$.

~alexanderruan

As listed above, $n=3$ and $n=4$ work but $n=5$ and $n=6$ don't. Assume $n>6$, let $p$ be the smallest positive integer that doesn't divide $n!$. It is easy to see $p$ is the smallest prime greater than $n$. It is easy to see that both $p-1$ and $p+1$ are divisors of $n!$ Let $q$ be the smallest positive integer greater than $p$ that is 2 mod 6. We see that either $q=p+3$ or $q=p+1$ but $q$, $q+1$, $q+2$ must all be divisors of $n!$ giving a difference of 1 after a difference of 2. Therefore, all $n>6$ fail. ~mathophobia

Video Solution

https://youtu.be/ZcdBpaLC5p0 [video contains problem 1 and problem 4]

See Also

2024 USAMO (Problems • Resources)
Preceded by
First Question 		Followed by
Problem 2
1 • 2 • 3 • 4 • 5 • 6
All USAMO Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2024_USAMO_Problems/Problem_1&oldid=219265"