Related papers: On representations by Egyptian fractions
We prove new upper bounds on the number of representations of rational numbers $\frac{m}{n}$ as a sum of $4$ unit fractions, giving five different regions, depending on the size of $m$ in terms of $n$. In particular, we improve the most…
It is shown that there is an absolute constant $C$ such that any rational $\frac bq\in]0, 1[, (b, q)=1$, admits a representation as a finite sum $\frac bq=\sum_\alpha\frac {b_\alpha}{q_\alpha}$ where $\sum_\alpha\sum_ia_i(\frac…
Multiplication and exponentiation can be defined by equations in which one of the operands is written as the sum of powers of two. When these powers are non-negative integers, the operand is integer; without this restriction it is a…
An approach to constructing an upper bound for the Riemann-Farey sum is described.
We derive "numerical" criteria for the existence of embeddings of representations of finite dimensional algebras.
Let $\boldsymbol{\alpha}\in \mathbb{R}^N$ and $Q\geq 1$. We consider the sum $\sum_{\boldsymbol{q}\in [-Q,Q]^N\cap\mathbb{Z}^N\backslash\{\boldsymbol{0}\}}\|\boldsymbol{\alpha}\cdot\boldsymbol{q}\|^{-1}$. Sharp upper bounds are known when…
Given a positive integer $n$ we let $A_k(n)$ be the number of positive integers $a$ such that $\frac{a}{n}=\frac{1}{m_1}+\frac{1}{m_2}+\cdots+\frac{1}{m_k}$ for some $m_1,m_2,\ldots,m_k\in {\mathbb N}$. We show that $x(\log x)^3\ll…
Let $X$ be an algebraic variety, defined over the rationals. This paper gives upper bounds for the number of rational points on $X$, with height at most $B$, for the case in which $X$ is a curve or a surface. In the latter case one excludes…
Consider the representation of a rational number in the form, associated with "centered" Euclidean algorithm. We prove a new formula for the limit distribution function for sequences of rationals with bounded sum of partial quotients.
The focus of this note is to formulate the algorithms and give the examples used by Fibonacci in Liber Abaci to expand any fraction into a sum of unit fractions. The description in Liber Abaci is all verbal and the examples are numbers…
For a prime number $p$, let $A_3(p)= | \{ m \in \mathbb{N}: \exists m_1,m_2,m_3 \in \mathbb{N}, \frac{m}{p}=\frac{1}{m_1}+\frac{1}{m_2}+\frac{1}{m_3} \} |$. In 2019 Luca and Pappalardi proved that $x (\log x)^3 \ll \sum_{p \le x} A_{3}(p)…
We present upper bounds on certain sums which are related to Artin's primitive root conjecture and are also used in counting ray class characters.
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…
In this paper, we consider a problem of counting multiplicities. We fix a counting function of multiplicity of rational points in a hypersurface of a projective space over a finite field, and we give an upper bound for the sum with respect…
One is expressed as the sum of the reciprocals of a certain set of integers. We give an elegant proof to the fact applying the polynomial theorem and basic calculus.
In this note, an upper bound for the sum of fractional parts of certain smooth functions is established. Such sums arise naturally in numerous problems of analytic number theory. The main feature is here an improvement of the main term due…
Given an integer partition of $n$ into distinct parts, the sum of the reciprocal parts is an example of an egyptian fraction. We study this statistic under the uniform measure on distinct parts partitions of $n$ and prove that, as $n \to…
It is a well-known result of Etingof, Nikshych and Ostrik that there are finitely many inequivalent integral modular categories of any fixed rank $n$. This follows from a double-exponential bound on the maximal denominator in an Egyptian…
We solve an elementary number theory problem on sums of fractional parts, using methods from group theory. We apply our result to deduce the finiteness of certain monodromy representations.
Refining an estimate of Croot, Dobbs, Friedlander, Hetzel and Pappalardi, we show that for all $k \geq 2$, the number of integers $1 \leq a \leq n$ such that the equation $a/n = 1/m_1 + \dotsc + 1/m_k$ has a solution in positive integers…