Given that \(a,b\in\Bbb{Z}^+\) and \(\gcd(a,b)=1\).
Prove the following:
⌊ba⌋+⌊2⋅ba⌋+⌊3⋅ba⌋+…+⌊(b−1)⋅ba⌋=2(a−1)(b−1)
Clarifications:
- ⌊⋅⌋ denotes the floor function (greatest integer function).
- gcd(x,y) denotes the greatest common divisor of x and y.
Hint:
It'd be helpful to prove this first before attempting to prove the main problem.
∀ a,b∈Z+∣gcd(a,b)=1⟹nba∈Z ∀ 0<n<b ∧ n∈Z
#NumberTheory
#GreatestCommonDivisor(GCD/HCF/GCF)
#Proofs
#Summation
#FloorFunction
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Use the fact that ⌊x⌋=x−{x} to rewrite as
k=1∑b−1⌊bka⌋=baj=1∑b−1j−k=1∑b−1{bka}=2a(b−1)−k=1∑b−1{bka}.
Now
k=1∑b−1{bka}=k=1∑(b−1)/2({bka}+{b(b−k)a})=k=1∑(b−1)/2({bka}+{a−bka}).
Here no term can be zero since na/b is not integer for 1≤n<b provided that (a,b)=1. So ∀k∈[1,(b−1)/2]
{bka}+{a−bka}=1⟹k=1∑(b−1)/2({bka}+{a−bka})=k=1∑(b−1)/21=2b−1
and we're, um, done.
Log in to reply
Very well done....
Consider b=8 and a=9. We have gcd(a,b)=1 but 2(b−1) is not a positive integer ≥1. Then, what does the sum k=1∑(b−1)/2(1) mean?
Log in to reply
The sum is to b−1, as in ⌊(b−1)ba⌋, and not to 2b−1 as you had it.
Warning: there is a huge hint below.
na(modb) is pairwise distinct for n=1,2,...,b. Proof: The opposite is false by Pigeonhole Principle. Hence if we limit n to 1,2,3,...,b−1 the possible remainders are 1,2,...,b−1, once each.
From here we can find the sum of the b−1 fractional parts of n•ba,n=1,2,...,b−1. We know their sum, so we know the sum of their floors.
Log in to reply
There's an easier approach (though essentially based on the same idea).
Hint: Heads and tails.