Exercise 1957Number theory › Divisibility and gcdOlympiadAdded 4 Nov 2026
⌊√n + √(n+1)⌋ = ⌊√(4n+2)⌋
#floor function#square roots#squares modulo 4
Statement
Prove that for every positive integer ,
Hint
Show that , then show that no integer lies between the two numbers.
Show solutionHide solution
Solution
Idea. The two numbers are very close; an integer between them would be a square near , and is never a square.
Upper comparison. , and , so and
Lower comparison. so and
No integer in between. Suppose an integer satisfies . Squaring, , so . But squares are while . Contradiction.
Conclusion. The numbers have no integer in , so their floors coincide.
Check. : , , both floors .
Lesson. To compare floors of two close irrational expressions, show that no integer (or the square of an integer) can separate them, often with a congruence argument.