English
Related papers

Related papers: About Very Perfect Numbers

200 papers

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 (counting multiplicity) of prime factors of $N$. We prove that $\frac{99}{37}\omega(N) - \frac{187}{37}…

Number Theory · Mathematics 2023-03-22 Graeme Clayton , Cody S. Hansen

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 consider the problem of simultaneous approximation to a number and to its square in a general framework that encompasses imaginary quadratic number fields and fields of rational functions in one variable. In this context, we construct…

Number Theory · Mathematics 2022-02-02 Samuel Pilon , Damien Roy

We consider the number of domino tilings of an odd-by-odd rectangle that leave one hole. This problem is equivalent to the number of near-perfect matchings of the odd-by-odd rectangular grid. For any particular position of the vacancy on…

Combinatorics · Mathematics 2025-06-05 Seok Hyun Byun , Wayne Goddard

In this paper we study quadratic forms which are universal when restricted to almost prime inputs, establishing finiteness theorems akin to the Conway--Schneeberger 15 theorem.

Number Theory · Mathematics 2021-07-06 Soumyarup Banerjee , Ben Kane

Let $k>2$ be a prime such that $2^k-1$ is a Mersenne prime. Let $n = 2^{\alpha-1}p$, where $\alpha>1$ and $p<3\cdot 2^{\alpha-1}-1$ is an odd prime. Continuing the work of Cai et al. and Jiang, we prove that $n\ |\ \sigma_k(n)$ if and only…

Number Theory · Mathematics 2020-01-24 Hung Viet Chu

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…

Number Theory · Mathematics 2007-05-23 Kevin G. Hare

We refute the so-called one-line proof of the infinitude of primes in [1].

History and Overview · Mathematics 2018-06-27 O. A. S. Karamzadeh

We give a new proof that there are infinitely many primes, relying on van der Waerden's theorem for coloring the integers, and Fermat's theorem that there cannot be four squares in an arithmetic progression. We go on to discuss where else…

Number Theory · Mathematics 2017-08-24 Andrew Granville

A perfect number is a positive integer n such that n equals the sum of all positive integer divisors of n that are less than n. That is, although n is a divisor of n, n is excluded from this sum. Thus 6 = 1 + 2 + 3 is perfect, but 12 < 1 +…

Logic in Computer Science · Computer Science 2015-09-22 John Cowles , Ruben Gamboa

We prove near-optimal upper bounds for the odd moments of the distribution of coprime residues in short intervals, confirming a conjecture of Montgomery and Vaughan. As an application we prove near-optimal upper bounds for the average of…

Number Theory · Mathematics 2026-05-13 Thomas F. Bloom , Vivian Kuperberg

In this note we generalise a method of Perott to give new proofs that there are infinitely many prime numbers.

Number Theory · Mathematics 2007-05-23 L. J. P. Kilford

For an integer n, a set of m distinct nonzero integers {a_1,a_2,...,a_m} such that a_i a_j+n is a perfect square for all 0<i<j<m+1, is called a D(n)-m-tuple. In this paper, we show that there are infinitely many essentially different…

Number Theory · Mathematics 2021-08-30 Andrej Dujella , Matija Kazalicki , Vinko Petričević

This is a report on a failed attempt to construct new graphs that are strongly regular with no triangles. The approach is based on the assumption that the second subconstituent has an equitable partition with four parts. For infinitely many…

Combinatorics · Mathematics 2010-03-02 Norman Biggs

Let V be a finite set of points in the plane, not contained in a line. Assume |V| = n is an odd number, and |L \cap V| \leq 3 for every line L which is spanned by V. We prove that every simple line L_{a,b} in V creates a simple wedge (i.e.,…

Combinatorics · Mathematics 2012-09-10 Shimon Garti

We survey the classical results on the prime number theorem

Number Theory · Mathematics 2007-05-23 Yong-Cheol Kim

We consider the problem of determining whether a given prime p is a congruent number. We present an easily computed criterion that allows us to conclude that certain primes for which congruency was previously undecided, are in fact not…

Number Theory · Mathematics 2013-04-30 Nils Bruin , Brett Hemenway

In [2] the author claims to provide a counterexample to a result in a recent paper [1]. In this note, we prove that the details of his example is false and this example is compatible with our result in [1] and so is not a countreexample.

Functional Analysis · Mathematics 2025-07-03 Elmiloud Chil

The theorem presented in this paper allows the creation of large prime numbers (of order up to o(n^2)) given a table of all primes up to n.

General Mathematics · Mathematics 2007-05-23 Leo Liberti

Ova-angular rotations of a prime number are characterized, constructed using the Dirichlet theorem. The geometric properties arising from this theory are analyzed and some applications are presented, including Goldbach's conjecture, the…

General Mathematics · Mathematics 2021-09-06 Yeisson Alexis Acevedo Agudelo