English
Related papers

Related papers: On the sum of two powered numbers

200 papers

Let $\sigma(n)$ to be the sum of the positive divisors of $n$. A number is non-deficient if $\sigma(n) \geq 2n$. We establish new lower bounds for the number of distinct prime factors of an odd non-deficient number in terms of its second…

Number Theory · Mathematics 2022-11-15 Joshua Zelinsky

The bivariate series $\theta (q,x):=\sum _{j=0}^{\infty}q^{j(j+1)/2}x^j$ %(where $(q,x)\in {\bf C}^2$, $|q|<1$) defines a {\em partial theta function}. For fixed $q$ ($|q|<1$), $\theta (q,.)$ is an entire function. For $q\in (-1,0)$ the…

Classical Analysis and ODEs · Mathematics 2019-05-10 Vladimir Petrov Kostov

A natural number $n$ is called {\it multiperfect} or {\it$k$-perfect} for integer $k\ge2$ if $\sigma(n)=kn$, where $\sigma(n)$ is the sum of the positive divisors of $n$. In this paper, we establish the structure theorem of odd multiperfect…

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

A positive integer $n$ is called practical if all integers between $1$ and $n$ can be written as a sum of distinct divisors of $n$. We give an asymptotic estimate for the number of integers $\le x$ which have a practical divisor $\ge y$.

Number Theory · Mathematics 2015-06-26 Andreas Weingartner

A numerical set is a co-finite subset of the natural numbers that contains zero. Its Frobenius number is the largest number in its complement. Each numerical set has an associated semigroup $A(T)=\{t\mid t+T\subseteq T\}$, which has the…

Combinatorics · Mathematics 2021-05-11 Deepesh Singhal , Yuxin Lin

A pair of numbers is amicable if each number equals the sum of the proper divisors of the other. This paper after exploring the history and evolution of amicable numbers, introduces a novel characterization of amicable pairs whose greatest…

History and Overview · Mathematics 2025-12-30 Ali Reza Mavaddat , Saeid Alikhani

A positive integer $n$ is said to be a practical number if every integer in $[1,n]$ can be represented as the sum of distinct divisors of $n$. In this article, we consider practical numbers of a given polynomial form. We give a necessary…

Number Theory · Mathematics 2022-12-08 Sai Teja Somu , Ting Hon Stanford Li , Andrzej Kukla

Using elementary methods, we determine the highest power of 2 dividing a power sum 1^n + 2^n + . . . + m^n, generalizing Lengyel's formula for the case where m is itself a power of 2. An application is a simple proof of Moree's result that,…

Number Theory · Mathematics 2012-11-27 Kieren MacMillan , Jonathan Sondow

We prove that the sumset or the productset of any finite set of real numbers, $A,$ is at least $|A|^{4/3-\epsilon},$ improving earlier bounds. Our main tool is a new upper bound on the multiplicative energy, $E(A,A).$

Combinatorics · Mathematics 2008-06-23 Jozsef Solymosi

Let $A$ be a finite set of positive real numbers. We present a sum-division estimate: |A+A|^2|A/A|\geq\frac{|A|^4}{4}.

Number Theory · Mathematics 2009-05-16 Liangpan Li , Jian Shen

Let $A$ be a finite multiset of powers of a positive integer $d>1$. We describe the structure of the set $\mathrm{span}(A)$ of all sums of submultisets of $A$, and in particular give a criterion of $\mathrm{span}(A)=\mathrm{span}(B)$ for…

Combinatorics · Mathematics 2022-10-04 Yizhou Guo

Let A={a_s+n_sZ}_{s=1}^k be a finite system of arithmetic sequences which forms an m-cover of Z (i.e., every integer belongs at least to m members of A). In this paper we show the following sharp result: For any positive integers…

Number Theory · Mathematics 2007-05-23 Hao Pan , Zhi-Wei Sun

Let $x$ be a positive integer. We give an asymptotic result for $\omega(\operatorname{lcm}(m,n))$ summed over all positive integers $m$ and $n$ with $mn \le x$. This answers an open question posed in a recent paper.

Number Theory · Mathematics 2021-01-19 Randell Heyman

A natural number $n$ is $y$-smooth if the greatest prime factor of $n$ does not exceed $y$. Let $s_{1}$ and $s_{2}$ are $y$-smooth numbers. We consider sums of smooth squares of the binary Titchmarsh divisor problem and give asymptotic…

Number Theory · Mathematics 2023-06-13 Nanxiang Wang , Haobo Dai

Fix $A$, a family of subsets of natural numbers, and let $G_A(n)$ be the maximum cardinality of a subset of $\{1,2,..., n\}$ that does not have any subset in $A$. We consider the general problem of giving upper bounds on $G_A(n)$ and give…

Number Theory · Mathematics 2015-06-16 Kevin O'Bryant

We study some divisibility properties of quasiperfect numbers. We show that if $N=(p_1 p_2 \cdots p_t)^{2a}=m^2$ is quasiperfect, then $2a+1$ is divisible by $3$ and $N$ has at least one prime factor smaller than $\exp 716.7944$. Moreover,…

Number Theory · Mathematics 2017-11-30 Tomohiro Yamada

We consider the set $$\mathcal{A} = \left\{10\cdot a + 11\cdot b \ | \gcd(a,b)=1, a\geq 1, b\geq 2a+1 \right\}.$$ We will prove that $\mathcal{A}$ is unbounded and that there exists a natural number $M\notin \mathcal{A}$ for which…

General Mathematics · Mathematics 2021-08-05 Antonio Linero-Bas , Daniel Nieves-Roldán

Answering a question of P. Erdos from 1965, we show that for every eps>0 there is a set A of n integers with the following property: every subset A' of A with at least (1/3 + eps)n elements contains three distinct elements x,y,z with x + y…

Combinatorics · Mathematics 2014-11-10 Sean Eberhard , Ben Green , Freddie Manners

The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…

General Mathematics · Mathematics 2014-12-30 Ramin Zahedi

Let $\sigma(n)$ be the sum of the divisors of $n$. Kalita and Saikia defined a number $n$ to be near superperfect if $2n+d=\sigma(\sigma(n))$ for some positive divisor $d$ of $n$. We extend some of their results about near superperfect…

Number Theory · Mathematics 2025-05-23 Satvik Beri , Joshua Zelinsky
‹ Prev 1 3 4 5 6 7 10 Next ›