Related papers: Landau's function for one million billions

We consider the Gaussian limit law for the distribution of the middle prime factor of an integer, defined according to multiplicity or not. We obtain an optimal bound for the speed of convergence, thereby improving on previous estimates…

Let $n$ be a positive integer and $\mathcal M$ a set of rational $n \times n$-matrices such that $\mathcal M$ generates a finite multiplicative semigroup. We show that any matrix in the semigroup is a product of matrices in $\mathcal M$…

Gronwall's function $G$ is defined for $n>1$ by $G(n)=\frac{\sigma(n)}{n \log\log n}$ where $\sigma(n)$ is the sum of the divisors of $n$. We call an integer $N>1$ a \emph{GA1 number} if $N$ is composite and $G(N) \ge G(N/p)$ for all prime…

Recently, Andrews defined a partition function $\mathcal{EO}(n)$ which counts the number of partitions of $n$ in which every even part is less than each odd part. He also defined a partition function $\overline{\mathcal{EO}}(n)$ which…

We provide an asymptotic expansion for the mean-value of the logarithm of the middle prime factor of an integer, defined according to multiplicity or not, thus generalising a recent study of McNew, Pollack, and Singha Roy. This yields an…

We consider GL_n(F_q)-analogues of certain factorization problems in the symmetric group S_n: rather than counting factorizations of the long cycle (1, 2, ..., n) given the number of cycles of each factor, we count factorizations of a…

We conjecture new elementary formulas for computing the greatest common divisor (GCD) of two integers, alongside an elementary formula for extracting the prime factors of semiprimes. These formulas are of fixed-length and require only the…

In 2011, W. Lang derived a novel, explicit formula for the sum of powers of integers $S_k(n) = 1^k + 2^k + \cdots + n^k$ involving simultaneously the Stirling numbers of the first and second kind. In this note, we first recall and then…

A finite group $G$ is called $k$-factorizable if for every ordered factorization $|G|=a_1\cdots a_k$ into integers each greater than $1$ there exist subsets $A_1,\dots,A_k\subseteq G$ such that $|A_i|=a_i$ for each $i$ and $G=A_1\cdots…

Determining whether a given integer is prime or composite is a basic task in number theory. We present a primality test based on quantum order finding and the converse of Fermat's theorem. For an integer $N$, the test tries to find an…

Let $k$ and $n$ be natural numbers. Let $\omega_k(n)$ denote the number of distinct prime factors of $n$ with multiplicity $k$ as studied by Elma and the third author. We obtain asymptotic estimates for the first and the second moments of…

For $k\geq 2$, we give a detailed exposition of the superior $k$-highly composite numbers. We then consider the function \[f_k(n)=\frac{\log d_k(n)\log\log n}{\log k\log n},\quad n\geq 3\] which has a maximum value $\lambda(k)$ at a…

The famous Goldbach conjecture states that any even natural number $N$ greater than $2$ can be written as the sum of two prime numbers $p^{\text{(I)}}$ and $p^{\text{(II)}}$. In this article we propose a quantum analogue device that solves…

We present a fast algorithm for modular exponentiation when the factorization of the modulus is known. Let $a,n,m$ be positive integers and suppose $m$ factors canonically as $\prod_{i=1}^k p_i^{e_i}$. Choose integer parameters $t_i\in [1,…

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_kg)$ where $g\in G$ and $n_1,\cdots,n_k\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind S$ of $S$ is defined to be the minimum…

Let $g(n)$ be the largest positive integer $k$ such that there are distinct primes $p_i$ for $1\leq i\leq k$ so that $p_i |n+i$. This function is related to a celebrated conjecture of C.A. Grimm. We establish upper and lower bounds for…

Let $(u_n)_{n \geq 0}$ be a non-degenerate Lucas sequence, given by the relation $u_n=a_1 u_{n-1}+a_2 u_{n-2}$. Let $\ell_u(m)=lcm(m, z_u(m))$, for $(m,a_2)=1$, where $z_u(m)$ is the rank of appearance of $m$ in $u_n$. We prove that…

We give an overview of combinatoric properties of the number of ordered $k$-factorizations $f_k(n,l)$ of an integer, where every factor is greater or equal to $l$. We show that for a large number $k$ of factors, the value of the cumulative…

Let $p(n)$ be the ordinary partition function. In the 1960s Atkin found a number of examples of congruences of the form $p( Q^3 \ell n+\beta)\equiv0\pmod\ell$ where $\ell$ and $Q$ are prime and $5\leq \ell\leq 31$; these lie in two natural…

This paper continues the study of two numbers that are associated with Lie groups. The first number is $N(G,m)$, the number of conjugacy classes of elements in $G$ whose order divides $m$. The second number is $N(G,m,s)$, the number of…