Number Theory

    

On Even Perfect Numbers and Odd Perfect Numbers

Authors: Giovanni Di Savino

Euclid's algorithm can generate even perfect numbers, not only with prime numbers of "Mersenne" but it can generate even perfect numbers, with all prime numbers less than each of the infinite powers 2^n and will assume the form (2^ n - (1+2*n))*2^(n-1). Euclid's algorithm, but with the form: (prime ≥3^n -2) * prime ≥3^(n-1)), generates odd perfect numbers generated by primes distant 2 from the result of a power of a prime number ≥3^n, but with all prime numbers less than 2 or more distant than 2 , all odd perfect numbers are generated and the algorithm will have the following form: (prime ≥3^n -(2+2* n≥0)) * prime ≥3^(n-1)). In the same power, prime number ≥3^n, prime numbers less than prime ≥3^n are distinguished by their distance from the result of prime ≥3^n.

Comments: 6 Pages. (Corrections made by viXra Admin to conform with scholarly norm)

Download: PDF

Submission history

[v1] 2023-02-12 01:57:11

Unique-IP document downloads: 154 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus