Related papers: Meertens number and its variations
The problem of finding all the integer solutions in $a$, $M$ and $s$ of sums of $M$ consecutive integer squares starting at $a^{2}\geq1$ equal to squared integers $s^{2}$, has no solutions if $M\equiv3,5,6,7,8$ or $10\left(mod\,12\right)$…
The notion of Frobenius Betti numbers generalizes the Hilbert-Kunz multiplicity theory and serves as an invariant that measures singularity. However, the explicit computation of the Frobenius Betti numbers of rings has been limited to very…
The question of which triangular numbers have a decimal representation containing a single repeated digit seamed to be settled since at least the 1970s: Ballew and Weger provided a complete list and a proof that these are the only numbers…
The Erd\H{o}s multiplication table problem asks what is the number of distinct integers appearing in the $N\times N$ multiplication table. The order of magnitude of this quantity was determined by Ford in 2008. In this paper we study the…
The Mertens function is defined as $M(x) = \sum_{n \leq x} \mu(n)$, where $\mu(n)$ is the M\"obius function. The Mertens conjecture states $|M(x)/\sqrt{x}| < 1$ for $x > 1$, which was proven false in 1985 by showing $\liminf M(x)/\sqrt{x} <…
We enumerate bijectively the family of involutive Baxter permutations according to various parameters; in particular we obtain an elementary proof that the number of involutive Baxter permutations of size $2n$ with no fixed points is…
In this paper we describe a variation of the classical permutation decoding algorithm that can be applied to any affine-invariant code with respect to certain type of information sets. In particular, we can apply it to the family of…
In this paper, we introduce the concept of the over-Mahonian number, which counts the overlined permutations of length $n$ with $k$ inversions, allowing the first elements associated with the inversions to be independently overlined or not.…
Generalised Mersenne Numbers (GMNs) were defined by Solinas in 1999 and feature in the NIST (FIPS 186-2) and SECG standards for use in elliptic curve cryptography. Their form is such that modular reduction is extremely efficient, thus…
Consider the number of permutations in the symmetric group on n letters that contain c copies of a given pattern. As c varies (with n held fixed) these numbers form a sequence whose properties we study for the monotone patterns and the…
We first provide some properties of the Mellin transform of nonnegative random variables, such that monotonicity, injectivity and effect of size biasing. Convergence of Mellin transforms is also entirely formalized through convergence in…
We study the connection between the Mersenne numbers $M(n) = 2^n-1$ and the dynamics of the angle-doubling map. Within this framework, we develop an algorithm to compute divisors of Mersenne numbers without explicitly evaluating $M(n)$.…
The chronicle of prime numbers travel back thousands of years in human history. Not only the traits of prime numbers have surprised people, but also all those endeavors made for ages to find a pattern in the appearance of prime numbers has…
We consider a game in which a blindfolded player attempts to set $n$ counters lying on the vertices of a rotating regular $n$-gon table simultaneously to $0$. When the counters count$\pmod{m}$ we simplify the argument of Bar Yehuda, Etzion,…
In a recent paper, Melbourne and Terhesiu [Operator renewal theory and mixing rates for dynamical systems with infinite measure, Invent. Math. 189 (2012), 61-110] obtained results on mixing and mixing rates for a large class of…
We characterize the d x d matrices whose numerical ranges are invariant by rotations of angle 2$\pi$/d.
In this paper, we count the number of matrices whose rows generate different $\mathbb{Z}_2\mathbb{Z}_8$ additive codes. This is a natural generalization of the well known Gaussian numbers that count the number of matrices whose rows…
We discuss coincidences of pairs (f_1, f_2) of maps between manifolds. We recall briefly the definition of four types of Nielsen numbers which arise naturally from the geometry of generic coincidences. They are lower bounds for the minimum…
We propose an algorithm for computing bases and dimensions of spaces of invariants of Weil representations of $\mathrm{SL}_2(\mathbb{Z})$ associated to finite quadratic modules. We prove that these spaces are defined over $\mathbb{Z}$, and…
The structure of the multiplicative group $M_n = ({\mathbb Z}/n{\mathbb Z})^\times$ encodes a great deal of arithmetic information about the integer $n$ (examples include $\phi(n)$, the Carmichael function $\lambda(n)$, and the number…