Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.

Topic: ultra-superclarity Re: clarity in the formal proof of No Odd Perfect
#1357 Correcting Math

Replies: 7   Last Post: Jan 3, 2014 7:06 PM

 Messages: [ Previous | Next ]
 plutonium.archimedes@gmail.com Posts: 8,758 Registered: 3/31/08
ultra-superclarity Re: clarity in the formal proof of No Odd Perfect
#1357 Correcting Math

Posted: Jan 2, 2014 10:46 PM

ultra-superclarity Re: clarity in the formal proof of No Odd Perfect #1357 Correcting Math

The proof is in, and it is unsinkable but I need to keep on making minor adjustments for that ultra-clarity.

____________________________________________
Proof that No Odd Perfect Number (except 1) Exists
____________________________________________

Suppose k is an arbitrary odd perfect number which means the sum of its
cofactors is equal to 2. Algebraically it is written as 2k/k = 2 but better written to focus on the numerator of (2k) with its component cofactors as this:

2(numerator)/k = 2.

The equation 2(numerator)/k = 2 is more general than 2k/k =2, and more general in that we add piecewise the cofactors that makes up the numerator.

Now k is a sum of reciprocals of cofactors obeying this equation

(f1/k + f2/k) + (f3/k + f4/k) + . . + (fn/k + fm/k) = 2t/k.

Since the numerator sum must be even because we add up pairs of odd numbers as cofactors, for in an odd k, all its divisors are odd and adding odd with odd is even so the numerator is finally 2t.

Now in this proof we add the cofactors of the equation incrementally.

So we can list the cofactors as this list:

(f1/k + f2/k) = (2s)/k where s is minimally reduced.

(f3/k + f4/k) = (2r)/k where r is minimally reduced.

(f5/k + f6/k) = (2u)/k where u is minimally reduced.

(f7/k + f8/k) = (2v)/k where v is minimally reduced.

Out to (fn/k + fm/k)

Now we made the assumption or supposition k was Odd Perfect meaning it obeys 2(numerator)/k = 2, and we finally apply that to the fact that the numerator is this summation of 2s + 2r + 2u + 2v + . . (fn/k +fm/k) = 2t

We cannot say 2(2s)/k is equal to 2 nor can we say 2(2s+2r)/k is equal to 2
nor can we say 2(2s + 2r + 2u)/k is equal to 2 but as we add more and more of the terms of the numerator we are getting closer and closer to 2(2t)/k =2.

Remember, we assumed k as Odd Perfect and in that assumption k satisfies 2(2t)/k = 2 since the 2t is independent of the 2numerator/k=2. Now we have the contradiction at hand for we have 2*2t/k = 2 and that is 2t/k = 1 and that is 2t = k where k is a odd number and t if not odd is reduced to odd and is a smaller odd number than k and the contradiction is obvious in that no odd number multiplied by an even is another odd number.

QED

--

Recently I re-opened the old newsgroup of 1990s and there one can read my recent posts without the hassle of mockers and hatemongers.