Maths WorkshopMaths problems with full solutions
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 nn,
⌊n+n+1⌋=⌊4n+2⌋.\left\lfloor\sqrt n+\sqrt{n+1}\right\rfloor=\left\lfloor\sqrt{4n+2}\right\rfloor.

Hint

Show that n+n+1<4n+2\sqrt n+\sqrt{n+1}<\sqrt{4n+2}, 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 4n+24n+2, and 4n+24n+2 is never a square.

Upper comparison. (n+n+1)2=2n+1+2n(n+1)(\sqrt n+\sqrt{n+1})^2=2n+1+2\sqrt{n(n+1)}, and n(n+1)<(n+12)2n(n+1)<\left(n+\frac12\right)^2, so 2n(n+1)<2n+12\sqrt{n(n+1)}<2n+1 and
(n+n+1)2<4n+2.(\sqrt n+\sqrt{n+1})^2<4n+2.

Lower comparison. n(n+1)>n2n(n+1)>n^2 so 2n(n+1)>2n2\sqrt{n(n+1)}>2n and
(n+n+1)2>4n+1.(\sqrt n+\sqrt{n+1})^2>4n+1.

No integer in between. Suppose an integer kk satisfies n+n+1<k≤4n+2\sqrt n+\sqrt{n+1}<k\le\sqrt{4n+2}. Squaring, 4n+1<k2≤4n+24n+1<k^2\le4n+2, so k2=4n+2k^2=4n+2. But squares are ≡0,1(mod4)\equiv0,1\pmod4 while 4n+2≡24n+2\equiv2. Contradiction.

Conclusion. The numbers n+n+1≤4n+2\sqrt n+\sqrt{n+1}\le\sqrt{4n+2} have no integer in (n+n+1,4n+2](\sqrt n+\sqrt{n+1},\sqrt{4n+2}], so their floors coincide.

Check. n=1n=1: 1+1.414=2.4141+1.414=2.414, 6=2.449\sqrt6=2.449, both floors 22.

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.