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

(Video Solution(In Chinese))
 
(3 intermediate revisions by 2 users not shown)
Line 4: Line 4:
  
 
is a multiple of <math>n</math>. (Note that <math>\lfloor z \rfloor</math> denotes the greatest integer less than or equal to <math>z</math>. For example, <math>\lfloor -\pi \rfloor = -4</math> and <math>\lfloor 2 \rfloor = \lfloor 2.9 \rfloor = 2</math>.)
 
is a multiple of <math>n</math>. (Note that <math>\lfloor z \rfloor</math> denotes the greatest integer less than or equal to <math>z</math>. For example, <math>\lfloor -\pi \rfloor = -4</math> and <math>\lfloor 2 \rfloor = \lfloor 2.9 \rfloor = 2</math>.)
 +
 +
==Video Solution(In Chinese)==
 +
https://youtu.be/LW54i7rWkpI
  
 
==Video Solution==
 
==Video Solution==
 
https://www.youtube.com/watch?v=50W_ntnPX0k
 
https://www.youtube.com/watch?v=50W_ntnPX0k
 +
 +
==Video Solution==
 +
Part 1 (analysis of why there is no irrational solution)
 +
 +
https://youtu.be/QPdHrNUDC2A
 +
 +
Part 2 (analysis of even integer solutions and why there is no non-integer rational solution)
 +
 +
https://youtu.be/4rNh4sbsSms
 +
 +
~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)

Latest revision as of 00:11, 27 July 2024

Determine all real numbers $\alpha$ such that, for every positive integer $n$, the integer

\[\lfloor \alpha \rfloor + \lfloor 2\alpha \rfloor + \dots +\lfloor n\alpha \rfloor\]

is a multiple of $n$. (Note that $\lfloor z \rfloor$ denotes the greatest integer less than or equal to $z$. For example, $\lfloor -\pi \rfloor = -4$ and $\lfloor 2 \rfloor = \lfloor 2.9 \rfloor = 2$.)

Video Solution(In Chinese)

https://youtu.be/LW54i7rWkpI

Video Solution

https://www.youtube.com/watch?v=50W_ntnPX0k

Video Solution

Part 1 (analysis of why there is no irrational solution)

https://youtu.be/QPdHrNUDC2A

Part 2 (analysis of even integer solutions and why there is no non-integer rational solution)

https://youtu.be/4rNh4sbsSms

~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)