0
$\begingroup$

Prove that the amount of integers between $1,\ldots,n$ which are divisible by $1\le k\le n$ is $\left\lfloor\dfrac{n}{k}\right\rfloor$ ?

$\endgroup$
  • $\begingroup$ I think "divided" should be "divisible" $\endgroup$ – steven gregory Sep 6 '17 at 15:25
2
$\begingroup$

There are certainly the $\left\lfloor \frac nk\right\rfloor$ integers $ k,2 k,\cdots, \left\lfloor \frac nk\right\rfloor k$.

On the other hand, if $ku\le n$, then $u\le\frac nk$ and, since $u$ is an integer, by definition $u\le\left\lfloor\frac nk\right\rfloor$. So, there are at most $\left\lfloor \frac nk\right\rfloor$ possible candidates for $u$.

$\endgroup$
  • $\begingroup$ Sorry, can you start over again, and rigorously? $\endgroup$ – יהודה שמחה ולדמן Sep 6 '17 at 15:33
  • $\begingroup$ I am not doing that. $\endgroup$ – user228113 Sep 6 '17 at 15:38
  • $\begingroup$ Did I say something wrong? $\endgroup$ – יהודה שמחה ולדמן Sep 6 '17 at 15:46
  • $\begingroup$ No, you did not. You asked me to re-do from scratch something that I had already done. And I shan't do it. $\endgroup$ – user228113 Sep 6 '17 at 15:49
2
$\begingroup$

The numbers from $1,2,\ldots,n$ which are divisible by $k$ are $k,2k,\ldots$. If the last term of this list be $mk$ then $mk\le n<(m+1)k$ i.e. $m$ is a integer such that $m\le \dfrac{n}{k} <m+1\Rightarrow m=\left\lfloor\dfrac{n}{k}\right\rfloor$. So there are $\left\lfloor\dfrac{n}{k}\right\rfloor$ numbers in the list.

$\endgroup$
  • $\begingroup$ Thank you so much! I like your way. However, a few minutes before I saw this comment, it finally hit me from the definition itself $\left\lfloor\dfrac{n}{k}\right\rfloor\le\dfrac{n}{k}$ . $\endgroup$ – יהודה שמחה ולדמן Sep 6 '17 at 17:00

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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