p = +/- 3^x +/- 2^y
in [Math]
|
Prev: x^3+y^3+z^3 = N
Next: Mathematical Convention
From: M.A.Fajjal on 20 Apr 2010 01:26 Is there any proof that any prime number can be expressed in the form p = +/- 3^x +/- 2^y where x and y are positive integers
From: M.A.Fajjal on 20 Apr 2010 02:15 > Is there any proof that any prime number can be > expressed in the form > p = +/- 3^x +/- 2^y > > where x and y are positive integers I have found a lot of exceptions
From: master1729 on 20 Apr 2010 02:53 M.A.Fajjall wrote : > Is there any proof that any prime number can be > expressed in the form > p = +/- 3^x +/- 2^y > > where x and y are positive integers that is incorrect. large enough p = 3^a + 3^b - 2^c - 2^d - 2^e - 2^f +/- O(14) tommy1729
From: Pubkeybreaker on 20 Apr 2010 08:13 On Apr 20, 5:28 am, "M.A.Fajjal" <h2...(a)yahoo.com> wrote: > > Is there any proof that any prime number can be > > expressed in the form > > p = +/- 3^x +/- 2^y > > > where x and y are positive integers > > where x and y are non-negative integers
From: Pubkeybreaker on 20 Apr 2010 08:31
On Apr 20, 8:13 am, Pubkeybreaker <pubkeybrea...(a)aol.com> wrote: > On Apr 20, 5:28 am, "M.A.Fajjal" <h2...(a)yahoo.com> wrote: > > > > > > Is there any proof that any prime number can be > > > expressed in the form > > > p = +/- 3^x +/- 2^y > > > > where x and y are positive integers > > > where x and y are non-negative integers- Hide quoted text - > Opps. My reply was empty. Count the number of integers of the form +/- 3^x +/- 2^y up to N. Count the number of primes. Now let N --> oo. |