English
Related papers

Related papers: On Dris Conjecture about Odd Perfect Numbers

200 papers

Let $R$ be a ring with pseudo-involution, $\mathfrak L$ be an odd form parameter, $\mathrm U(2n,\,R,\,\mathfrak L)$ be an odd hyperbolic unitary group, $\mathrm{EU}(2n,\,R,\,\mathfrak L)$ be it elementary subgroup and…

K-Theory and Homology · Mathematics 2013-03-27 Andrei Lavrenov

We revisit the Callias index formula for Dirac-type operators $L$ in odd space dimension $n$, and prove that \begin{align} \text{ind} \, (L) =\bigg(\frac{i}{8\pi}\bigg)^{\frac{n-1}{2}}\frac{1}{2(\frac{n-1}{2})!} \lim_{\Lambda…

Analysis of PDEs · Mathematics 2016-01-19 Fritz Gesztesy , Marcus Waurick

Let $G$ be a $(2,m,n)$-group and let $x$ be the number of distinct primes dividing $\chi$, the Euler characteristic of $G$. We prove, first, that, apart from a finite number of known exceptions, a non-abelian simple composition factor $T$…

Group Theory · Mathematics 2014-02-26 Nick Gill

We show that $n$ is almost perfect if and only if $I(n) - 1 < D(n) \leq I(n)$, where $I(n)$ is the abundancy index of $n$ and $D(n)$ is the deficiency of $n$. This criterion is then extended to the case of integers $m$ satisfying $D(m)>1$.

Number Theory · Mathematics 2018-03-08 Jose Arnaldo B. Dris

The main purpose of this paper is to find all the prime numbers p for which whenever we add to p an odd square less than p we obtain a number which has at most two different prime factors. We solve completely the cases $p\equiv 1,3,5 \pmod…

Number Theory · Mathematics 2024-01-30 Alexandru Gica

We discuss the classical results of Stanis{\l}aw Go\l\k{a}b, on the values of pi in arbitrary normed planes, including the classification of extremal values. We reprove the result of J. Duncan, D. Luecking, and C. McGregor, which states…

Metric Geometry · Mathematics 2022-09-28 Nikhil Henry Bukowski Sahoo

We show that the number of positive integers $n\leq N$ such that $\mathbb{Z}/(n^2+n+1)\mathbb{Z}$ contains a perfect difference set is asymptotically $N/\log{N}$.

Number Theory · Mathematics 2023-01-09 Sarah Peluse

Paul Erdos conjectured that for every n in N, n>1, there exist a, b, c natural numbers, not necessarily distinct, so that 4/n=1/a+1/b+1/c (see \cite{rg}). In this paper we prove an extension of Mordell's theorem and formulate a conjecture…

Number Theory · Mathematics 2010-01-08 Eugen J. Ionascu , Andrew Wilson

We call an odd positive integer $n$ a $\textit{Descartes number}$ if there exist positive integers $k,m$ such that $n = km$ and \begin{equation} \sigma(k)(m+1) = 2km \end{equation} Currently, $\mathcal{D} = 3^{2}7^{2}11^{2}13^{2}22021$ is…

Number Theory · Mathematics 2018-08-31 Pratik Rathore

Under Cram\'er's conjecture concerning the prime numbers, we prove that for any $x>1$, there exists a real $A=A(x)>1$ for which the formula $[A^{n^x}]$ (where $[]$ denotes the integer part) gives a prime number for any positive integer $n$.…

Number Theory · Mathematics 2007-05-23 Bakir Farhi

The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…

Classical Analysis and ODEs · Mathematics 2017-09-26 Alex Iosevich

We state a general purpose algorithm for quickly finding primes in evenly divided sub-intervals. Legendre's conjecture claims that for every positive integer $n$, there exists a prime between $n^2$ and $(n+1)^2$. Oppermann's conjecture…

Number Theory · Mathematics 2024-12-11 Jonathan Sorenson , Jonathan Webster

The aim of this paper is to give upper bounds for the Euclidean minima of abelian fields of odd prime conductor. In particular, these bounds imply Minkowski's conjecture for totally real number fields of conductor p^r, where p is an odd…

Number Theory · Mathematics 2013-10-24 Eva Bayer-Fluckiger , Piotr Maciak

Suppose that $n$ is $0$ or $4$ modulo $6$. We show that there are infinitely many primes of the form $p^2 + nq^2$ with both $p$ and $q$ prime, and obtain an asymptotic for their number. In particular, when $n = 4$ we verify the `Gaussian…

Number Theory · Mathematics 2024-10-15 Ben Green , Mehtaab Sawhney

A composite number $n$ is called a Lehmer number when $\phi(n) | n - 1$, where $\phi$ is the Euler totient function. Lehmer's totient problem asks if there exist any composite numbers $n$ such that $\phi(n)| n-1$? No such numbers are known.…

Number Theory · Mathematics 2015-10-26 Gholam Reza Pourgholi , Hendrik Van Maldeghem

The Erd\H{o}s-Straus conjecture, proposed in 1948 by Paul Erd\H{o}s and Ernst G. Straus, asks whether the Diophantine equation \[ \frac{4}{a} = \frac{1}{b} + \frac{1}{c} + \frac{1}{d} \] admits positive integer solutions $b, c, d \in…

Number Theory · Mathematics 2025-08-12 Bilal Ghermoul

Mathematicians has been trying to prove the weak Goldbach's conjecture by adding prime numbers, as stated in the conjecture. However, we believe that the solution does not need to be analytically solved. Instead of trying to add prime…

General Mathematics · Mathematics 2012-07-10 Luis A. Mateos

We present an efficient algorithm to compute the Euler factor of a genus 2 curve C/Q at an odd prime p that is of bad reduction for C but of good reduction for the Jacobian of C (a prime of ``almost good'' reduction). Our approach is based…

Number Theory · Mathematics 2025-04-18 Céline Maistret , Andrew V. Sutherland

In 2000 Deaconescu raised a question whether there exists a composite $n$ for which $S_2(n)|\phi(n)-1$, where $\phi(n)$ is Euler's function and $S_2(n)$ is Schemmel's totient function. In this paper we prove that any such $n$ is odd,…

Number Theory · Mathematics 2022-06-22 Elchin Hasanalizade

The decimal digits of $\pi$ are widely believed to behave like as statistically independent random variables taking the values $0, 1, 2, 3, 4, 5$, $6, 7, 8, 9$ with equal probabilities $1/10$. In this article, first, another similar…

Number Theory · Mathematics 2014-11-17 Karlis Podnieks