Displaying similar documents to “Hamiltonian paths in the complete graph with edge-lengths 1, 2, 3.”

Perfect arithmetic codes

H. W., Jr. Lenstra (1977-1978)

Séminaire Delange-Pisot-Poitou. Théorie des nombres

Similarity:

Odd perfect numbers of a special form

Tomohiro Yamada (2005)

Colloquium Mathematicae

Similarity:

We show that there is an effectively computable upper bound of odd perfect numbers whose Euler factors are powers of fixed exponent.