MHB Determine all postive integer k

  • Thread starter Thread starter anemone
  • Start date Start date
  • Tags Tags
    Integer
AI Thread Summary
The discussion centers on determining positive integers \( k \) for which the function \( f(k) = \left\lfloor{\dfrac{k}{\left\lfloor{\sqrt{k}}\right\rfloor}}\right\rfloor \) satisfies \( f(k) > f(k+1) \). A key point made is that for \( k = n^2 + a \) where \( 0 < a < 2n \), the function can be expressed as \( f(k) = n + \left\lfloor{\dfrac{a}{n}}\right\rfloor \), indicating that \( f(k) \) is non-decreasing. This suggests that the conditions for \( f(k) > f(k+1) \) may be limited. The conversation emphasizes the simplicity of proving this property, indicating that the analysis is straightforward. Overall, the focus is on the behavior of the function and the specific conditions under which it decreases.
anemone
Gold Member
MHB
POTW Director
Messages
3,851
Reaction score
115
Determine all positive integers $k$ for which $f(k)>f(k+1)$ where $f(k)=\left\lfloor{\dfrac{k}{\left\lfloor{\sqrt{k}}\right\rfloor}}\right\rfloor$ for $k\in \Bbb{Z}^*$.
 
Mathematics news on Phys.org
anemone said:
Determine all positive integers $k$ for which $f(k)>f(k+1)$ where $f(k)=\left\lfloor{\dfrac{k}{\left\lfloor{\sqrt{k}}\right\rfloor}}\right\rfloor$ for $k\in \Bbb{Z}^*$.

if k+1 is not a perfect square then the floor of square root of k and k+ 1 are same so
f(x) < f(x+1)
so we need to look at k+1 being a perfect square say $n^2$
$f(k) = \left\lfloor\dfrac{n^2-1}{n-1}\right\rfloor= n + 1$
$f(k+1) = \left\lfloor\dfrac{n^2}{n}\right\rfloor= n$
so k is of the form $n^2-1$ for $n\gt 1$
 
kaliprasad said:
if k+1 is not a perfect square then the floor of square root of k and k+ 1 are same so
f(x) < f(x+1)
so we need to look at k+1 being a perfect square say $n^2$
$f(k) = \left\lfloor\dfrac{n^2-1}{n-1}\right\rfloor= n + 1$
$f(k+1) = \left\lfloor\dfrac{n^2}{n}\right\rfloor= n$
so k is of the form $n^2-1$ for $n\gt 1$

Hey kaliprasad, thanks for participating and your answer is correct! I think it might be necessary(?) to prove that for $k=n^2+a$ with $0<a<2n$,

$f(k)=\left\lfloor{\dfrac{n^2+a}{n}}\right\rfloor=n+\left\lfloor{\dfrac{a}{n}}\right\rfloor$ which is non-decreasing.

But then this is an easy proof, so, there is no big deal here.:)
 
anemone said:
Hey kaliprasad, thanks for participating and your answer is correct! I think it might be necessary(?) to prove that for $k=n^2+a$ with $0<a<2n$,

$f(k)=\left\lfloor{\dfrac{n^2+a}{n}}\right\rfloor=n+\left\lfloor{\dfrac{a}{n}}\right\rfloor$ which is non-decreasing.

But then this is an easy proof, so, there is no big deal here.:)
Hello Anemone,
Both are effectively same as $k= n^2+ a$ with $0\lt a\lt2n$ is same as k+1 is not perfect square and I have mentioned that numerator is increasing and denominator is constant and I should have said $f(x) \le f(x+1)$ instead of $f(x) \lt f(x+1)$
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Thread 'Imaginary Pythagoras'
I posted this in the Lame Math thread, but it's got me thinking. Is there any validity to this? Or is it really just a mathematical trick? Naively, I see that i2 + plus 12 does equal zero2. But does this have a meaning? I know one can treat the imaginary number line as just another axis like the reals, but does that mean this does represent a triangle in the complex plane with a hypotenuse of length zero? Ibix offered a rendering of the diagram using what I assume is matrix* notation...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Back
Top