z4lis
all I can say is don't hate, appreciate. Read my proof with understanding and look for genuine loop holes and I bet you won't find any.
Moderators: gmalivuk, Prelates, Moderators General
You, sir, name? wrote:If you have over 26 levels of nesting, you've got bigger problems ... than variable naming.
suffer-cait wrote:it might also be interesting to note here that i don't like 5 fingers. they feel too bulky.
MrAwojobi wrote:Penitent87
you are simply being obstinate. You keep substituting numbers into Beal's equation. The expression cannot be factorised without numbers.
MrAwojobi wrote:z4lis
all I can say is don't hate, appreciate. Read my proof with understanding and look for genuine loop holes and I bet you won't find any.
SIMPLE PROOF OF BEAL’S CONJECTURE
(THE $100 000 PRIZE ANSWER)
You, sir, name? wrote:If you have over 26 levels of nesting, you've got bigger problems ... than variable naming.
suffer-cait wrote:it might also be interesting to note here that i don't like 5 fingers. they feel too bulky.
MrAwojobi wrote:It isn’t difficult to see that the only way for
the 1st product + the 2nd product = the 3rd product
is if and only if the left hand side of the equation can be factorised.
MrAwojobi wrote:antonfire
I will give an example here by factorising 16 + 4 =20
4(4 + 1) = 20
16, 4 and 20 share common factors, 2 and 4
That is not an answer to my question.MrAwojobi wrote:antonfire
I will give an example here by factorising 16 + 4 =20
4(4 + 1) = 20
16, 4 and 20 share common factors, 2 and 4
MrAwojobi wrote:It isn’t difficult to see that the only way for
the 1st product + the 2nd product = the 3rd product
is if and only if the left hand side of the equation can be factorised.
Jerry Bona wrote:The Axiom of Choice is obviously true; the Well Ordering Principle is obviously false; and who can tell about Zorn's Lemma?
Talith wrote:SIMPLE PROOF OF GOLDBACH'S CONJECTURE
(THE $100 000 000 PRIZE ANSWER)
It should be clear that each term in the equation n = p + q can be broken down into the sum of its primes. It isn’t difficult to see that the only way for
the first prime + the second prime = thebignumberwewanttomaketheprimesequalto
is if and only if the left hand side of the equation can be summarised. This will therefore guarantee that p and q add together to make n.
Users browsing this forum: Google Feedfetcher and 1 guest