Related papers: Theorematum quorundam arithmeticorum demonstration…
In this paper we study mixed sums of primes and linear recurrences. We show that if m=2(mod 4) and m+1 is a prime then $(m^{2^n-1}-1)/(m-1)\not=m^n+p^a$ for any n=3,4,... and prime power p^a. We also prove that if a>1 is an integer, u_0=0,…
Following an idea due to Euler, we evaluate the alternating sums of powers of consrcutive integers.
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…
New formulas for the construction of Pythagorean triples and generalizations to equations of higher powers. Application of formulas to some problems, in particular Fermat's equation with n=4.
Let $m\ge3$ be an integer. The polygonal numbers of order $m+2$ are given by $p_{m+2}(n)=m\binom n2+n$ $(n=0,1,2,\ldots)$. A famous claim of Fermat proved by Cauchy asserts that each nonnegative integer is the sum of $m+2$ polygonal numbers…
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…
Two centuries ago, Sophie Germain began to work on her grand plan to prove the theorem of Fermat, the famous conjecture that $x^n + y^n = z^n$ is impossible for nonzero integral values of $x$, $y$, and $z$, when $n > 2$. At that time, this…
E394 in the Enestrom index. Translated from the Latin original, "De partitione numerorum in partes tam numero quam specie datas" (1768). Euler finds a lot of recurrence formulas for the number of partitions of $N$ into $n$ parts from some…
In this paper, we begin the study of the Fermat equation $x^n+y^n=z^n$ over real biquadratic fields. In particular, we prove that there are no non-trivial solutions to the Fermat equation over $\mathbb{Q}(\sqrt{2},\sqrt{3})$ for $n\geq 4$.
We prove a short general theorem which immediately implies some classical results of Hasse, Guillera and Sondow, Paolo Amore, and also Alzer and Richards. At the end we obtain a new representation for the Euler constant gamma. The theorem…
We consider differences between $\log \Gamma(x)$ and truncations of certain classical asymptotic expansions in inverse powers of $x-\lambda$ whose coefficients are expressed in terms of Bernoulli polynomials $B_n(\lambda)$, and we obtain…
New series representations for odd powers of {\pi} i.e. {\pi}, {\pi}3 and {\pi}5 in terms of Euler numbers and even powers of {\pi} i.e. {\pi}2, {\pi}4 and {\pi}6 in terms of Bernoulli numbers have been obtained empirically.
The attributes of Euler's constant Gamma have been a baffling problem to the world's mathematicians in the number theory field. In 1900, when German mathematician D. Hilbert addressed the 2nd International Congress of Mathematicians, he…
In 1997 we proved that if $n$ is of the form $$ 4k, \quad 8k-1\quad {\rm or} \quad 2^{2m+1}(2k-1)+3, $$ where $k,m\in \mathbb N,$ then there are no positive rational numbers $x,y,z$ satisfying $$ xyz = 1, \quad x+y+z = n. $$ Recently, N. X.…
I relate some coefficients encountered when computing the functional determinants on spheres to the central differentials of nothing. In doing this I use some historic works, in particular transcribing the elegant symbolic formalism of…
In this paper, we obtain some formulas for double nonlinear Euler sums involving harmonic numbers and alternating harmonic numbers. By using these formulas, we give new closed form sums of several quadratic Euler series through Riemann zeta…
Two inequalities involving the Euler totient function and the sum of the $k$-th powers of the divisors of balancing numbers are explored.
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…
The double zeta function was first studied by Euler in response to a letter from Goldbach in 1742. One of Euler's results for this function is a decomposition formula, which expresses the product of two values of the Riemann zeta function…
Under the 3x+1 problem, classified the number into four kind by mod 4. The four kind number can form a cycle base on 3x+b1 problem. Base on this cycle, if the number of kind number is zero the 3x+1 will be proofed.