A Generalization of Euler's Criterion to Composite Moduli
classification
🧮 math.NT
keywords
eulercompositecriteriongeneralizationbinomialcentralcircumventingconcepts
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.