Related papers: On ternary Egyptian fractions with prime denominat…

Let $T_o(k)$ denote the number of solutions of $\sum_{i=1}^k\frac 1{x_i}=1$ in odd numbers $1<x_1<x_2<...<x_k$. It is clear that $T_o(2k)=0$. For distinct primes $p_1, p_2,..., p_t$, let $S(p_1, p_2,...,…

Let $\{A'_n\}$ be the Ap\'ery numbers given by $A'_n=\sum_{k=0}^n\binom nk^2\binom{n+k}k.$ For any prime $p\equiv 3\pmod 4$ we show that $A'_{\frac{p-1}2}\equiv \frac{p^2}3\binom{\frac{p-3}2}{\frac{p-3}4}^{-2}\pmod {p^3}$. Let $\{t_n\}$ be…

For A,epsilon>0 and any sufficiently large odd n we show that for almost all k up to n^{1/5-epsilon} there exists a representation n=p1+p2+p3 with primes in residue classes b1,b2,b3 mod k for almost all admissible triplets b1,b2,b3 of…

Let q be an odd positive integer and P \in F2[z] be of order q and such that P(0) = 1. We denote by A = A(P) the unique set of positive integers satisfying \sum_{n=0}^\infty p(A, n) z^n \equiv P(z) (mod 2), where p(A,n) is the number of…

A unit fraction representation of a rational number $r$ is a finite sum of reciprocals of positive integers that equals $r$. Of particular interest is the case when all denominators in the representation are distinct, resulting in an…

We investigate the number $R_3(n)$ of representations of $n$ as the sum plus the product of three positive integers. On average, $R_3(n)$ is $\frac{1}{2}\log^2 n$. We give an upper bound for $R_3(n)$ and an upper bound for the number of $n…

In this paper, we mainly establish a congruence for a sum involving Ap\'{e}ry numbers, which was conjectured by Z.-W. Sun. Namely, for any prime $p>3$ and positive odd integer $m$, we prove that there is a $p$-adic integer $c_m$ only…

Any rational number can be written as the sum of distinct unit fractions. In this survey paper we review some of the many interesting questions concerning such 'Egyptian fraction' decompositions, and recent progress concerning them.

For given positive integers $n$ and $a$, let $R(n;\,a)$ denote the number of positive integer solutions $(x,\,y)$ of the Diophantine equation $$ {a\over n}={1\over x}+{1\over y}. $$ Write $$ S(N;\,a)=\sum_{\substack{n\leq N…

Let $a,k\in\mathbb{N}$. For the $k-1$-th iterate of the exponential function $x\mapsto a^x$, also known as tetration, we write \[ ^k a:=a^{a^{.^{.^{.^{a}}}}}. \] In this paper, we show how an efficient algorithm for tetration modulo natural…

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…

We present a function that tests for primality, factorizes composites and builds a closed form expression of $\pi(n^2)$ in terms of $\sum_{3 \leq p \leq n} \frac{1}{p}$ and a weaker version of $\omega(n)$.

Resolving a conjecture of Zhi-Wei Sun, we prove that every rational number can be represented as a sum of distinct unit fractions whose denominators are practical numbers. The same method applies to allowed denominators that are closed…

Let $\omega^*(n)$ be the number of primes $p$ such that $p-1$ divides $n$. Recently, R. M. Murty and V. K. Murty proved that $$x(\log\log x)^3\ll\sum_{n\le x}\omega^*(n)^2\ll x\log x.$$ They further conjectured that there is some positive…

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…

Let $p>3$ be a prime, and let $(\frac{\cdot}p)$ be the Legendre symbol. Let $b\in\mathbb Z$ and $\varepsilon\in\{\pm 1\}$. We mainly prove that $$\left|\left\{N_p(a,b):\ 1<a<p\ \text{and}\ \left(\frac…

Answering a question of Erd\H{o}s and Graham, we show that for each fixed positive rational number $x$ the number of ways to write $x$ as a sum of reciprocals of distinct positive integers each at most $n$ is $2^{(c_x + o(1))n}$ for an…

Let $p>3$ be a prime, and let $a$ be a rational $p$-adic integer, using WZ method we establish the congruences modulo $p^3$ for $$\sum_{k=0}^{p-1} \binom ak\binom{-1-a}k\binom{2k}k\frac {w(k)}{4^k},$$ where $$w(k)=1,\frac 1{k+1},\frac…

We will show that the number of integers $\leq x$ that can be written as the square of an integer plus the square of a prime equals $\frac{\pi}{2} \cdot \frac {x}{\log x}$ minus a secondary term of size $x/(\log x)^{ 1+\delta+o(1)}$, where…

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,\,…