English
Related papers

Related papers: Sums of proper divisors with missing digits

200 papers

In this paper we show that every set $A \subset \mathbb{N}$ with positive density contains $B+C$ for some pair $B,C$ of infinite subsets of $\mathbb{N}$, settling a conjecture of Erd\H{o}s. The proof features two different decompositions of…

Combinatorics · Mathematics 2019-06-14 Joel Moreira , Florian Karl Richter , Donald Robertson

A set of natural numbers $A$ is called primitive if no element of $A$ divides any other. Let $\Omega(n)$ be the number of prime divisors of $n$ counted with multiplicity. Let $f_z(A) = \sum_{a \in A}\frac{z^{\Omega(a)}}{a (\log a)^z}$,…

Number Theory · Mathematics 2024-06-11 Petr Kucheriaviy

Erd\"os conjectured the existence of an infinite Sidon sequence of positive integers which is also an asymptotic basis of order 3. We make progress towards this conjecture in several directions. First we prove the conjecture for all cyclic…

Number Theory · Mathematics 2013-04-25 Javier Cilleruelo

We consider sets of positive integers containing no sum of two elements in the set and also no product of two elements. We show that the upper density of such a set is strictly smaller than 1/2 and that this is best possible. Further, we…

Number Theory · Mathematics 2013-09-10 Par Kurlberg , Jeffrey C. Lagarias , Carl Pomerance

For each positive integer $k$, let $\mathscr{A}_k$ be the set of all positive integers $n$ such that $\gcd(n, F_n) = k$, where $F_n$ denotes the $n$th Fibonacci number. We prove that the asymptotic density of $\mathscr{A}_k$ exists and is…

Number Theory · Mathematics 2020-12-15 Carlo Sanna , Emanuele Tron

For any positive integer $p\geq 3$, let $A$ be a proper subset of $\{0,1,\ldots, p-1\}$ with $\sharp A=s\geq 2$. Suppose $h: \{0,1,\ldots,s-1\}\to A$ is a one-to-one map which is strictly increasing with $A=\{h(0),h(1),\ldots,h(s-1)\}$. We…

Number Theory · Mathematics 2024-09-09 ChunYun Cao , Jie Yu

The Golomb-Welch conjecture states that there are no perfect $e$-error-correcting Lee codes in $\mathbb{Z}^n$ ($PL(n,e)$-codes) whenever $n\geq 3$ and $e\geq 2$. A special case of this conjecture is when $e=2$. In a recent paper of A.…

Information Theory · Computer Science 2018-04-26 Claudio Qureshi

A strictly increasing sequence $\mathscr{A}$ of positive integers is said to be primitive if no term of $\mathscr{A}$ divides any other. Erd\H{o}s showed that the series $\sum_{a \in \mathscr{A}} \frac{1}{a \log a}$, where $\mathscr{A}$ is…

Number Theory · Mathematics 2017-11-28 Bakir Farhi

For a nonempty finite set $A$ of positive integers, let $\gcd\left(A\right)$ denote the greatest common divisor of the elements of $A$. Let $f\left(n\right)$ and $\Phi\left(n\right)$ denote, respectively, the number of subsets $A$ of…

Number Theory · Mathematics 2013-06-21 Prapanpong Pongsriiam

A set $A$ of integers is said to be Schur if any two-colouring of $A$ results in monochromatic $x,y$ and $z$ with $x+y=z$. We study the following problem: how many random integers from $[n]$ need to be added to some $A\subseteq [n]$ to…

Combinatorics · Mathematics 2022-05-04 Shagnik Das , Charlotte Knierim , Patrick Morris

An integer is a primitive root modulo a prime $p$ if it generates the whole multiplicative group $(\mathbb{Z}/p\mathbb{Z})^*$. In 1927 Artin conjectured that an integer $a$ which is not $-1$ or a square is a primitive root for infintely…

Number Theory · Mathematics 2025-02-28 Paul Péringuey

Cumulative weight enumerators of random linear codes are introduced, their asymptotic properties are studied, and very sharp thresholds are exhibited; as a consequence, it is shown that the asymptotic Gilbert-Varshamov bound is a very sharp…

Information Theory · Computer Science 2012-12-27 Yun Fan , San Ling , Hongwei Liu , Jing Shen , Chaoping Xing

In this paper, we characterize the odd positive integers $n$ satisfying the congruence $\sum_{j=1} ^ {n-1} j^{\frac{n-1}{2}}\equiv 0 \pmod n$. We show that the set of such positive integers has an asymptotic density which turns out to be…

Number Theory · Mathematics 2011-03-18 Jose Maria Grau , Florian Luca , Antonio M. Oller-Marcen

For a positive integer $n$, if $\sigma(n)$ denotes the sum of the positive divisors of $n$, then $n$ is called a deficient perfect number if $\sigma(n)=2n-d$ for some positive divisor $d$ of $n$. In this paper, we prove some results about…

Number Theory · Mathematics 2019-06-25 Parama Dutta , Manjil P. Saikia

Let $G$ be a finite abelian group and let $A\subseteq \mathbb{Z}$ be nonempty. Let $D_A(G)$ denote the minimal integer such that any sequence over $G$ of length $D_A(G)$ must contain a nontrivial subsequence $s_1... s_r$ such that…

Number Theory · Mathematics 2009-03-17 David J. Grynkiewicz , Luz Elimar Marchan , Oscar Ordaz

In this paper analyzes \textit{The Erd\H{o}s-Straus conjecture} asserts that $f$$(n)$ $>$ 0 for every $n$ $\geq$ 2, where $f(n)$ indicates the number of solutions to the Diophantine Equation…

General Mathematics · Mathematics 2016-09-02 Elias Rios

If $s$ is a positive integer and $A$ is a set of positive integers, we say that $B$ is an $s$-divisor of $A$ if $\sum_{b\in B} b\mid s\sum_{a\in A} a$. We study the maximal number of $k$-subsets of an $n$-element set that can be…

Combinatorics · Mathematics 2015-05-21 Samuel Zbarsky

Kaplanski's Zero Divisor Conjecture envisions that for a torsion-free group G and an integral domain R, the group ring R[G] does not contain non-trivial zero divisors. We define the length of an element a in R[G] as the minimal non-negative…

Rings and Algebras · Mathematics 2012-03-01 Pascal Schweitzer

Uniform asymptotic expansions are derived for the zeros of the reverse generalized Bessel polynomials of large degree $n$ and real parameter $a$. It is assumed that $-\Delta_{1} n+\frac{3}{2} \leq a \leq \Delta_{2} n$ for fixed arbitrary…

Classical Analysis and ODEs · Mathematics 2025-11-04 T. M. Dunster , Amparo Gil , Diego Ruiz-Antolin , Javier Segura

We study the distribution of prime numbers under the unlikely assumption that Siegel zeros exist. In particular we prove for \[ \sum_{n \leq X} \Lambda(n) \Lambda(\pm n+h) \] an asymptotic formula which holds uniformly for $h = O(X)$. Such…

Number Theory · Mathematics 2022-02-08 Kaisa Matomäki , Jori Merikoski
‹ Prev 1 4 5 6 7 8 10 Next ›