EuDML | Browse

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Subjects
11-XX Number theory
11Axx Elementary number theory
11A25 Arithmetic functions; related numbers; inversion formulas

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 17 of 17

Majoration explicite de l'ordre maximum d'un élément du groupe symétrique

Jean-Pierre Massias (1984)

Annales de la Faculté des sciences de Toulouse : Mathématiques

Majorations de fonctions arithmétiques en moyenne sur des ensembles de faible densité

B. LANDREAU (1987/1988)

Seminaire de Théorie des Nombres de Bordeaux

Majorations de la fonction sommatoire de la fonction de Möbius

François Dress (1977)

Mémoires de la Société Mathématique de France

Matrix transformations of integer sequences.

Kimberling, Clark (2003)

Journal of Integer Sequences [electronic only]

Mean values of generalized gcd-sum and lcm-sum functions.

Bordellès, Olivier (2007)

Journal of Integer Sequences [electronic only]

Mellin Transforms and Fourier-Ramanujan Expansions.

Dieter Klusch (1986)

Mathematische Zeitschrift

Mittelwert der Eulerschen ...-Funktion und des Quadrates der Dirichletschen Teilerfunktion in algebraischen Zahlkörpern.

Wolfgang Grotz (1979)

Monatshefte für Mathematik

Monotonicity of multiplicative functions

Zbigniew Nowacki (1979)

Colloquium Mathematicae

Multiple Perfect Numbers, Mersenne Primes, and Effective Computability.

Carl Pomerance (1977)

Mathematische Annalen

Multiplicative $B$ -product and its properties.

Bhattacharjee, D. (1998)

Georgian Mathematical Journal

Multiplicative even functions (mod r). I Structural properties.

R. Sivaramakrishnan (1978)

Journal für die reine und angewandte Mathematik

Multiplicative even functions (mod r). II Identities involving Ramanujan sums.

R. Sivaramakrishnan (1978)

Journal für die reine und angewandte Mathematik

Multiplicative functions and $k$ -automatic sequences

Soroosh Yazdani (2001)

Journal de théorie des nombres de Bordeaux

A sequence is called $k$ -automatic if the $n$ ’th term in the sequence can be generated by a finite state machine, reading $n$ in base $k$ as input. We show that for many multiplicative functions, the sequence ${(f (n) mod v)}_{n \geq 1}$ is not $k$ -automatic. Among these multiplicative functions are $γ_{m} (n), σ_{m} (n), μ (n)$ et $φ (n)$ .

Multiplicative functions over short segments

Olivier Bordellès (2013)

Acta Arithmetica

Multiplicative functions satisfying the equation $f (m^{2} + n^{2}) = f (m^{2}) + f (n^{2})$

Pham Van Chung (1996)

Mathematica Slovaca

Multiplicative functions with difference tending to zero

Eduard Wirsing, Don Zagier (2001)

Acta Arithmetica

Mycielski-Sierpiński conjecture and Korec-Znám result

Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel (1988)

Colloquium Mathematicae

Currently displaying 1 – 17 of 17

Page 1