中文
相关论文

相关论文: A new upper bound for odd perfect numbers of a spe…

200 篇论文

We present lower bounds on the sum and product of the distinct prime factors of an odd perfect number, which provide a lower bound on the size of the odd perfect number as a function of the number of its distinct prime factors.

数论 · 数学 2010-08-09 Anirudh Prabhu

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.

数论 · 数学 2023-04-11 Luis H. Gallardo , Olivier. Rahavandrainy

Much recent progress has been made concerning the probable existence of Odd Perfect Numbers, forming part of what has come to be known as Sylvester's Web Of Conditions. This paper proves some results concerning certain properties of the…

数论 · 数学 2012-11-21 Siddhartha Basak

Let $\sigma(n)$ denote the sum of the positive divisors of $n$. We say that $n$ is perfect if $\sigma(n) = 2 n$. Currently there are no known odd perfect numbers. It is known that if an odd perfect number exists, then it must be of the form…

数论 · 数学 2007-05-23 Kevin G. Hare

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.

数论 · 数学 2008-05-15 Matthew Ward

Some new results concerning the equation $\sigma(N)=aM, \sigma(M)=bN$ are proved. As a corollary, there are only finitely many odd superperfect numbers with a fixed number of distinct prime factors.

数论 · 数学 2020-10-21 Tomohiro Yamada

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…

数论 · 数学 2015-12-07 Patrick Brown

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…

数论 · 数学 2017-08-28 Jose Arnaldo B. 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…

数论 · 数学 2018-01-22 Aldi Nestor de Souza

We study the explicit formula of Euler numbers and polynomials of higher order

数论 · 数学 2007-05-23 Taekyun Kim

In a recent preprint on arXiv Roland Bacher showed that the number $p_d$ of non-similar perfect $d$-dimensional quadratic forms satisfies $e^{\Omega(d)} < p_d < e^{O(d^3\log(d))}$. We improve the upper bound to $e^{O(d^2\log(d))}$ by a…

数论 · 数学 2020-11-17 Wessel P. J. van Woerden

Let $N$ be an odd perfect number. Let $\omega(N)$ be the number of distinct prime factors of $N$ and let $\Omega(N)$ be the total number of prime factors of $N$. We prove that if $(3,N)=1$, then $ \frac{302}{113}\omega - \frac{286}{113}…

数论 · 数学 2019-10-22 Joshua Zelinsky

Acquaah and Konyagin showed that if $N$ is an odd perfect number where $N= p_1^{a_1}p_2^{a_2} \cdots p_k^{a_k}$ where $p_1 < p_2 \cdots < p_k$ then one must have $p_k < 3^{1/3}N^{1/3}$. Using methods similar to theirs, we show that…

数论 · 数学 2018-12-18 Joshua Zelinsky

We present several sequences of Euler sums involving odd harmonic numbers. The calculational technique is based on proper two-valued integer functions, which allow to compute these sequences explicitly in terms of zeta values only.

数论 · 数学 2021-03-11 J. Braun , D. Romberger , H. J. Bentz

The Euler's form of odd perfect numbers, if any, is $n=\pi^{\alpha}N^2$, where $\pi$ is prime, $(\pi,N)=1$ and $\pi\equiv \alpha \equiv 1 \pmod{4}$. Dris conjecture states that $N>\pi^{\alpha}$. We find that $N^2>\frac{1}{2}\pi^{\gamma}$,…

数论 · 数学 2017-06-08 Paolo Starni

An odd perfect number, N, is shown to have at least nine distinct prime factors. If 3 does not divide N, then N must have at least twelve distinct prime divisors. The proof ultimately avoids previous computational results for odd perfect…

数论 · 数学 2009-11-11 Pace P. Nielsen

This paper derives Touchard's theorem from Euler's form for odd perfect numbers. It also fine-tunes Euler's form.

历史与综述 · 数学 2008-04-02 Eyob Delele Yirdaw

In this paper, we consider certain finite sums related to the "largest odd divisor", and we obtain, using simple ideas and recurrence relations, sharp upper and lower bounds for these sums.

数论 · 数学 2011-03-14 Omran Kouba

The numbers of even and odd permutations with a given ascent number are investigated using an operator that was previously introduced by the author. Their difference is called a signed Eulerian number. By means of the operator the…

组合数学 · 数学 2007-05-23 Shinji Tanimoto

We prove upper bounds on the number of resonances and eigenvalues of Schr\"odinger operators $-\Delta+V$ with complex-valued potentials, where $d\geq 3$ is odd. The novel feature of our upper bounds is that they are \emph{effective}, in the…

谱理论 · 数学 2024-11-22 Jean-Claude Cuenin
‹ 上一页 1 2 3 10 下一页 ›