![]() |
|
|
#1 |
|
Nov 2004
10012 Posts |
How to solve ? - find integers v and x such that
v*v - b = a*x*x where a and b are known and not perfect squares. Last fiddled with by jtavares on 2005-03-17 at 20:08 |
|
|
|
|
|
#2 | |
|
Nov 2003
164448 Posts |
Quote:
Just do a Web search. Note that b needs to split in the quadratic field Q(sqrt(a)) |
|
|
|
|
|
|
#3 |
|
Aug 2002
Buenos Aires, Argentina
55616 Posts |
Just go to my Quadratic Diophantine Equation Solver. It has a step by step mode that shows you how it finds the solutions.
|
|
|
|
|
|
#4 |
|
Nov 2004
910 Posts |
Thanks.
So it seems to me that there is no need to factor a and b. Since when a is equal to 1 v*v - b = x*x can be solved by factoring b - Fermat factorization method. Last fiddled with by jtavares on 2005-03-17 at 20:49 |
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Need backup solution advice | jasong | jasong | 17 | 2013-04-22 03:30 |
| Modular equation solution | otutusaus | Math | 10 | 2010-11-21 17:28 |
| Best solution for 20-digits? | akeiser | Factoring | 9 | 2009-11-12 17:53 |
| Rational solution. | mfgoode | Homework Help | 9 | 2007-08-19 07:19 |
| a new solution to 2^n = 3 (mod n) | maxal | Math | 15 | 2007-02-28 18:42 |