English
Related papers

Related papers: Porous Numbers

200 papers

This article is about Pi Formulas, infinite series of fractions which sum to multiples of Pi. Each such one can be associated with a unique set $S_k$ of rough numbers, where $k$ is a prime number. Given $S_k$ for any prime $k$, the set…

Number Theory · Mathematics 2024-02-19 A. J. Macfarlane

A positive integer is called an $E_j$-number if it is the product of $j$ distinct primes. We prove that there are infinitely many triples of $E_2$-numbers within a gap size of $32$ and infinitely many triples of $E_3$-numbers within a gap…

Number Theory · Mathematics 2021-03-16 Daniel A. Goldston , Apoorva Panidapu , Jordan Schettler

For any positive integers l and m, a set of integers is said to be (weakly) l-sum-free modulo m if it contains no (pairwise distinct) elements $x_1,x_2,...,x_l,y$ satisfying the congruence $x_1+\...+x_l\equiv y\bmod{m}$. It is proved that,…

For $x>0$ let $\pi(x)$ denote the number of primes not exceeding $x$. For integers $a$ and $m>0$, we determine when there is an integer $n>1$ with $\pi(n)=(n+a)/m$. In particular, we show that for any integers $m>2$ and $a\le\lceil…

Number Theory · Mathematics 2017-01-11 Zhi-Wei Sun

10 is the smallest positive integer which is whether solitary or friendly is still an open question in mathematics. In this paper, we provide upper bounds for each of the prime divisors of a friend of 10. This paper is precisely a…

General Mathematics · Mathematics 2026-05-01 Sagar Mandal

A perfect number is a number whose divisors add up to twice the number itself. The existence of odd perfect numbers is a millennia-old unsolved problem. This note proposes a proof of the nonexistence of odd perfect numbers. More generally,…

General Mathematics · Mathematics 2011-03-04 N. A. Carella

We establish new upper bounds for the length of runs of consecutive positive integers each with exactly $k$ divisors, where $k$ is a given positive integer of some special forms. Also we have found exact values of the maximum possible runs…

Number Theory · Mathematics 2018-11-14 Vasilii A. Dziubenko , Vladimir A. Letsko

A permutation of n letters is k-prolific if each (n-k)-subset of the letters in its one-line notation forms a unique pattern. We present a complete characterization of k-prolific permutations for each k, proving that k-prolific permutations…

Combinatorics · Mathematics 2018-05-25 David Bevan , Cheyne Homberger , Bridget Eileen Tenner

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

Let $b \ge 2$ be an integer. Among other results, we establish, in a quantitative form, that any sufficiently large integer which is not a multiple of $b$ cannot have simultaneously only few distinct prime factors and only few nonzero…

Number Theory · Mathematics 2018-11-14 Yann Bugeaud , Hajime Kaneko

Let $k\ge2$ be an integer. A natural number $n$ is called $k$-perfect if $\sigma(n)=kn.$ For any integer $r\ge1$ we prove that the number of odd $k$-perfect numbers with at most $r$ distinct prime factors is bounded by $k4^{r^3}$.

Number Theory · Mathematics 2011-02-23 Shi-Chao Chen , Hao Luo

A zero-sum sequence of integers is a sequence of nonzero terms that sum to 0. Let $k>0$ be an integer and let $[-k,k]$ denote the set of all nonzero integers between $-k$ and $k$. Let $\ell(k)$ be the smallest integer $\ell$ such that any…

Combinatorics · Mathematics 2012-12-13 Marvin Sahs , Papa Sissokho , Jordan Torf

We establish that every set of $k=10$ natural numbers determines at least $30$ distinct pairwise sums or at least $30$ distinct pairwise products, as well as the analogous result for $k=11$ and at least $34$ sums/products, with sharpness…

Combinatorics · Mathematics 2026-03-06 Phillip Antis , Holden Britt , Caleigh Chapman , Elizabeth Hawkins , Alex Rice , Elyse Warren

We consider the following "partition and sum" operation on a natural number: Treating the number as a long string of digits insert several plus signs in between some of the digits and carry out the indicated sum. This results in a smaller…

History and Overview · Mathematics 2015-01-19 Steve Butler , Ron Graham , Richard Stong

Let $n\geq 1$, $0\leq t\leq {n \choose 2}$ be arbitrary integers. Define the numbers $I_n(t)$ as the number of permutations of $[n]$ with $t$ inversions. Let $n,d\geq 1$ and $0\leq t\leq (d-1)n$ be arbitrary integers. Define {\em the…

Combinatorics · Mathematics 2016-10-10 Gábor Hegedüs

Let k>2 be a fixed integer exponent and let \theta > 9/10. We show that a positive integer N can be represented as a non-trivial sum or difference of 3 k-th powers, using integers of size at most B, in O(B^{\theta}N^{1/10}) ways, providing…

Number Theory · Mathematics 2008-06-27 D. R. Heath-Brown

It is conjectured that every integer N>454 is the sum of seven nonnegative cubes. We prove the conjecture when N is a multiple of 4.

Number Theory · Mathematics 2009-03-27 Kent D. Boklan , Noam D. Elkies

Let s and k be integers with s \geq 2 and k \geq 2. Let g_k^{(s)}(n) denote the cardinality of the largest subset of the set {1,2,..., n} that contains no geometric progression of length k whose common ratio is a power of s. Let r_k(\ell)…

Number Theory · Mathematics 2016-05-04 Melvyn B. Nathanson , Kevin O'Bryant

In this paper, we discuss a connection between geometric measure theory and number theory. This method brings a new point of view for some number-theoretic problems concerning digit expansions. Among other results, we showed that for each…

Number Theory · Mathematics 2022-02-14 Han Yu

We study how the Hausdorff measure is distributed in nonsymmetric narrow cones in $\mathbb{R}^n$. As an application, we find an upper bound close to $n-k$ for the Hausdorff dimension of sets with large $k$-porosity. With $k$-porous sets we…

Classical Analysis and ODEs · Mathematics 2017-01-31 Antti Käenmäki , Ville Suomala