Related papers: Effective $S$-unit Equations Beyond 3 Terms : Newm…

Ramanujan (and others) proved that the partition function satisfies a number of striking congruences modulo powers of 5, 7 and 11. A number of further congruences were shown by the works of Atkin, O'Brien, and Newman. In this paper we prove…

The inequalities concern the sum of s powers of primes with non-integer exponent c>1. Here s =2,3,4,or 5. The equations are similar, taking integer part before summing; here s = 3 or 5. New ranges of c are found in all cases for which many…

We convert, within polynomial-time and sequential processing, NP-Complete Problems into a problem of deciding feasibility of a given system S of linear equations with constants and coefficients of binary-variables that are 0, 1, or -1. S is…

We show that a particular parameter plays a vital role in the resolution of S-unit equations, at the stage where LLL-reduction is applied. We define the notion of optimal system of fundamental S-units (with respect to this parameter), and…

In this article we study the three-variable unit equation $x + y + z = 1$ to be solved in $x, y, z \in \mathcal{O}_S^\ast$, where $\mathcal{O}_S^\ast$ is the $S$-unit group of some global function field. We give upper bounds for the height…

A well known result of Newman says that upto a limit, multiples of $3$ with even number of 1's in binary representation always exceed multiples of $3$ with odd number of 1's. The phenomenon of preponderance of even number of 1's is now…

We show that for each n-tuple of positive rational integers (a_1,..,a_n) there are sets of primes S of arbitrarily large cardinality s such that the solutions of the equation a_1x_1+...+a_nx_n=1 with the x_i all S-units are not contained in…

We prove new upper bounds for the number of representations of an arbitrary rational number as a sum of three unit fractions. In particular, for fixed $m$ there are at most $\mathcal{O}_{\epsilon}(n^{3/5+\epsilon})$ solutions of…

We consider the decidability and complexity of the Ultimate Positivity Problem, which asks whether all but finitely many terms of a given rational linear recurrence sequence (LRS) are positive. Using lower bounds in Diophantine…

For a fixed positive integer n, let S_n denote the symmetric group of n! permutations on n symbols, and let maj(sigma) denote the major index of a permutation sigma. For positive integers k<m not greater than n and non-negative integers i…

We investigate here sums of triangular numbers $f(x):=\sum_i b_i T_{x_i}$ where $T_n$ is the $n$-th triangular number. We show that for a set of positive integers $S$ there is a finite subset $S_0$ such that $f$ represents $S$ if and only…

A set is said to tile the integers if and only if the integers can be written as a disjoint union of translates of that set. We consider the problem of finding necessary and sufficient conditions for a finite set to tile the integers. For…

We investigate the Waring-Goldbach problem of representing a positive integer $n$ as the sum of $s$ $k$th powers of almost equal prime numbers. Define $s_k=2k(k-1)$ when $k\ge 3$, and put $s_2=6$. In addition, put $\theta_2=\frac{19}{24}$,…

We investigate the average number of representations of a positive integer as the sum of $k + 1$ perfect $k$-th powers of primes. We extend recent results of Languasco and the last Author, which dealt with the case $k = 2$ [6] and $k = 3$…

We solve two long-standing open problems on word equations. Firstly, we prove that a one-variable word equation with constants has either at most three or an infinite number of solutions. The existence of such a bound had been conjectured,…

In the Structure of Appearance and in Problems and Projects, Nelson Goodman has constructed a theory of complexity whose elements are the predicates of a system. One of his main results is a closed formula to evaluate v[n-pl], the maximum…

We determine, within 1, the value of N for which sum (s1 choose i)(s2 choose N)(s1 choose N-i)(N choose i) achieves its maximum value. Here s1 and s2 are fixed integers. This problem arises in studying the most likely value for the size of…

In the paper, we establish a new estimate for Kloosterman sum over primes with respect to an arbitrary modulus $q$. This estimate together with some recent results of the second author are applied to the problem of solvability of the…

For any fixed coprime positive integers $a,b$ and $c$ with $\min\{a,b,c\}>1$, we prove that the equation $a^x+b^y=c^z$ has at most two solutions in positive integers $x,y$ and $z$, except for one specific case which exactly gives three…

Let $N$ be a sufficiently large, odd integer. We prove an asymptotic formula for the number of representations of $N$ as the sum of three primes, one of which is smaller than a given $U$. By inserting the currently best zero-density…