Mod p³ analogues of theorems of Gauss and Jacobi on binomial coefficients
Modification on Semi-Completeness for Integer Sequences
Modifications of the Eratosthenes sieve
We discuss some cancellation algorithms such that the first non-cancelled number is a prime number p or a number of some specific type. We investigate which numbers in the interval (p,2p) are non-cancelled.
Modular relations and explicit values of Ramanujan-Selberg continued fractions.
Monomial Congruences.
Monotonicity of multiplicative functions
More on Divisibility Criteria for Selected Primes
This paper is a continuation of [19], where the divisibility criteria for initial prime numbers based on their representation in the decimal system were formalized. In the current paper we consider all primes up to 101 to demonstrate the method presented in [7].
Multi-continued fraction algorithm on multi-formal Laurent series
Multidimensional covering systems of congruences
Multidimensional Euclidean algorithms.
Multidimensional Gauss reduction theory for conjugacy classes of
In this paper we describe the set of conjugacy classes in the group . We expand geometric Gauss Reduction Theory that solves the problem for to the multidimensional case, where -reduced Hessenberg matrices play the role of reduced matrices. Further we find complete invariants of conjugacy classes in in terms of multidimensional Klein-Voronoi continued fractions.
Multi-parametric extensions of Newman's phenomenon.
Multiple gcd-closed sets and determinants of matrices associated with arithmetic functions
Let f be an arithmetic function and S = {x1, …, xn} be a set of n distinct positive integers. By (f(xi, xj)) (resp. (f[xi, xj])) we denote the n × n matrix having f evaluated at the greatest common divisor (xi, xj) (resp. the least common multiple [xi, xj]) of x, and xj as its (i, j)-entry, respectively. The set S is said to be gcd closed if (xi, xj) ∈ S for 1 ≤ i, j ≤ n. In this paper, we give formulas for the determinants of the matrices (f(xi, xj)) and (f[xi, xj]) if S consists of multiple coprime...
Multiple Perfect Numbers, Mersenne Primes, and Effective Computability.
Multiplication par un entier d'une fraction continue périodique
Multiplication par un entier d'une fraction continue périodique
Multiplicative -product and its properties.
Multiplicative even functions (mod r). I Structural properties.
Multiplicative even functions (mod r). II Identities involving Ramanujan sums.
Multiplicative functions and -automatic sequences
A sequence is called -automatic if the ’th term in the sequence can be generated by a finite state machine, reading in base as input. We show that for many multiplicative functions, the sequence is not -automatic. Among these multiplicative functions are et .