Raffaele
- 6
- 0
I noticed that for any integer greater than 4 there exists at least one perfect square in the open interval (n, 2n). I think I have proved the statement, but as I am not a professional, I'd like someone to review my proof.
By induction we see that it is true for n=5 because 5<9<10.
Now suppose that it is true for n, and let's prove it for n + 1.
From the inductive hypothesis we know that there is an x such that n<x^2<n+1. This square should work for n + 1 too. Like in the case of n=5 the square 9 works for 6, 7 and 8 too. But not for n=9 or greater. Here we need the next square 16.
So if x^2\ge n+1 we must show that (x+1)^2 is the square we need. In other words we have to verify that
n+1<(x+1)^2<2(n+1)
Notice that for positive n, if x^2\le n+1 then x\le \sqrt{n+1}. As n<x^2 it follows that
n+1<x^2+1<x^2+2x+1=(x+1)^2
We have to show that (x+1)^2<2(n+1)
(x+1)^2=x^2+2x+1<\left(n+1\right)+2\sqrt{n+1}+1
\left(n+1\right)+2\sqrt{n+1}+1 < 2(n+1)
n^2-4n-4>0\rightarrow n>2\sqrt 2 + 2\rightarrow n\ge 5
So we proved that for any n\ge 5 there is at least one x such that n< x^2 < 2n.
By induction we see that it is true for n=5 because 5<9<10.
Now suppose that it is true for n, and let's prove it for n + 1.
From the inductive hypothesis we know that there is an x such that n<x^2<n+1. This square should work for n + 1 too. Like in the case of n=5 the square 9 works for 6, 7 and 8 too. But not for n=9 or greater. Here we need the next square 16.
So if x^2\ge n+1 we must show that (x+1)^2 is the square we need. In other words we have to verify that
n+1<(x+1)^2<2(n+1)
Notice that for positive n, if x^2\le n+1 then x\le \sqrt{n+1}. As n<x^2 it follows that
n+1<x^2+1<x^2+2x+1=(x+1)^2
We have to show that (x+1)^2<2(n+1)
(x+1)^2=x^2+2x+1<\left(n+1\right)+2\sqrt{n+1}+1
\left(n+1\right)+2\sqrt{n+1}+1 < 2(n+1)
n^2-4n-4>0\rightarrow n>2\sqrt 2 + 2\rightarrow n\ge 5
So we proved that for any n\ge 5 there is at least one x such that n< x^2 < 2n.