Related papers: An effective estimate for the sum of two cubes pro…

By applying inter-universal Teichm\"uller theory and its slight modification over the rational number field, we prove new Diophantine results towards effective abc inequalities and the generalized Fermat equations. For coprime integers $a,…

Let $f$ be a polynomial with coefficients in the ring $O_S$ of $S$-integers of a number field $K$, $b$ a non-zero $S$-integer, and $m$ an integer $\ge 2$. We consider the equation $( \star )$: $f(x) = b y^m$ in $x,y \in O_S$. Under the…

In this paper, we consider universal sums of generalized polygonal numbers. Fixing $m\in\mathbb{N}_{\geq 3}$, we show two finiteness theorems for universal sums of generalized polygonal numbers whose inputs have a restricted number $L$ of…

Let b > 1 be an integer and denote by s_b(m) the sum of the digits of the positive integer m when is written in base b. We prove that s_b(n!) > C_b log n log log log n for each integer n > e, where C_b is a positive constant depending only…

Let $b \geq 3$ be a positive integer. A natural number is said to be a base-$b$ Zuckerman number if it is divisible by the product of its base-$b$ digits. Let $\mathcal{Z}_b(x)$ be the set of base-$b$ Zuckerman numbers that do not exceed…

Let y1, y2, y3, a1, a2, a3 > 0 be such that y1 y2 y3 = a1 a2 a3 and y1 + y2 + y3 >= a1 + a2 + a3, y1 y2 + y2 y3 + y1 y3 >= a1 a2 + a2 a3 + a1 a3. Then the following inequality holds (log y1)^2 + (log y2)^2 + (log y3)^2 >= (log a1)^2 + (log…

We prove a new result on multiple summing operators and among other applications, we provide a new extension of Littlewood's $4/3$ inequality to $m$-linear forms.

We obtain global explicit numerical bounds, with best possible constants, for the differences $\frac{1}{n}\sum_{k\leq n}\omega(k)-\log\log n$ and$ \frac{1}{n}\sum_{k\leq n}\Omega(k)-\log\log n$, where $\omega(k)$ and $\Omega(k)$ refer to…

We show that the denominator formula for the strange series of affine superalgebras, conjectured by Kac and Wakimoto and proved by Zagier, follows from a classical determinant evaluation of Frobenius. As a limit case, we obtain exact…

Let m>=1 be an arbitrary fixed integer and let N_m(x) count the number of odd integers u<=x such that the order of 2 modulo u is not divisible by m. In case m is prime estimates for N_m(x) were given by H. Mueller that were subsequently…

We prove a lower bound of $\Omega(n^2/\log^2 n)$ on the size of any syntactically multilinear arithmetic circuit computing some explicit multilinear polynomial $f(x_1, \ldots, x_n)$. Our approach expands and improves upon a result of Raz,…

For non-negative integers $a,b,$ and $n$, let $N(a, b; n)$ be the number of representations of $n$ as a sum of squares with coefficients $1$ or $3$ ($a$ of ones and $b$ of threes). Let $N^*(a,b; n)$ be the number of representations of $n$…

We prove that \Omega(n log(n)) comparisons are necessary for any quantum algorithm that sorts n numbers with high success probability and uses only comparisons. If no error is allowed, at least 0.110nlog_2(n) - 0.067n + O(1) comparisons…

In this paper, we prove a theorem concerning the existence of three solutions for the following boundary value problem: \begin{equation*} -\mathcal{M}_{\lambda,\Lambda}^+(D^2u)-\Gamma|Du|^2=f(u)~~~\text{in}\ \Omega, u=0~~~\text{on}\…

In this paper, we use a modular form approach to evaluate the convolution sums $\sum_{l+42m=n}\sigma (l)\sigma (m)$, $\sum_{2l+21m=n}\sigma (l)\sigma (m),$ $\sum_{3l+14m=n}\sigma (l)\sigma (m)$ and $\sum_{6l+7m=n}\sigma (l)\sigma (m) $ for…

Let $k$ and $n$ be positive integers, $n>k$. Define $r(n,k)$ to be the minimum positive value of $$ |\sqrt{a_1} + ... + \sqrt{a_k} - \sqrt{b_1} - >... -\sqrt{b_k} | $$ where $ a_1, a_2, ..., a_k, b_1, b_2, ..., b_k $ are positive integers…

Estimating the discrepancy of the hypergraph of all arithmetic progressions in the set $[N]=\{1,2,\hdots,N\}$ was one of the famous open problems in combinatorial discrepancy theory for a long time. An extension of this classical hypergraph…

P. Flajolet and B. Salvy \cite{FS1998} prove the famous theorem that a nonlinear Euler sum $S_{i_1i_2\cdots i_r,q}$ reduces to a combination of sums of lower orders whenever the weight $i_1+i_2+\cdots+i_r+q$ and the order $r$ are of the…

A positive integer n is said to be perfect if sigma(n)=2n, where sigma denotes the sum of the divisors of n. In this article, we show that if n is an even perfect number, then any integer m<=n is expressed as a sum of some of divisors of n.

We solve Diophantine equations of the type $ a \, (x^3 \!+ \! y^3 \!+ \! z^3 ) = (x \! + \! y \! + \! z)^3$, where $x,y,z$ are integer variables, and the coefficient $a\neq 0$ is rational. We show that there are infinite families of such…