Related papers: Theoremata arithmetica nova methodo demonstrata

At a crossroads of calculus and combinatorics, the generating function of secant and tangent numbers (Euler numbers) provides enumeration of alternating permutations. In this article, we present a new refinement of Euler numbers to answer…

Euler wants to find rational numbers (integers) x and y such that x+y is a square and x^2+y^2 is a fourth power. He parametrizes these with two other variables that satisfy certain equations.

In 1874, Mertens proved the approximate formula for partial Euler product for Riemann zeta function at $s=1$, which is called Mertens' theorem. In this paper, we generalize Mertens' theorem for Selberg class and show the prime number…

For a function $f\colon \mathbb{N}\to\mathbb{N}$, define $N^{\times}_{f}(x)=\#\{n\leq x: n=kf(k) \mbox{ for some $k$} \}$. Let $\tau(n)=\sum_{d|n}1$ be the divisor function, $\omega(n)=\sum_{p|n}1$ be the prime divisor function, and…

In this note we will discuss Euler's solution of the simple difference equation that he gave in his paper{\it ``De serierum determinatione seu nova methodus inveniendi terminos generales serierum"} \cite{E189} (E189:``On the determination…

The main result of the present article is a proof of Fermat's Last Theorem for sufficiently large prime exponents $p$ with $p \equiv 2 \pmod{3}$ over certain number fields. A particular case of these fields are the maximal real subfields of…

In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…

In 1876, Edouard Lucas showed that if an integer $b$ exists such that $b^{n-1} \equiv 1 (\mathrm{mod} \ n)$ and $b^{(n-1)/p} \not\equiv 1( \mathrm{mod} \ n)$ for all prime divisors $p$ of $n-1$ , then $n$ is prime, a result known as Lucas's…

This document presents an alternative proof of Sylvester's theorem stating that "the product of $n$ consecutive numbers strictly greater than $n$ is divisible by a prime strictly greater than $n$". In addition, the paper proposes stronger…

This note provides an effective lower bound for the number of primes in the quadratic progression $p=n^2+1 \leq x$ as $x \to \infty$.

Let $N$ be an odd perfect number. Then, Euler proved that there exist some integers $n, \alpha$ and a prime $q$ such that $N = n^{2}q^{\alpha}$, $q \nmid n$, and $q \equiv \alpha \equiv 1 \bmod 4$. In this note, we prove that the ratio…

Euler totient function $\phi(n)$ plays a central role in number theory and is applied in areas such as cryptography. In this paper, we study iterations of the totient function. We first prove that for any integer $n>2$, iteratively applying…

A suggestion is put forward regarding a partial proof of FLT(case1), which is elegant and simple enough to have caused Fermat's enthusiastic remark in the margin of his Bachet edition of Diophantus' "Arithmetica". It is based on an…

The aim of this paper is to try to establish a generic model for the problem that several multivariable number-theoretic functions represent simultaneously primes for infinitely many integral points. More concretely, we introduced briefly…

For a function $f\colon \mathbb{N}\to\mathbb{N}$, let $$ N^+_f(x)=\{n\leq x: n=k+f(k) \mbox{ for some } k\}. $$ Let $\tau(n)=\sum_{d|n}1$ be the divisor function, $\omega(n)=\sum_{p|n}1$ be the prime divisor function, and…

Here Euler notes the recursive relation for the general binomial coefficients, by assuming that (1+x)^a can be expanded in a power series.

Using modularity, level lowering, and explicit computations with Hilbert modular forms, Galois representations and ray class groups, we show that for $3 \le d \le 23$ squarefree, $d \ne 5$, $17$, the Fermat equation $x^n+y^n=z^n$ has no…

We study generalizations of some results of Jean-Louis Nicolas regarding the relation between small values of Euler's function $\varphi(n)$ and the Riemann Hypothesis. Among other things, we prove that for $1\leq q\leq 10$ and for $q=12,…

In the first paper under this title (1977), the first author utilized a duality identity between the largest and smallest prime factors involving the Moebius function, to establish the following result as a consequence of the Prime Number…

Translated from the Latin original, "Theorema arithmeticum eiusque demonstratio", Commentationes arithmeticae collectae 2 (1849), 588-592. E794 in the Enestroem index. For m distinct numbers a,b,c,d,...,\upsilon,x this paper evaluates \[…