Related papers: Asymptotics for Magic Squares of Primes

Let $p>5$ be a fixed prime. We obtain an asymptotic formula related to small solutions of quadratic congruences of the form $x_1^2+x_2^2\equiv x_3^2\bmod{p^n}$ where $\max\{|x_1|,|x_2|,|x_3|\}\le p^{\nu n}$ with $\nu>1/2$.

The paper presents a discussion on the asymptotic formula for the number of plane partitions of a large positive integer.

Let $ a_1(x)p_1(x)^n + \cdots + a_k(x)p_k(x)^n $ as well as $ b_1(x)q_1(x)^m + \cdots + b_l(x) q_l(x)^m $ be two polynomial power sums where the complex polynomials $ p_i(x) $ and $ q_j(x) $ are all non-constant. Then in the present paper…

We pose 100 new conjectures on representations involving primes or related things, which might interest number theorists and stimulate further research. Below are five typical examples: (i) For any positive integer $n$, there exists…

In this paper we establish a general asymptotic formula for the sum of the first $n$ prime numbers, which leads to a generalization of the most accurate asymptotic formula given by Massias and Robin. Further we prove a series of results…

Counting the number of prime numbers up to a certain natural number and describing the asymptotic behavior of such a counting function has been studied by famous mathematicians like Gauss, Legendre, Dirichlet, and Euler. The prime number…

Let $I_k = [(2k-1)^2, (2k+1)^2)$ for $k \geq 1$. Starting from the odd-composite matrix $(b_{ij})$ with $b_{ij} = (2i-1)(2j-1)$, introduced by the author in [1], we define for each odd integer $n$ the \emph{matrix multiplicity} $r(n)$, the…

Let $S_{a,b}$ denote the sequence of leading digits of $a^n$ in base $b$. It is well known that if $a$ is not a rational power of $b$, then the sequence $S_{a,b}$ satisfies Benford's Law; that is, digit $d$ occurs in $S_{a,b}$ with…

Every natural number greater than $2$ can be written as the sum of a prime and a square-free number, and recent work has imposed additional divisibility conditions on the square-free number. We overcome limitations in these works to prove…

In this paper we strongly improve asymptotics for $s_1(n)$ (respectively $s_2(n)$) which sums reciprocals (respectively squares of reciprocals) of parts throughout all the partitions of $n$ into distinct parts. The methods required are much…

Let N_{a,b}(x) count the number of primes p<=x with p dividing a^k+b^k for some k>=1. It is known that asymptotically N_{a,b}(x) grows like c(a,b)x/log x for some rational number c(a,b) that depends in a rather intricate way on a and b. A…

We investigate the number of representations of a large positive integer as the sum of two squares, two positive integral cubes, and two sixth powers, showing that the anticipated asymptotic formula fails for at most O((log X)^3) positive…

In this paper analyzes \textit{The Erd\H{o}s-Straus conjecture} asserts that $f$$(n)$ $>$ 0 for every $n$ $\geq$ 2, where $f(n)$ indicates the number of solutions to the Diophantine Equation…

It is derived the explicit asymptotic expression in $n$ for the coefficient $c_n$ of the generating function for multiplicative structures with sub exponential rate of growth of $c_n,$ as $n\to\infty$.

We derive an asymptotic formula for the number of strongly connected digraphs with $n$ vertices and $m$ arcs (directed edges), valid for $m-n\to\infty$ as $n\to \infty$ provided $m=O(n\log n)$. This fills the gap between Wright's results…

Let $p>5$ be a fixed prime and assume that $\alpha_1,\alpha_2,\alpha_3$ are coprime to $p$. We study the asymptotic behavior of small solutions of congruences of the form $\alpha_1x_1^2+\alpha_2x_2^2+\alpha_3x_3^2\equiv 0\bmod{q}$ with…

Let m be a positive integer, and let A be the set of all positive integers that belong to a union of r distinct congruence classes modulo m. We assume that the elements of A are relatively prime, that is, gcd(A) = 1. Let p_A(n) denote the…

Let $S(n)$ denote the least primary factor in the primary decomposition of the multiplicative group $M_n = (\Bbb Z/n\Bbb Z)^\times$. We give an asymptotic formula, with order of magnitude $x/(\log x)^{1/2}$, for the counting function of…

We discuss the problem of counting {\em incidence matrices}, i.e. zero-one matrices with no zero rows or columns. Using different approaches we give three different proofs for the leading asymptotics for the number of matrices with $n$ ones…

Let $p\leq 23$ be a prime and $a_p(n)$ counts the number of partitions of $n$ where parts that are multiple of $p$ come up with $2$ colors. Using a result of Sussman, we derive the exact formula for $a_p(n)$ and obtain an asymptotic formula…