HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Problems
  2. /Prove Hermite's identity lfloor x rfloor + lfloor x + 1/2 rfloor = lfloor 2x rfloor for every real…
AdvancedMathematicsHigh School (11–12)Number TheoryConceptualNumericalOlympiad

Prove Hermite's identity lfloor x rfloor + lfloor x + 1/2 rfloor = lfloor 2x rfloor for every real…

StemPy LabContributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

  1. Prove Hermite's identity ⌊x⌋+⌊x+12⌋=⌊2x⌋\lfloor x \rfloor + \left\lfloor x + \tfrac{1}{2} \right\rfloor = \lfloor 2x \rfloor⌊x⌋+⌊x+21​⌋=⌊2x⌋ for every real xxx.
  1. Use it to prove that for every positive integer nnn,
∑k=0∞⌊n+2k2k+1⌋=n.\displaystyle \sum_{k = 0}^{\infty} \left\lfloor \frac{n + 2^k}{2^{k+1}} \right\rfloor = n.k=0∑∞​⌊2k+1n+2k​⌋=n.

Only finitely many terms are not 000. Write each term as ⌊n2k+1+12⌋\left\lfloor \dfrac{n}{2^{k+1}} + \dfrac{1}{2} \right\rfloor⌊2k+1n​+21​⌋.

  1. Find the value of the sum for n=777n = 777n=777, and the value of ∑k=1100⌊k⌋\displaystyle\sum_{k=1}^{100} \lfloor \sqrt{k} \rfloork=1∑100​⌊k​⌋.

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

⌊x⌋≤x<⌊x⌋+1\lfloor x \rfloor \le x < \lfloor x \rfloor + 1⌊x⌋≤x<⌊x⌋+1. From 111 to nnn there are ⌊n/d⌋\lfloor n/d \rfloor⌊n/d⌋ multiples of ddd. Legendre: the exponent of a prime ppp in n!n!n! is ⌊n/p⌋+⌊n/p2⌋+…\lfloor n/p \rfloor + \lfloor n/p^2 \rfloor + \dots⌊n/p⌋+⌊n/p2⌋+…

The worked solution

Check an answer or open a hint to unlock the worked solution.

Have you tried it?

Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.

Step 1. Part (a). Write x=m+fx = m + fx=m+f with m=⌊x⌋m = \lfloor x \rfloorm=⌊x⌋ and 0≤f<10 \le f < 10≤f<1. If f<12f < \tfrac{1}{2}f<21​, the left side is m+m=2mm + m = 2mm+m=2m and ⌊2x⌋=2m\lfloor 2x \rfloor = 2m⌊2x⌋=2m, since 2f<12f < 12f<1. If f≥12f \ge \tfrac{1}{2}f≥21​, the left side is m+(m+1)=2m+1m + (m + 1) = 2m + 1m+(m+1)=2m+1 and ⌊2x⌋=2m+1\lfloor 2x \rfloor = 2m + 1⌊2x⌋=2m+1, since 1≤2f<21 \le 2f < 21≤2f<2.

Step 2. Part (b). Put y=n2k+1y = \dfrac{n}{2^{k+1}}y=2k+1n​. The term is ⌊y+12⌋=⌊2y⌋−⌊y⌋=⌊n2k⌋−⌊n2k+1⌋\left\lfloor y + \tfrac{1}{2} \right\rfloor = \lfloor 2y \rfloor - \lfloor y \rfloor = \left\lfloor \dfrac{n}{2^k} \right\rfloor - \left\lfloor \dfrac{n}{2^{k+1}} \right\rfloor⌊y+21​⌋=⌊2y⌋−⌊y⌋=⌊2kn​⌋−⌊2k+1n​⌋.

Step 3. Telescope. Adding from k=0k = 0k=0, the middle terms cancel. What is left is ⌊n/1⌋=n\lfloor n/1 \rfloor = n⌊n/1⌋=n, because ⌊n/2k+1⌋=0\lfloor n/2^{k+1} \rfloor = 0⌊n/2k+1⌋=0 once 2k+1>n2^{k+1} > n2k+1>n. Proof complete.

Step 4. Part (c). For n=777n = 777n=777 the sum is 777777777. For the square roots, mmm from 111 to 999 appears 2m+12m + 12m+1 times, and m=10m = 10m=10 once (k=100k = 100k=100). So the sum is ∑m=19m(2m+1)+10=2×285+45+10=625\sum_{m=1}^{9} m(2m + 1) + 10 = 2 \times 285 + 45 + 10 = 625∑m=19​m(2m+1)+10=2×285+45+10=625.

Answer: the sum equals 777777777; the sum of the floors of the square roots is 625625625.

Source. Part (b) is a problem of the International Mathematical Olympiad of 1968.

Log in to save this for later
← All Problems
← The number (100, 50) = (100!)/(50! 50!) has 30 digits…Prove that √3 is irrational. Show that x = √2 + √3 is a root of P(x) = x⁴ - 10x² + 1… →
More onNumber Theory

Discussion (0)

Log in to join the discussion.

Loading…

More on this topic

  1. The triangular numbers are 1, 3, 6, 10, …, where the nth one is (n(n + 1))/2…Advanced
  2. Prove that the equation x³ + y³ + z³ = n has no solution in integers when n leaves remainder 4 or 5…Advanced
  3. Find every triple of positive integers a ≤ b ≤ c with 1/a + 1/b + 1/c = 1, and prove that there are…Advanced
  4. Find all pairs of positive integers (x, y) with x² - y² = 945…Hard
  5. A teacher wants a list of every primitive Pythagorean triple whose hypotenuse is less than 100…Advanced
All problems on this topic →