Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I am stuck with these two floor function problems.

Please help me

1. Let r be a real number, and n be a positive integer.
Prove $[r]+[r+\frac1n]+...+[r+\frac{n-1}n]=[nr]$

2. Let S be set of integers given by $[\alpha x]$ and $[\beta x]$ for x=1,2,3,...
Prove that S consists of every integer, each appearing exactly once, iff $\alpha$ and $\beta$ are positive irrational numbers such that $\frac1\alpha+\frac1\beta=1$

Thank you

share|cite|improve this question
2 is betty's theorem. – Calvin Lin Oct 18 '13 at 17:15

Part 1 hint:

Consider the value of $r-[r]$.

share|cite|improve this answer
I tried to a state and not move on. $[\{r\}+\frac1n]+[\{r\}+\frac2n]+...+[\{r\}+\frac{n-1}n]=[n\{r\}]$ where {r}=r-[r]. How can I move to the next step? – SimplyComplex Oct 18 '13 at 17:18
@SimplyComplex, $\dfrac{k}{n} \le \{r\} < \dfrac{k+1}{n}$ for some $k \in \mathbb{Z}$ with $0 \le k \le n-1$. – njguliyev Oct 18 '13 at 17:32

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.