English
Related papers

Related papers: On the distance between perfect numbers

200 papers

For any integer $m\ge0$, we recall that triangular numbers are those $\mathbf{T}(m)=\frac{m(m+1)}{2}$. A conjecture of Sun Zhi-Wei states that an integer $2^n\pm n$ with any $n>2$ can not be a triangular number. The motivation of this work…

Number Theory · Mathematics 2022-02-18 Wang Jia-Hui , Zhu Hui-Lin

We determine all perfect powers that can be written as the sum of at most 10 consecutive squares.

Number Theory · Mathematics 2017-07-24 Vandita Patel

We enumerate the 15768 perfect groups of order up to $2\cdot 10^6$, up to isomorphism, thus also completing the missing cases in the prior classification. The work supplements the by now well-understood computer classifications of solvable…

Group Theory · Mathematics 2021-10-12 Alexander Hulpke

We prove that the Pythagoras number of the ring of integers of the compositum of all real quadratic fields is infinite. The same holds for certain infinite totally real cyclotomic fields. In contrast, we construct infinite degree totally…

Number Theory · Mathematics 2026-02-27 Nicolas Daans , Stevan Gajović , Siu Hang Man , Pavlo Yatsyna

In this paper, we prove that for $d=3,\dots,8$, every natural number can be written as $t_x+t_y+3t_z+dt_w$, where $x$, $y$, $z$, and $w$ are nonnegative integers and $t_k=k(k+1)/2$ $(k=0,1,2,\ldots)$ is a triangular number. Furthermore, we…

Number Theory · Mathematics 2018-03-30 Kazuhide Matsuda

Weird numbers are abundant numbers that are not pseudoperfect. Since their introduction, the existence of odd weird numbers has been an open problem. In this work, we describe our computational effort to search for odd weird numbers, which…

Number Theory · Mathematics 2022-07-27 Wenjie Fang

We show that for $m$ points and $n$ lines in the real plane, the number of distinct distances between the points and the lines is $\Omega(m^{1/5}n^{3/5})$, as long as $m^{1/2}\le n\le m^2$. We also prove that for any $m$ points in the…

Metric Geometry · Mathematics 2015-12-31 Micha Sharir , Shakhar Smorodinsky , Claudiu Valculescu , Frank de Zeeuw

Let $\mathrm{pod}(n)$ denote the number of partitions of $n$ with odd parts distinct, and ${{r}_{k}}(n)$ be the number of representations of $n$ as sum of $k$ squares. We find the following two arithmetic relations: for any integer $n\ge…

Number Theory · Mathematics 2014-11-03 Liuquan Wang

We consider the problem of enumerating integer tetrahedra of fixed perimeter (sum of side-lengths) and/or diameter (maximum side-length), up to congruence. As we will see, this problem is considerably more difficult than the corresponding…

Combinatorics · Mathematics 2021-12-03 James East , Michael Hendriksen , Laurence Park

Let $N$ denote the maximum number of congruent infinite cylinders that can be arranged in $\mathbb{R}^3$ so that every pair of cylinders touches each other. Littlewood posed the question of whether $N=7$, which remains unsolved. In this…

Metric Geometry · Mathematics 2025-06-25 Junnosuke Koizumi

We study triples {a,b,c} of distinct nonzero rational numbers such that a+1,b+1,c+1,ab+1,ac+1,bc+1 and abc+1 are all perfect squares. We prove that there exist infinitely many such triples. In contrast, we show that no triple of positive…

Number Theory · Mathematics 2026-04-13 Andrej Dujella , Matija Kazalicki , Vinko Petričević

A perfect cuboid is formed when an Euler brick whose edges and face diagonals are all integers also has an integer internal diagonal. It is known that if a perfect cuboid exists the internal diagonal is odd. No perfect cuboid has been…

General Mathematics · Mathematics 2024-01-17 Ivor Lloyd

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

We prove that every concatenation of $10$ or more binary squares contains an overlap. The bound $10$ is best possible. In contrast, over a ternary alphabet, there are infinitely long overlap-free words that consist of a concatenation of…

Combinatorics · Mathematics 2026-05-28 Jeffrey Shallit

A pair of odd primes is said to be symmetric if each prime is congruent to one modulo their difference. A theorem from 1996 by Fletcher, Lindgren, and the third author provides an upper bound on the number of primes up to x that belong to a…

Number Theory · Mathematics 2019-08-27 William Banks , Paul Pollack , Carl Pomerance

One can embed arbitrarily many disjoint, non-parallel, non-boundary parallel, incompressible surfaces in any three manifold with at least one boundary component of genus two or greater [4]. This paper proves the contrasting, but not…

Geometric Topology · Mathematics 2007-05-23 Hugh Nelson Howards

We establish a characterization of the extraordinary dimension of perfect maps between metrizable spaces.

General Topology · Mathematics 2007-05-23 A. Chigogidze , V. Valov

The classical Three Gap Theorem asserts that for a natural number n and a real number p, there are at most three distinct distances between consecutive elements in the subset of [0,1) consisting of the reductions modulo 1 of the first n…

Differential Geometry · Mathematics 2008-03-11 Ian Biringer , Benjamin Schmidt

It is known that limit theorems for triangular arrays with identically distributed rows yields convergence of densities rather than just convergence in distribution. We show that this superconvergence result holds -- at least at points at…

Probability · Mathematics 2022-02-07 Hari Bercovici , Ching-Wei Ho , Jiun-Chau Wang , Ping Zhong

A construction of 2-quasi-perfect Lee codes is given over the space $\mathbb Z_p^n$ for $p$ prime, $p\equiv \pm 5\pmod{12}$ and $n=2[\frac{p}{4}]$. It is known that there are infinitely many such primes. Golomb and Welch conjectured that…

Information Theory · Computer Science 2017-06-26 Cristóbal Camarero , Carmen Martínez