Congruence speed smaller than the product of their factors
Abstract
This Python program lists the positive integers (not multiples of 10) whose constant congruence speed is smaller than the product of the constant congruence speeds of all their prime factors. The prime factors are considered with their multiplicity (e.g., the prime factors of 75 are 3, 5, and 5, and thus the product of their constant congruence speeds equals 1*2*2 = 4).
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 4 January 2026