You are not logged in.
It has one zero but it isn't rational:
I forgot to put the url back:
http://mathworld.wolfram.com/GoldenRatio.html
How to write ">" in LaTeX?
Why when I write:
i get:
Number of the form
For lineal d.e. we can use the this
Actually the katy's polynomial is unractorizable.
If you divide your equation by x-1 you will get x² - 2x - 15
This means that (x-1)( x² - 2x - 15) = x³ + 3x² +13x - 15
Factoring the second part of the product gives (x-5)(x+3)
So (x-1)(x-5)(x+3) = x³ + 3x² +13x - 15
This is completely factored because there are no powers of x above one.
Not.
(x-1)(x^2-2x-15)=x^3-2x^2-15x-x^2+2x+15=x^3-3x^2-13x+15
Great!
Siva is right!
Well done, Siva!
Let look at the neightbours of n in chain with length n amd maxNumber n:
{...,x,n,y,...}
We take that n>x>y. Then n+x and n+y are perfect squares, so:
n>5.
How to produce ">" in LaTeX?
John, i' explain later.
I got interesting results. But first I have to define a function:
Let
We have that sq↑[x]>x.
Let sq↑[sq↑[sq↑[...sq↑[x]]]]=sq↑n[x]
When you have the proof please don't post it immediately. I want to test myself.
How old are you Seerj
Let start.
for any square s
s==0,1(mod 4).
So the sum of two conseuense numbers must be ==0,1(mod 4).
We have this cases:
If n == 0 (mod 4) then the neightbours of n must be == 0,1 (mod 4)
If n == 1 (mod 4) then the neightbours of n must be == 3,0 (mod 4)
If n == 2 (mod 4) then the neightbours of n must be == 2,3 (mod 4)
If n == 3 (mod 4) then the neightbours of n must be == 1,2 (mod 4)
That's a begining.
So the problem is mathematical, not programmical.
Yes, but actually length =0 and length=1 are trivial.
Hi. I don't know. And don't delete your e-mail and phone number.
I thing for computing these we might use come algoritm simular to the labyrinth algoritm.
But is really 32 the minimum?
This is great!
Post error:
At least 60 seconds have to pass between posts. Please wait a little while and try posting again.