English
Related papers

Related papers: Two $S$-unit equations with many solutions

200 papers

Finding polynomial solutions to Pell's equation is of interest as such solutions sometimes allow the fundamental units to be determined in an infinite class of real quadratic fields. In this paper, for each triple of positive integers…

Number Theory · Mathematics 2018-12-31 James Mc Laughlin

In this paper, we study the diophantine equation ${{\sigma }_{2}}(n)-{{n}^{2}}=An+B$. We prove that except for finitely many computable solutions, all the solutions to this equation with $(A,B)=({{L}_{2m}},F_{2m}^{2}-1)$ are…

Number Theory · Mathematics 2014-06-24 Tianxin Cai , Liuquan Wang , Yong Zhang

Given a bivariate system of polynomial equations with fixed support sets $A, B$ it is natural to ask which multiplicities its solutions can have. We prove that there exists a system with a solution of multiplicity $i$ for all $i$ in the…

Algebraic Geometry · Mathematics 2021-10-26 I. Nikitin

We find asymptotics for $S_{K,c}(x)$, the number of positive integers below $x$ whose number of prime factors is $c \; \mathrm{mod}\; K$. We study this question in the context of Beurling integers.

Number Theory · Mathematics 2020-02-04 Gregory Debruyne

Let $${\mathbb P}^c=(\lfloor p^c\rfloor)_{p\in{\mathbb P}} \qquad (c>1,\ c\not\in {\mathbb N}), $$ where ${\mathbb P}$ is the set of prime numbers, and $\lfloor\cdot\rfloor$ is the floor function. We show that for every such $c$ there are…

Number Theory · Mathematics 2015-08-18 William D. Banks , Victor Z. Guo , Igor E. Shparlinski

For any real number $t$, let $[t]$ denote the integer part of $t$. In this paper it is proved that if $1<c<\frac{247}{238}$, then for sufficiently large integer $N$, the equation \[\left[p^{c}\right]+\left[m^{c}\right]=N\] has a solution in…

Number Theory · Mathematics 2023-06-07 Liuying Wu

Let $A$ be a finite set of integers. We show that if $k$ is a prime power or a product of two distinct primes then $$|A+k\cdot A|\geq(k+1)|A|-\lceil k(k+2)/4\rceil$$ provided $|A|\geq (k-1)^{2}k!$, where $A+k\cdot A=\{a+kb:\ a,b\in A\}$. We…

Combinatorics · Mathematics 2014-02-21 Shan-Shan Du , Hui-Qin Cao , Zhi-Wei Sun

In this paper we study a sequence involving the prime numbers by deriving two asymptotic formulas and finding new upper and lower bounds, which improve the currently known estimates.

Number Theory · Mathematics 2015-04-20 Christian Axler

When k > 1 and s is sufficiently large in terms of k, we derive an explicit multi-term asymptotic expansion for the number of representations of a large natural number as the sum of s positive integral k-th powers.

Number Theory · Mathematics 2022-11-21 Robert C. Vaughan , Trevor D. Wooley

It was asked by E. Szemer\'edi if, for a finite set $A\subset\mathbb{Z}$, one can improve estimates for $\max\{|A+A|,|A\cdot A|\}$, under the constraint that all integers involved have a bounded number of prime factors -- that is, each…

Number Theory · Mathematics 2025-07-02 Brandon Hanson , Misha Rudnev , Ilya Shkredov , Dmitrii Zhelezov

We show that for any set A in a finite Abelian group G that has at least c |A|^3 solutions to a_1 + a_2 = a_3 + a_4, where a_i belong A there exist sets A' in A and L in G, |L| \ll c^{-1} log |A| such that A' is contained in Span of L and…

Combinatorics · Mathematics 2010-04-15 Ilya Shkredov , Sergey Yekhanin

We study the solutions of a Diophantine equation of the form $a^x+b^y=c^z$, where $a\equiv 2 \pmod 4$, $b\equiv 3 \pmod 4$ and $\gcd (a,b,c)=1$. The main result is that if there exists a solution $(x,y,z)=(2,2,r)$ with $r>1$ odd then this…

Number Theory · Mathematics 2015-05-13 Mihai Cipu , Maurice Mignotte

This document seeks to prove there are infinitely many primes whose difference is 2, referred to as twin prime pairs. This proof's methodology involves constructing a function that approximates the number of positive integers, less than a…

General Mathematics · Mathematics 2017-11-01 Kevin B. Espinet

In this paper we give an explicit construction of unfolded equations for massive higher spin supermultiplets of the minimal (1,0) supersymmetry in AdS_3 space. For that purpose we use an unfolded formulation for massive bosonic and…

High Energy Physics - Theory · Physics 2016-08-17 I. L. Buchbinder , T. V. Snegirev , Yu. M. Zinoviev

We proved that any even number not less than 6 can be expressed as the sum of two old primes, $2n=p_i+p_j$

General Mathematics · Mathematics 2007-05-23 Shouyu Du , Zhanle Du

We take the pre-sieved set to be all natural numbers $N=\{1,2,3,\dots\}$ with a sieve system:single sieve,double sieve,.... With single sieve, i.e. , remove out the multiple of a prime, we derive all the primes. With double sieve, i.e. ,…

General Mathematics · Mathematics 2019-11-26 Guangchang Dong

It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes…

Number Theory · Mathematics 2016-11-23 Adrian Dudek

The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…

General Mathematics · Mathematics 2014-12-30 Ramin Zahedi

This paper investigates the exponential Diophantine equation of the form $a^x+b=c^y$, where $a, b, c$ are given positive integers with $a,c \ge 2$, and $x,y$ are positive integer unknowns. We define this form as a "Type-I transcendental…

Number Theory · Mathematics 2025-10-15 Zeyu Cai

In this paper we prove an asymptotic formula for the number of solutions in prime numbers to systems of simultaneous linear inequalities with algebraic coefficients. For $m$ simultaneous inequalities we require at least $m+2$ variables,…

Number Theory · Mathematics 2019-10-22 Aled Walker