Let n be an integer. Show that, if 2 + 2*sqrt(1 + 12n^2) is an integer, then it is a perfect square number.
Not that one'd help, but no calculators allowed.
sqrt() = square root by the way.
If you're confused about my notation, I'm saying "Show that, if 2 plus 2 times the square root of (1 + 12n squared) is an integer, then it is a perfect square number".
And no, you can't just say "Let n = 2. Then 2 + 2*sqrt(1+12*2^2) = 16". You have to prove it for n.
ID:184163
Dec 14 2006, 7:01 am (Edited on Dec 14 2006, 7:09 am)
|
|
In response to Nishiatsu
|
|
What?
|
mob/verb/Solve_Math(n as num)
if(2 + 2*sqrt(1 + 12*n**2)) world<<"[n] is a perfect square number." ;] |
In response to Airjoe
|
|
That doesn't even work. Let n = 3.
|
In response to Abhishake
|
|
Abhishake wrote:
That doesn't even work. Let n = 3. 3 is not a perfect square |
In response to Shlaklava
|
|
The question means that if 2 + sqrt(1 + 12n^2) is an integer, 2 + sqrt(1+12n^2) is a perfect square.
And to Airjoe I was showing his code wouldn't work when n = 3. |
Won't that work?