scientific article; zbMATH DE number 1391687
If \(a\) has multiplicative order \((N-1)/d\) to a composite modulus \(N\), we say that \(N\) is a \(d\)-pseudoprime to base \(a\). It has shown by \textit{L. Somer} [Théorie des nombres, C. R. Conf. Int., Québec/Can. 1987, 841-860 (1989; Zbl 0687.10004)] that for given integers \(d\geq 2\) and \(a\), there are at most finitely many \(d\)-pseudoprimes to base \(a\). Similarly, if we define \(N\) to be \(k\)-perfect if \(\sigma(N)= kN\), then there are at most finitely many square-free \(k\)-perfect integers \(N\) having a given number of prime factors. Again, it was shown by \textit{C. Pomerance} [Pac. J. Math. 69, 177-186 (1976; Zbl 0342.10005)] that for a given integer \(d>1\) there are at most finitely many integers \(N\) with a given number of prime factors, having the property that \(\varphi(N)= (N-1)/d\). Lehmer had asked whether one could ever have \(\varphi(N)|N-1\) for a composite \(N\). The present paper gives a unified treatment of all these results.
- On \(\mu\)-Sondow numbers
- A Note on Perrin Pseudoprimes
- Square-free Lucas d-pseudoprimes and Carmichael-Lucas numbers
- scientific article; zbMATH DE number 4125464 (Why is no real title available?)
- scientific article; zbMATH DE number 6957532 (Why is no real title available?)
- Width-k generalizations of classical permutation statistics
- On some problems of W. Sierpiński
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4936027)