Facteurs premiers des coefficients binomiaux
Factorization of matrices associated with classes of arithmetical functions
Let f be an arithmetical function. A set S = x₁,..., xₙ of n distinct positive integers is called multiple closed if y ∈ S whenever x|y|lcm(S) for any x ∈ S, where lcm(S) is the least common multiple of all elements in S. We show that for any multiple closed set S and for any divisor chain S (i.e. x₁|...|xₙ), if f is a completely multiplicative function such that (f*μ)(d) is a nonzero integer whenever d|lcm(S), then the matrix having f evaluated at the greatest common divisor of and as its...
Farhi arithmetic functions associated to Lucas sequences
Fermat test with Gaussian base and Gaussian pseudoprimes
The structure of the group and Fermat’s little theorem are the basis for some of the best-known primality testing algorithms. Many related concepts arise: Euler’s totient function and Carmichael’s lambda function, Fermat pseudoprimes, Carmichael and cyclic numbers, Lehmer’s totient problem, Giuga’s conjecture, etc. In this paper, we present and study analogues to some of the previous concepts arising when we consider the underlying group . In particular, we characterize Gaussian Carmichael numbers...
Fibonacci Numbers with the Lehmer Property
We show that if m > 1 is a Fibonacci number such that ϕ(m) | m-1, where ϕ is the Euler function, then m is prime
Finite vector spaces and certain lattices.
F-Normalreihen.
Fonctions arithmétiques [Book]
Fonctions d'Euler-Jordan et de Gauß et exponentielle dans les semi-anneaux de Burnside
Fonctions multiplicatives et équations différentielles
Formule d'inversion et fonction de Möbius sur les ensembles ordonnés
From explicit estimates for primes to explicit estimates for the Möbius function
Funktionen über lokal endlichen Halbordnungen II.
Further results on derived sequences.