Perfect numbers were defined by Euclid with a proposition: "If we want as many numbers as we want starting from a unit, they are continuously arranged in double proportion, until the sum of all becomes a prime, and if the sum multiplied in the last one forms a , the product will be perfect"; Euler proved that even perfect numbers can be generated as defined by Euclid and are the result of (2^n -1) * 2^(n-1). Odd perfect numbers can be defined and generated with the proposition and algorithm with which even perfect numbers are defined and generated with the following modifications: a) the prime number 2 reported in Euler's algorithm is replaced by one of the infinite numbers first courses ≥ 3; b) the distance that the prime number must have from the result of a power of prime numbers ≥ 3^n is 2; c) with prime numbers ≥ 3, the "double proportion", reported in Euclid's proposition and generated by the number 2, becomes the triple proportion or the quintuple or.......the proportion of the nth prime number. With the modifications to situations defined as similar, "the generation of perfect odds is similar to the generation of perfect evens" and, also the algorithms with which the perfect numbers are generated are similar: the even perfect numbers are the result of ((2^n -1) * 2^(n-1))/(2-1), the odd perfect numbers are the result of ((prime ≥ 3^n -2) * prime ≥ 3^(n-1))/( first≥3-1).