arXiv · 1507.00098
A Generalization of Euler's Criterion to Composite Moduli
Abstract
A necessary and sufficient condition is provided for the solvability of a binomial congruence with a composite modulus, circumventing its prime factorization. This is a generalization of Euler's Criterion through that of Euler's Theorem, and the concepts of order and primitive roots. Idempotent numbers play a central role in this effort.
Explore related subjects
Keep this discovery
József Vass. 2015-07-01. A Generalization of Euler's Criterion to Composite Moduli. https://arxiv.org/abs/1507.00098
Cite the original work for its findings. Save a collection to share your selection of sources.