相关论文: Refined upper bounds for the linear Diophantine pr…

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…

We conjecture that if a system S \subseteq {x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in integers x_1,...,x_n, then each such solution (x_1,...,x_n) satisfies |x_1|,...,|x_n| \leq…

Let $1<c<d$ be two relatively prime integers, $g_{c,d}=cd-c-d$ and $\mathbb{P}$ is the set of primes. For any given integer $k \geq 1$, we prove that $$\#\left\{p^k\le g_{c,d}:p\in \mathbb{P}, ~p^k=cx+dy,~x,y\in \mathbb{Z}_{\geqslant0}…

For a set $A$ of positive integers with $\gcd(A)=1$, let $\langle A \rangle$ denote the set of all finite linear combinations of elements of $A$ over the non-negative integers. Then it is well known that only finitely many positive integers…

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…

The theory of Frobenius groups with Frobenius complements of even order largely reduces to tractable algebraic number theory. If we consider only Frobenius complements with an upper bound $s$ on the number of distinct primes dividing the…

In this paper, using a deep result on the existence of primitive divisors of Lehmer numbers due to Y. Bilu, G. Hanrot and P. M. Voutier, we first give an explicit formula for all positive integer solutions of the Diophantine equation…

The unconditional, i.e. without assuming validity of RH, sharp limit relationship (as p tends to infinity) is found between the remainder in the modified Mertens asymptotic formula for the sums of primes' reciprocals and maximal values of…

Let $N$ be an odd perfect number and let $a$ be its third largest prime divisor, $b$ be the second largest prime divisor, and $c$ be its largest prime divisor. We discuss steps towards obtaining a non-trivial upper bound on $a$, as well as…

In their celebrated paper "On Siegel's Lemma", Bombieri and Vaaler found an upper bound on the height of integer solutions of systems of linear Diophantine equations. Calculating the bound directly, however, requires exponential time. In…

The greatest integer that does not belong to $S$ is the Frobenius number of $S$ and denoted by $F(S)$. To solve the Frobenius problem means the study to find $F(S)$. The Frobenius problem have treated steadily for a long time. In this…

Consider positive integral solutions $x \in \mathbb{Z}^{n+1}$ to the equation $a_0 x_0 + \ldots + a_n x_n = t$. In the so called unbounded subset sum problem, the objective is to decide whether such a solution exists, whereas in the…

We investigate approximation to a given real number by algebraic numbers and algebraic integers of prescribed degree. We deal with both best and uniform approximation, and highlight the similarities and differences compared with the…

We provide new upper and lower bounds on the minimum possible ratio of the spectral and Frobenius norms of a (partially) symmetric tensor. In the particular case of general tensors our result recovers a known upper bound. For symmetric…

We study solvability of the Diophantine equation \begin{equation*} \frac{n}{2^{n}}=\sum_{i=1}^{k}\frac{a_{i}}{2^{a_{i}}}, \end{equation*} in integers $n, k, a_{1},\ldots, a_{k}$ satisfying the conditions $k\geq 2$ and $a_{i}<a_{i+1}$ for…

Motivated by a question of V. Bergelson and F. K. Richter (2017), we obtain asymptotic formulas for the number of relatively prime tuples composed of positive integers $n\le N$ and integer parts of polynomials evaluated at $n$. The error…

Let $C_n=n2^n+1$ denote the $n$th Cullen number. There has been recent interest in finding all Cullen numbers having a given Diophantine property. We prove that, for a fixed integer $k$ and bounded integers $a_1,\ldots,a_k$, the greatest…

The greatest integer that does not belong to a numerical semigroup S is called the Frobenius number of S, and finding the Frobenius number is called the Frobenius problem. In this paper, we solve the Frobenius problem for shifted square…

We obtain an upper bound for the sum $\sum_{n\leq N} (a_{n}/\varphi (a_{n}))^{s}$, where $\varphi$ is Euler's totient function, $s\in \mathbb{N}$, and $a_{1},\ldots, a_{N}$ are positive integers (not necessarily distinct) with some…

Expanding on recent results of another an algorithm is presented that provides solution to the Frobenius Coin Problem in worst case O(n^2) in the magnitude of the largest denomination.