Math Is Fun Forum
  Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

#1 Re: This is Cool » I need a help » 2014-05-24 22:26:33

Hi cmowla

This is part of new way to find an alternative proof for Fermat's Last Theorem, I have stumbled at this part for power n=3.

#2 Re: This is Cool » I need a help » 2014-05-24 20:53:42

n=0 is not a trivial because when n=0,

#3 Re: This is Cool » I need a help » 2014-05-24 16:16:47

So far I managed to get through up to this stage:

For divisibility by 3, let n=3x-2, then

Therefore,

Trivial solution is x=1 and alpha=1

There should be no other whole number solution other than the trivial solution.

#4 Re: This is Cool » I need a help » 2014-05-20 23:51:43

Ok..find the non-trivial solutions (i.e. n, alpha=1). I need to find the proof because I am sure there is no other solution exist. Any help?

#5 Re: This is Cool » I need a help » 2014-05-20 23:38:16

Another problem is to find the proof that the only whole number solution for alpha is 1 when n=1 for the following equation:

Otherwise please find the counter-examples.

#6 Re: This is Cool » I need a help » 2014-05-18 22:25:37

Hi bobbym

Okay, I have edited it. This is what happened if you play around with the infinity. I am always skeptic with it, but seeing Ramanujan and Euler played with it and made remarkable things. Maybe I can also using it
too.

#7 Re: This is Cool » I need a help » 2014-05-18 21:34:57

Hi bobbym, thanks for the even one. I am not sure my method is ok or not, lets say,

for odd n

then

Since n=odd,

can never be a perfect square.

#8 Re: This is Cool » I need a help » 2014-05-18 04:55:02

hi bobbym

I know there exist the proof for n=3 but I am working for a simple and short proof and this proof is not the same like the way the proof for n=3 done by Euler etc. I have reduced the fermat's last theorem into polynomials using my sums of power formulation and I am trying to work it out for smaller power and later on the generalize proof for all n.

#9 Re: This is Cool » I need a help » 2014-05-18 04:49:20

Thanks bobbym but can you get the proof in the mathematical symbols, it would be a great help. I need this part for my Fermat's last theorem proof for n=3. I am using my sums of power formulation and exhaustive method to find an alternative proof (simple one) until I stumble upon this part.

#10 Re: This is Cool » I need a help » 2014-05-18 04:28:01

I think the equation could be factorized as follows:

For even n:

and other than alpha=0 or 1, the equation below holds.

Just need to find the proof.

#11 Re: This is Cool » I need a help » 2014-05-18 04:19:01

Ok:) Can someone get a counter examples for other than 0 and 1. I am looking for a proof, I think there shouldn't be any solution other than 0 or 1 but stumble upon finding the proof.

#12 Re: This is Cool » I need a help » 2014-05-18 04:09:42

Hi bobbym, I am looking for other than the trivial solutions.

#13 This is Cool » I need a help » 2014-05-18 02:46:36

Stangerzv
Replies: 24

Can anyone help me to find the proof that the only whole number solution for alpha as in the equation below is 1. Otherwise please find any other solutions (counter-examples)

#14 Re: This is Cool » Could be new Prime and there are only 7 found so far. » 2014-04-14 11:34:47

Hi bobym

For

n=26 gives the highest prime for for n ≤ 4000.

#15 Re: This is Cool » Could be new Prime and there are only 7 found so far. » 2014-04-13 23:43:12

Hi bobbym

I haven't tried it yet but for

n=26 gives the highest prime for n≤ 8000

#16 Re: This is Cool » Could be new Prime and there are only 7 found so far. » 2014-04-13 11:33:48

Hi bobbym

I have done with the calculation for


n=26 is the highest prime for n ≤ 5000.

#17 Re: This is Cool » Could be new Prime and there are only 7 found so far. » 2014-04-12 13:53:29

There are only three double primes by combining the equations above. The double prime generalize equation is gives as follows:

n=6, Ps=701, 739

n=10, Ps=3628747, 3628853

n=26, Ps=403291461126605635583999651, 403291461126605635584000349

#18 Re: This is Cool » Could be new Prime and there are only 7 found so far. » 2014-04-12 13:46:35

Another version of the prime yields 6 primes so far

n=2, Ps=-1+2+1*2=3

n=6, Ps=-1+2+3+4+5+6+1*2*3*4*5*6=739

n=10, Ps=-1+2+3+4+5+6+7+8+9+10+1*2*3*4*5*6*7*8*9*10=3628853

n=14, Ps=-1+2+3+4+5+6+7+8+9+10+11+12+13+14+1*2*3*4*5*6*7*8*9*10*11*12*13*14=87178291303

n=22, Ps=-1+2+3+4+5+6+7+8+9+10+11+12+13+14+..+22+1*2*3*4*5*6*7*8*9*10*11*12*13*14*..*22=1124000727777607680251

n=26, Ps=-1+2+3+4+5+6+7+8+9+10+11+12+13+14+..+26+1*2*3*4*5*6*7*8*9*10*11*12*13*14*..*26=403291461126605635584000349

#19 Re: This is Cool » Could be new Prime and there are only 7 found so far. » 2014-04-12 12:42:39

Hi bobbym

Sorry there is a mistake with the minus sign, I've edited it. Basically 1-2-3-..n=2-(1+2+3) and 1*2*..n=n!, the first equation is the generalize equation for the primes.

#20 This is Cool » Could be new Prime and there are only 7 found so far. » 2014-04-12 11:53:29

Stangerzv
Replies: 10

The equation is given as follows:

Example:

n=1, Ps=1+1=2

n=3, Ps=1-2-3+1*2*3=2

n=5, Ps=1-2-3-4-5+1*2*3*4*5=107

n=6, Ps=1-2-3-4-5-6+1*2*3*4*5*6=701

n=10, Ps=1-2-3-4-5-6-7-8-9-10+1*2*3*4*5*6*7*8*9*10=3628747

n=13, Ps=1-2-3-4-5-6-7-8-9-10-11-12-13+1*2*3*4*5*6*7*8*9*10*11*12*13=6227020711


n=26, Ps=1-2-3-4-5-6-7-8-9-10-11-12-13-..-26+1*2*3*4*5*6*7*8*9*10*11*12*13*..26=403291461126605635583999651

#21 Re: This is Cool » Prime Number with (mod3) I Hope it could be new one. » 2013-12-11 00:09:39

Thanks for the proof:) Basically, y also can be prime for odd composite p (i.e. p=299) but I am limiting it only to prime p for making it harder to find.

#22 Re: This is Cool » Prime Number with (mod11) I Hope it could be new one. » 2013-12-10 23:51:21

Thanks Nehustan, I didn't notice when p=11, the same applies to p=3 for mod(3).

#23 This is Cool » Prime Number with (mod11) I Hope it could be new one. » 2013-12-10 18:33:02

Stangerzv
Replies: 2

I have encountered a new property in which I hope nobody has found it yet.

The equation is given as follows:

If p is prime and greater than 3 then,

In other words,

If p is prime then

is a whole number.

Prime generated y is given as follows:

y(59)=9090909090909090909090909090909090909090955556068481876491
y(3109)=9090909090909090909090909090 9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090909090909090909090909090909090909090
9090916761247679844122304328506045308491

#24 This is Cool » Prime Number with (mod3) I Hope it could be new one. » 2013-12-10 18:15:20

Stangerzv
Replies: 2

I have encountered a new property in which I hope nobody has found it yet.

The equation is given as follows:

If p is prime and greater than 3 then,

In other words,

If p is prime then

is a whole number.

Prime generated y is given as follows:

y(7)=- 90825083
y(47)=33333333333333333333333333333315800289254723317
y(79)=3 333333333333333333333333333333333333333333333333333333333330177241305791050933
y(83)=33333333333333333333333333333333333333333333333333333333333333328161319604264715517

#25 Re: This is Cool » My New Twin Prime Numbers » 2013-10-21 02:00:44

Hi Bobbym

It would take some times and I would let you know when it is done.

Board footer

Powered by FluxBB