Re: Fermat's Last Theorem

On Sun, 11 Nov 2007 10:48:15 EST, bassam king karzeddin
<bassam@xxxxxxxxxx> wrote:

On Nov 10, 7:12 am, bassam king karzeddin
<bas...@xxxxxxxxxx> wrote:
Dear All

The following conjecture may be considered as a
more generalized form of FLT conjecture, but it may
much easier to prove, Do you know why?
Thank You

If (X & Y) are two odd coprime positive integers,
then the following integer equation doesn't have any
solution in all integer numbers

Z^P = X^P + Y^P + 2*N*X*Y*Z

Where (P) is odd prime number, (Z & N) are positive
integers

**Note that there are many generalizations to the
above form

Best of luck

Bassam Karzeddin
Al-Hussein Bin Talal University
JORDAN

For E-mail insert (.) between b &
karzed...@xxxxxxxxx

Let x = 19, y = 21, z = 52, p = 3, n = 3.

Marcus.


Nice, May be I have forgotten to add that (N is prime to P) necessary condition

I will verify and come back with more explanations since it is too old in my head

Here's a counterexample where n is relatively prime to p:

x = 1, y = 7, z = 172, p = 3, n = 2113

quasi
.

Relevant Pages

  • Re: Fermats Last Theorem
    ... The following conjecture may be considered as a more ... generalized form of FLT conjecture, ... Message was edited by: bassam king karzeddin ...
    (sci.math)
  • Re: Fermats Last Theorem
    ... more generalized form of FLT conjecture, ...
    (sci.math)
  • Re: Probable Prime Number
    ... bassam king karzeddin wrote: ... I would like to introduce the following conjecture about prime ... factorization without having a proof or a counter example or a reference. ... We can express 2*p_i as a sum of squares, so we can find a suitable n ...
    (sci.math)
  • Re: Probable Prime Number
    ... bassam king karzeddin wrote: ... I would like to introduce the following conjecture about prime factorization without having a proof or a counter example or a reference. ...
    (sci.math)
  • Re: Probable Prime Number
    ... bassam king karzeddin wrote: ... I would like to introduce the following conjecture about prime factorization without having a proof or a counter example or a reference. ...
    (sci.math)