English
Related papers

Related papers: Proving Touchard's Theorem From Euler's Form

200 papers

An odd perfect number $N$ is said to be given in Eulerian form if $N = {q^k}{n^2}$ where $q$ is prime with $q \equiv k \equiv 1 \pmod 4$ and $\gcd(q,n) = 1$. Similarly, an even perfect number $M$ is said to be given in Euclidean form if $M…

Number Theory · Mathematics 2017-08-28 Jose Arnaldo B. Dris

We shall given a new effectively computable upper bound of odd perfect numbers whose Euler factors are powers of fixed exponent, improving our old result in T. Yamada, Colloq. Math. 103 (2005), 303--307.

Number Theory · Mathematics 2020-12-29 Tomohiro Yamada

We extend the sum-of-divisors function to the complex plane via the Gaussian integers. Then we prove a modified form of Euler's classification of odd perfect numbers.

Number Theory · Mathematics 2008-05-15 Matthew Ward

The theory of Touchard polynomials is generalized using a method based on the definition of exponential operators, which extend the notion of the shift operator. The proposed technique, along with the use of the relevant operational…

Category Theory · Mathematics 2010-10-29 G. Dattoli , B. Germano , M. R. Martinelli , P. E. Ricci

A natural number $n$ is called {\it multiperfect} or {\it$k$-perfect} for integer $k\ge2$ if $\sigma(n)=kn$, where $\sigma(n)$ is the sum of the positive divisors of $n$. In this paper, we establish the structure theorem of odd multiperfect…

Number Theory · Mathematics 2011-02-23 Shi-Chao Chen , Hao Luo

Let B_n denote the nth Bell number. We use well-known recursive expressions for B_n to give a generalizing recursion that can be used to prove Touchard's congruence.

Combinatorics · Mathematics 2009-06-08 Greg Hurst , Andrew Schultz

We give necessary conditions for perfection of some families of odd numbers with special multiplicative forms. Extending earlier work of Steuerwald, Kanold, McDaniel et al.

Number Theory · Mathematics 2023-04-11 Luis H. Gallardo , Olivier. Rahavandrainy

The multiplicative structure of an odd perfect number $n$, if any, is $n=\pi^\alpha M^2$, where $\pi$ is prime, $\gcd(\pi,M)=1$ and $\pi\equiv \alpha\equiv1\pmod{4}$. An additive structure of $n$, established by Touchard, is that…

Number Theory · Mathematics 2017-09-18 Paolo Starni

Euler showed that if an odd perfect number exists, it must be of the form $N = p^\alpha q_{1}^{2\beta_{1}}$ $\ldots$ $q_{k}^{2\beta_{k}}$, where $p, q_{1}, \ldots, q_k$ are distinct odd primes, $\alpha$, $\beta_{i} \geq 1$, for $1 \leq i…

Number Theory · Mathematics 2015-12-07 Patrick Brown

We give a direct and simple proof of Touchard's continued fraction, provide an extension of it, and transform it into similar expansions related to Motzkin and Schroeder numbers. Another proof is then given that uses only induction. We use…

Combinatorics · Mathematics 2011-02-28 Helmut Prodinger

We give here a new proof of a Tauberian Theorem of complex Laplace transform using the Theory of measure and theory of function with bounded variations. However we deduce the simple proof of Prime Number Theorem.

Number Theory · Mathematics 2014-03-03 Lahoucine Elaissaoui

In this paper we investigate the properties of the Euler functions. By using the Fourier transform for the Euler function, we derive the interesting formula related to the infinite series. Finally we give some interesting identities between…

Number Theory · Mathematics 2008-08-14 Taekyun Kim

We present a probabilistic proof of Euler's pentagonal number theorem based on a shuffling model.

Number Theory · Mathematics 2025-09-17 Shane Chern

In this paper, we prove the conjecture that if there is an odd perfect number, then there are infinitely many of them.

Number Theory · Mathematics 2022-02-10 Jose Arnaldo Bebita Dris

The existence of a perfect odd number is an old open problem of number theory. An Euler's theorem states that if an odd integer $ n $ is perfect, then $ n $ is written as $ n = p ^ rm ^ 2 $, where $ r, m $ are odd numbers, $ p $ is a prime…

Number Theory · Mathematics 2018-01-22 Aldi Nestor de Souza

If $N={q^k}{n^2}$ is an odd perfect number given in Eulerian form, then Sorli's conjecture predicts that $k=\nu_{q}(N)=1$. In this article, we give some further results related to this conjecture and those contained in the papers…

Number Theory · Mathematics 2022-02-09 Jose Arnaldo B. Dris

We prove Euler's theorem of number theory developing an argument based on quandles. A quandle is an algebraic structure whose axioms mimic the three Reidemeister moves of knot theory.

Combinatorics · Mathematics 2022-04-01 António Lages , Pedro Lopes

Translated from the Latin original "Novae demonstrationes circa resolutionem numerorum in quadrata" (1774). E445 in the Enestrom index. See Chapter III, section XI of Weil's "Number theory: an approach through history". Also, a very clear…

History and Overview · Mathematics 2008-06-03 Leonhard Euler

Euler states without proof statements about the form of prime divisors of numbers of the form aa+Nbb. See Ed Sandifer's How Euler Did It, ``Factors of Forms'', December 2005 at http://www.maa.org/news/howeulerdidit.html for a summary of the…

History and Overview · Mathematics 2007-05-23 Leonhard Euler

We consider different generalizations of the Euler formula and discuss the properties of the associated trigonometric functions. The problem is analyzed from different points of view and it is shown that it can be formulated in a natural…

Classical Analysis and ODEs · Mathematics 2011-03-15 D. Babusci , G. Dattoli , E. Di Palma , E. Sabia
‹ Prev 1 2 3 10 Next ›