Math Help Forum

Math Help Forum Feed Site Feed

Go Back   Math Help Forum > University Math Help > Number theory
Reply
 
Thread Tools Display Modes
  #1  
Old July 17th, 2006, 03:45 AM
Newbie
 
Join Date: Jul 2006
Location: philippines
Posts: 4
Thanks: 0
Thanked 0 Times in 0 Posts
sheryl is on a distinguished road
Question solution please...can anyone show the proof...

Is there anyone who can show that the equation:

n^4 - n^2*m^2+m^4 = s^2, (where m, n and s are positive integers) has no integer solutions with |n| > |m| except (n^2, m^2) = (1, 0)


I will appreciate it if anyone can give at least a reference where the proof can be found.

Thanks!
Reply With Quote
Advertisement
 
  #2  
Old July 18th, 2006, 11:11 AM
ThePerfectHacker's Avatar
Global Moderator

 
Join Date: Nov 2005
Location: New York City
Posts: 11,177
Country:
Thanks: 482
Thanked 3,779 Times in 3,073 Posts
ThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond repute
Default

I am working on this.
I see two ways to approach it, one method is below using Pythagorean Triples.
---
You can state that,
n^2-m^2=2uv
nm=u^2-v^2
s=u^2+v^2
__________________

To view links or images in signatures your post count must be 10 or greater. You currently have 0 posts.


"Democracy has proved only that the best way to gain power
over people is to assure the people that they are ruling
themselves. Once they believe that, they make wonderfully
submissive slaves." - Joseph Sobran


To view links or images in signatures your post count must be 10 or greater. You currently have 0 posts.
Reply With Quote
  #3  
Old July 19th, 2006, 08:12 PM
malaygoel's Avatar
Super Member
 
Join Date: May 2006
Location: India
Posts: 642
Country:
Thanks: 38
Thanked 137 Times in 127 Posts
malaygoel has a spectacular aura aboutmalaygoel has a spectacular aura about
Send a message via Yahoo to malaygoel
Default

Quote:
Originally Posted by sheryl
Is there anyone who can show that the equation:

n^4 - n^2*m^2+m^4 = s^2, (where m, n and s are positive integers) has no integer solutions with |n| > |m| except (n^2, m^2) = (1, 0)


I will appreciate it if anyone can give at least a reference where the proof can be found.

Thanks!
Just a thought.

We have to prove that there does not exist two integers n and m such that
n^4 -n^2m^2 +m^4 is a perfect square.
So we equalled it to s^2.
We can solve the equation for n^2 and show that the discriminant cannot be zero.
n^4 - m^2n^2 +(m^4-s^2)=0
We get
(n^2 - \frac{m^2\pm \sqrt{(m^2)^2-4(m^4-s^2)}}{2})=0
(n^2-\frac{m^2 \pm \sqrt{4s^2 -3m^4}}{2})=0
Since the expression is a perfect square, 4s^2 -3m^4 has to be zero which is not possible.
We have also the case in which 4s^2 -3m^4 is a pefect square.

Malay
Reply With Quote
Reply

Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Trackbacks are Off
Pingbacks are Off
Refbacks are Off
Forum Jump


All times are GMT -7. The time now is 08:47 AM.


Powered by vBulletin® Version 3.7.3
Copyright ©2000 - 2010, Jelsoft Enterprises Ltd.
SEO by vBSEO 3.2.0 ©2008, Crawlability, Inc.
©2005 - 2009 Math Help Forum


Math Help Forum is a community of maths forums with an emphasis on maths help in all levels of mathematics.
Register to post your math questions or just hang out and try some of our math games or visit the arcade.