English
Related papers

Related papers: On the number of linear forms in logarithms

200 papers

Let $m\ge 2$ be an integer, $K$ an algebraic number field and $\alpha\in K\setminus \{0,-1\}$ with sufficiently small absolute value. In this article, we provide a new lower bound for linear form in…

Number Theory · Mathematics 2019-04-04 Makoto Kawashima

Let $A$ be an infinite set of nonnegative integers. For $h \geq 2$, let $hA$ be the set of all sums of $h$ not necessarily distinct elements of $A$. If every sufficiently large integer in the sumset $hA$ has at least two representations,…

Number Theory · Mathematics 2016-05-04 Melvyn B. Nathanson

For a set $A$ of nonnegative integers, let $R_2(A,n)$ and $R_3(A,n)$ denote the number of solutions to $n=a+a'$ with $a,a'\in A$, $a<a'$ and $a\leq a'$, respectively. In this paper, we prove that, if $A\subseteq \mathbb{N}$ and $N$ is a…

Number Theory · Mathematics 2019-04-24 Xing-Wang Jiang , Csaba Sandor , Quan-Hui Yang

We consider the complexity for computing the approximate sum $a_1+a_2+...+a_n$ of a sorted list of numbers $a_1\le a_2\le ...\le a_n$. We show an algorithm that computes an $(1+\epsilon)$-approximation for the sum of a sorted list of…

Data Structures and Algorithms · Computer Science 2012-01-24 Bin Fu

For a set of natural numbers $A$, let $R_{A}(n)$ be the number of representations of a natural number $n$ as the sum of two terms from $A$. Many years ago, Nathanson studied the conditions for the set $A$ and $B$ of natural numbers that are…

Number Theory · Mathematics 2025-06-05 Sándor Kiss , Csaba Sándor

Let f(x_1,x_2,...,x_m) = u_1x_1+u_2 x_2+... + u_mx_m be a linear form with positive integer coefficients, and let N_f(k) = min{|f(A)| : A \subseteq Z and |A|=k}. A minimizing k-set for f is a set A such that |A|=k and |f(A)| = N_f(k). A…

Number Theory · Mathematics 2021-01-06 Melvyn B. Nathanson

Given a sequence A=(a1,...,an) of real numbers, a block B of the A is either a set B={ai,...,aj} where i<=j or the empty set. The size b of a block B is the sum of its elements. We show that when 0<=ai<=1 and k is a positive integer, there…

Combinatorics · Mathematics 2014-06-24 Imre Bárány , Victor S. Grinberg

For a positive integer $n$, we denote by $F(n)$ the distance from $n$ to the nearest prime number. We prove that every sufficiently large positive integer $N$ can be represented as the sum $N=n_1+n_2$, where $$ F(n_i) \geqslant (\log…

Number Theory · Mathematics 2022-09-08 Mikhail R. Gabdullin

We consider some families of binary binomial forms $aX^d+bY^d$, with $a$ and $b$ integers. Under suitable assumptions, we prove that every rational integer $m$ with $|m|\ge 2$ is only represented by a finite number of the forms of this…

Number Theory · Mathematics 2023-06-06 Étienne Fouvry , Michel Waldschmidt

Let $[\, \cdot\,]$ be the floor function. In this paper we show that every sufficiently large positive integer $N$ can be represented in the form \begin{equation*} N=[p_1\log p_1]+[p_2\log p_2]+[p_3\log p_3], \end{equation*} where $p_1,\,…

Number Theory · Mathematics 2019-12-18 S. I. Dimitrov

The focus of our investigation will be integrals of form $\int_0^1 \log^a(1-x) \log^b x \log^c(1+x) /f(x) dx$, where $f$ can be either $x,1-x$ or $1+x$. We show that these integrals possess a plethora of linear relations, and give…

Number Theory · Mathematics 2019-10-30 K. C. Au

We show that the number of integer solutions for a pair of bilinear equations in at least 2*6 variables has (up to logarithms) the expected upper bound unless there is a structural reason why it is not the case.

Number Theory · Mathematics 2014-12-12 Eugen Keil

Given a sequence $S=(s_1,\dots,s_m) \in [0, 1]^m$, a block $B$ of $S$ is a subsequence $B=(s_i,s_{i+1},\dots,s_j)$. The size $b$ of a block $B$ is the sum of its elements. It is proved in [1] that for each positive integer $n$, there is a…

Combinatorics · Mathematics 2017-06-21 I. Bárány , E. Csóka , Gy. Károlyi , G. Tóth

In this note, we show that there are many infinity positive integer values of $n$ in which, the following inequality holds $$ \left\lfloor{1/2}(\frac{(n+1)^2}{\log(n+1)}-\frac{n^2}{\log n})-\frac{\log^2 n}{\log\log…

Number Theory · Mathematics 2007-05-23 Mehdi Hassani

In this note, we shall give an improved lower bound for the argument of a power of a given algebraic number which has absolute value one but is not a root of unity.

Number Theory · Mathematics 2025-06-03 Tomohiro Yamada

Problems in additive number theory related to sum and difference sets, more general binary linear forms, and representation functions of additive bases for the integers and nonnegative integers.

Number Theory · Mathematics 2007-05-23 Melvyn B. Nathanson

In this paper we find an identity that gives a representation for the logarithm of any two irrational numbers $a, b >1$ in terms of a series whose terms are ratios of elements from the Beatty Sequences generated by these two numbers. We…

Number Theory · Mathematics 2015-03-31 Geremías Polanco E

For $s=3,4$, we prove the existence of arbitrarily long sequences of consecutive integers none of which is a sum of $s$ nonnegative $s$-th powers. More generally, we study the existence of gaps between the values $\leq N$ of diagonal forms…

Number Theory · Mathematics 2020-05-06 Luca Ghidelli

It is established that for any finite set of positive real numbers $A$, we have $$|A/A+A| \gg \frac{|A|^{\frac{3}{2}+\frac{1}{26}}}{\log^{1/2}|A|}.$$

Combinatorics · Mathematics 2018-10-26 Oliver Roche-Newton

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$…

Number Theory · Mathematics 2020-03-23 Marco Cantarini , Alessandro Gambini , Alessandro Zaccagnini