On odd integers and their couples of divisors

Giuseppe Buffoni


A composite odd integer can be expressed as product of two odd integers. Possibly this decomposition is not unique. From 2n + 1 = (2i + 1)(2j + 1) it follows that n = i + j + 2ij. This form of n characterizes the composite odd integers. It allows the formulation of simple algorithms to compute all the couples of divisors of odd integers and to identify the odd inetegers with the same number of couples of divisors (including the primes, with the number of non trivial divisors equal to zero). The distributions of odd integers ≤ 2n+1 vs. the number of their couples of divisors have been computed up to n ≃ 5 10^7, and the main features are illustrated.

Full Text:



T. M. Apostol, Introduction to analytic number theory. Springer-Verlag, Berlin, 1976.

A. Languasco and A. Zaccagnini, Introduzione alla crittografia. U. Hoepli Editore, Milano, 2004.

PARI/GP computer algebra system develoiped by H. Cohen et al., 1985. Available from: http://pari.math.u.bordeaux.fr/

The GNU MP Bignum Library. Available from: http:77gmplib.org/

DOI: http://dx.doi.org/10.23755/rm.v40i1.618


  • There are currently no refbacks.

Copyright (c) 2021 Giuseppe Buffoni

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Ratio Mathematica - Journal of Mathematics, Statistics, and Applications. ISSN 1592-7415; e-ISSN 2282-8214.