Lehmer's totient problem over F_q [x]
From MaRDI portal
Publication:524846
Abstract: In this paper, we consider the function field analogue of the Lehmer's totient problem. Let and be the Euler's totient function of over where is a finite field with elements. We prove that if and only if (i) is irreducible; or (ii) is the product of any non-associate irreducibes of degree or (iii) is the product of all irreducibles of degree all irreducibles of degree and and the product of any irreducibles one each of degree and .
Recommendations
- Some analogues of a Lehmer problem on the totient function
- On a Lehmer problem concerning Euler's totient function
- On Lehmer's totient problem and its unitary analogue
- A q-analogue of Lehmer's congruence
- Lehmer's problem and splitting of rational primes in number fields
- Fermat's problem and Goldbach's problem over \(M_ n \mathbb{Z}\)
- On the Lehmer conjecture and counting in finite fields
- Lehmer numbers and primitive roots modulo a prime
- A counter-example to the \(q\)-Levi problem in \(P^ n\)
- CONGRUENCES AND LEHMER'S PROBLEM
Cites work
- scientific article; zbMATH DE number 3679908 (Why is no real title available?)
- scientific article; zbMATH DE number 3760283 (Why is no real title available?)
- scientific article; zbMATH DE number 3513870 (Why is no real title available?)
- a-convexity
- Composite integers n for which (n) n-1
- Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
- On Euler’s totient function
- On \(k\)-Lehmer numbers
- On composite integers \(n\) for which \(\varphi(n)\mid n-1\)
- On the congruence \(N \equiv A \pmod{\varphi (N)}\)
- The least prime congruent to one modulo \(n\)
Cited in
(3)
This page was built for publication: Lehmer's totient problem over \(\mathbb{F}_q [x]\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q524846)