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

How does one find the no of positive integers such that find all possible numbers such that $$\lfloor{\sqrt{n}\rfloor} \mid n$$

What i did was to subsitute $n=t^{2}$ so that the equation becomes $\lfloor{t\rfloor} \mid t^{2}$ But this means that we want $t^{2} = k \lfloor{t\rfloor}$, where $k \in \mathbb{N}$. I don't really know what to do from here. By the way, this problem is in Apostol.

share|cite|improve this question
    
There is a gap in the problem: If you look at $n=k^2$ (for $k\mathbb{N}$), then certainly $\sqrt{n}$ is an integer that divide $n$ - hence there are infinite number of such integers $n$. – AD. Oct 9 '10 at 13:13
    
@AD: Yes even i gave a thought on that! – anonymous Oct 9 '10 at 13:19
3  
    
By the way, this problem is in Apostol. To be more specific, it is Exercise 21 in Chapter 3 in Apostol's Introduction to Analytic Number Theory. – Martin Sleziak Jan 14 '14 at 11:57
up vote 10 down vote accepted

I suppose you want to find all possible numbers such that $\displaystyle [\sqrt{n}] \mid n$.

Assume $\displaystyle n$ is not a perfect square, then there must be some $\displaystyle k$ such that

$\displaystyle k^2 < n < (k+1)^2$. We have that $\displaystyle k = [\sqrt{n}]$.

The only numbers in the range $\displaystyle k^2 < n < (k+1)^2$ which are divisible by $k$ are $\displaystyle k^2+k$ and $\displaystyle k^2+2k$.

Thus the numbers $\displaystyle n$ such that $\displaystyle [\sqrt{n}] \mid n$ are of the form

$\displaystyle k^2, k^2+k, k^2+2k$

share|cite|improve this answer
    
Thanks a lot! – anonymous Oct 9 '10 at 15:32

Your Answer

 
discard

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