中文
相关论文

相关论文: Euler pseudoprimes for half of the bases

200 篇论文

We prove that every odd number $N$ greater than 1 can be expressed as the sum of at most five primes, improving the result of Ramar\'e that every even natural number can be expressed as the sum of at most six primes. We follow the circle…

数论 · 数学 2012-07-05 Terence Tao

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

In this note, we show that if $N$ is an odd perfect number and $q^{\alpha}$ is some prime power exactly dividing it, then $\sigma(N/q^{\alpha})/q^{\alpha}>5$. In general, we also show that if $\sigma(N/q^{\alpha})/q^{\alpha}<K$, where $K$…

数论 · 数学 2016-12-08 Jose Arnaldo B. Dris , Florian Luca

We consider several problems about pseudoprimes. First, we look at the issue of their distribution in residue classes. There is a literature on this topic in the case that the residue class is coprime to the modulus. Here we provide some…

数论 · 数学 2021-03-02 Carl Pomerance , Samuel S. Wagstaff

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.

数论 · 数学 2020-12-29 Tomohiro Yamada

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

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…

数论 · 数学 2023-12-01 Yoshinosuke Hirakawa

It is well known that the Euler characteristic of an odd dimensional compact manifold is zero. An Euler complex is a combinatorial analogue of a compact manifold. We present here an elementary proof of the corresponding result for Euler…

几何拓扑 · 数学 2013-02-25 Colin MacLaurin , Guyan Robertson

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

In this short paper we prove that the square of an odd prime number cannot be a very perfect number.

综合数学 · 数学 2008-12-04 Mihaly Bencze , Florin Popovici , Florentin Smarandache

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

Let $S,T$ be two numerical semigroups. We study when $S$ is one half of $T$, with $T$ almost symmetric. If we assume that the type of $T$, $t(T)$, is odd, then for any $S$ there exist infinitely many such $T$ and we prove that $1 \leq t(T)…

交换代数 · 数学 2014-04-22 Francesco Strazzanti

We introduce a new class of pseudoprimes. In this work we characterize Midy pseudoprimes, give some of their properties and established interesting connections with other known pseudoprimes, in particular we show that every divisor of a…

Consider the representation of a rational number as a continued fraction, associated with "odd" Euclidean algorithm. In this paper we prove certain properties for the limit distribution function for sequences of rationals with bounded sum…

数论 · 数学 2011-10-25 Elena Zhabitskaya

We generalize the notions of elliptic pseudoprimes and elliptic Carmichael numbers introduced by Silverman to analogues of Euler-Jacobi and strong pseudoprimes. We investigate the relationships among Euler Elliptic Carmichael numbers ,…

群论 · 数学 2023-06-22 L. Babinkostova , A. Hernández-Espiet , H. Kim

We explore two questions about pseudo-polynomials, which are functions $f:\mathbb N \to \mathbb Z$ such that $k$ divides $f(n+k) - f(n)$ for all $n,k$. First, for certain arbitrarily sparse sets $R$, we construct pseudo-polynomials $f$ with…

数论 · 数学 2021-08-30 Vivian Kuperberg

In this paper we prove that there cannot exist a perfect Euler box with a semiprime side. We first display the proof, which uses nothing more than elementary number theory. Due to the elementary nature of this proof, it is possible that…

数论 · 数学 2024-01-11 Riley Tao

In this paper we provide a straightforward proof that if a pair of amicable numbers with different parity exists (one number odd and the other one even), then the odd amicable number must be a perfect square, while the even amicable number…

历史与综述 · 数学 2007-06-13 Germano D'Abramo

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

Let $n \geq 1$ be an odd integer. We construct an anticyclotomic Euler system for certain cuspidal automorphic representations of unitary groups with signature $(1, 2n-1)$.

数论 · 数学 2023-12-05 Andrew Graham , Syed Waqar Ali Shah