Primes, permutations and primitive roots.
Primes with preassigned digits
Primitive free quartics with specified norm and trace
Primitive Lucas d-pseudoprimes and Carmichael-Lucas numbers
Let d be a fixed positive integer. A Lucas d-pseudoprime is a Lucas pseudoprime N for which there exists a Lucas sequence U(P,Q) such that the rank of appearance of N in U(P,Q) is exactly (N-ε(N))/d, where the signature ε(N) = (D/N) is given by the Jacobi symbol with respect to the discriminant D of U. A Lucas d-pseudoprime N is a primitive Lucas d-pseudoprime if (N-ε(N))/d is the maximal rank of N among Lucas sequences U(P,Q) that exhibit N as a Lucas pseudoprime. We derive...
Primitive Points on a Modular Hyperbola
For positive integers m, U and V, we obtain an asymptotic formula for the number of integer points (u,v) ∈ [1,U] × [1,V] which belong to the modular hyperbola uv ≡ 1 (mod m) and also have gcd(u,v) =1, which are also known as primitive points. Such points have a nice geometric interpretation as points on the modular hyperbola which are "visible" from the origin.
Primitive prime divisors in polynomial arithmetic dynamics.
Primitive prime factors in second-order linear recurrence sequences
Primitive roots and powers among values of polynomials over finite fields.
Primitive roots and quadratic non-residues
Primzahlen.
Primzahlen als achte Potenzreste.
Příspěvek k nauce o číslech
Příspěvek k nauce o číslech
Příspěvek k nauce o nekonečných řetězcích
Příspěvek k nauce o zlomcích řetězových neb řetězcích
Příspěvek k reducibilitě binomických kongruencí
Problème sur les progressions arithmétiques.
Problèmes sur quelques fonctions numériques
Product formulae on elliptic curves.
Products of binomial coefficients modulo p²