Related papers: Theoremata arithmetica nova methodo demonstrata

This is a translation of Euler's Latin paper "De fractionibus continuis observationes" into English. In this paper Euler describes his theory of continued fractions. He teaches, how to transform series into continued fractions, solves the…

The crank-mex theorem states that the number of integer partitions of $n$ with nonnegative crank equals the number with odd minimal excludant (mex). Andrews and M. Newman recently refined that result in terms of the number of parts greater…

This paper treats about one of the most remarkable achievements by Riemann, that is the symmetric form of the functional equation for {\zeta}(s). We present here, after showing the first proof of Riemann, a new, simple and direct proof of…

We fix a gap in our proof of an upper bound for the number of positive integers $n\le x$ for which the Euler function $\varphi(n)$ has all prime factors at most $y$. While doing this we obtain a stronger, likely best-possible result.

In this note we examine Littlewood's proof of the prime number theorem. We show that this can be extended to provide an equivalence between the prime number theorem and the non-vanishing of Riemann's zeta-function on the one-line. Our…

In this paper we obtain bounds for integer solutions of quadratic polynomials in two variables that represent a natural number. Also we get some results on twin prime numbers. In addition, we use linear functionals to prove some results of…

Gilmer has recently shown that in any nonempty union-closed family $\mathcal F$ of subsets of a finite set, there exists an element contained in at least a proportion $.01$ of the sets of $\mathcal F$. We improve the proportion from $.01$…

We develop machinery to explicitly determine, in many instances, when the difference $x^2-y^n$ is divisible only by powers of a given fixed prime. This combines a wide variety of techniques from Diophantine approximation (bounds for linear…

Translated from the Latin original, "De numeris amicabilibus" (1747). E100 in the Enestroem index. Euler starts by saying that with the success of mathematical analysis, number theory has been neglected. He argues that number theory is…

Stewart (2013) proved that the biggest prime divisor of the $n$th term of a Lucas sequence of integers grows quicker than $n$, answering famous questions of Erd\H{o}s and Schinzel. In this note we obtain a fully explicit and, in a sense,…

In 2002, it was conjectured that a free divisor satisfying the so-called Logarithmic Comparison Theorem must be strongly Euler-homogeneous and it was proved for the two-dimensional case. Later, in 2006, it was shown that the conjecture is…

We investigate splitting-type variational problems with some linear growth conditions. For balanced solutions of the associated Euler-Lagrange equation we receive a result analogous to Bernstein's theorem on non-parametric minimal surfaces.…

We establish a new version of the first Noether Theorem, according to which the (equivalence classes of) first integrals of given Euler-Lagrange equations in one independent variable are in exact one-to-one correspondence with the…

Euler starts with a hypergeometric series F(a, b, c, x), and differentiates it to get a functional relation. This relation is today known as Euler's identity. Then he integrates to get another and ends up with something like Legendre…

We study the distribution of primes from a topological viewpoint. Certain conjecture is introduced, and we show that it is equivalent to the Riemann Hypothesis.

Let $ \lfloor {x} \rfloor $ denote the greatest integer less than or equal to a real number $x$. Given real numbers $0<\alpha_1 < \alpha_2 < \cdots< \alpha_k < 1$ satisfying a certain condition, we show that there are infinitely many…

In this paper we present an elementary proof for a special case of Fermat's last theorem for specific category of a, b and c. In fact, we assume that $n$ is prime and $4\rvert (n+1),$ then for $a,b$ and $c$ that $ n\nmid abc$ the equation…

Let $\xi$ and $m$ be integers satisfying $\xi\ne 0$ and $m\ge 3$. We show that for any given integers $a$ and $b$, $b \neq 0$, there are $\frac{\varphi(m)}{2}$ reduced residue classes modulo $m$ each containing infinitely many primes $p$…

The minimal excludant of a partition $\lambda$, $\rm{mex}(\lambda)$, is the smallest positive integer that is not a part of $\lambda$. For a positive integer $n$, $ \sigma\, \rm{mex}(n)$ denotes the sum of the minimal excludants of all…

Let $p$ be a sufficiently large prime number, $n$ be a positive odd integer with $n|\,p-1$ and $n>p^\varepsilon $, where $\varepsilon$ is a sufficiently small constant. Let $k(p,\,n)$ denote the least positive integer $k$ such that for…