摘要
A criterion is presented in order to decide whether a given integer is a prime power or not. The criterion associates to each positive integer m a finite set of integers S(m), each of them < m, and the properties of this set are studied. The notion of complementary pairs in S (m) is introduced and it is proved that if one is able to determine a complementary pair n, n', then a partial factorization of the odd integer m can be obtained in polynomial time. Some particular cases and examples of these results are given.
- 出版日期2017