Mathematics Asked by MathGeek on December 26, 2020

Let’s take two real numbers $a,b$. The distance between $a$ and $b$ is $|a-b|$. Let ${}$ denote fractional part. Then for any $a$ and $b$, there is an integer close to $|a-b|$ which is at most $|{a} – {b}|$ away from $|a-b|.$

We can see this intuitively but I just want to know what proof technique can be used and how to prove the above statement?

We may assume that $a leq b$, so that $| a - b | = b-a$. Consider $n = (b - {b}) - (a - {a})$. Then $n$ is an integer and we have $$|n - |a - b|| = |n - b + a| = |{a} - {b}|,$$ as desired.

Correct answer by Dániel G. on December 26, 2020

Get help from others!

Recent Questions

- How can I transform graph image into a tikzpicture LaTeX code?
- How Do I Get The Ifruit App Off Of Gta 5 / Grand Theft Auto 5
- Iv’e designed a space elevator using a series of lasers. do you know anybody i could submit the designs too that could manufacture the concept and put it to use
- Need help finding a book. Female OP protagonist, magic
- Why is the WWF pending games (“Your turn”) area replaced w/ a column of “Bonus & Reward”gift boxes?

Recent Answers

- Lex on Does Google Analytics track 404 page responses as valid page views?
- Jon Church on Why fry rice before boiling?
- haakon.io on Why fry rice before boiling?
- Peter Machado on Why fry rice before boiling?
- Joshua Engel on Why fry rice before boiling?

© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP