English
Related papers

Related papers: Maximal product of primes whose sum is bounded

200 papers

A primorial prime is a prime number of the form $p_n\# \pm 1$ where $p_n\#$ denotes the product of all primes less than or equal to $p_{n}$, the $n$-th prime. We show that the probability along the lines of Mertens' Theorem that either…

Number Theory · Mathematics 2021-10-12 George Lillie

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

Let $A$ be an infinite set of nonnegative integers. For $h \geq 2$, let $hA$ be the set of all sums of $h$ not necessarily distinct elements of $A$. If every sufficiently large integer in the sumset $hA$ has at least two representations,…

Number Theory · Mathematics 2016-05-04 Melvyn B. Nathanson

Let $A$ be a set of $n$ positive integers. We say that a subset $B$ of $A$ is a divisor of $A$, if the sum of the elements in $B$ divides the sum of the elements in $A$. We are interested in the following extremal problem. For each $n$,…

Combinatorics · Mathematics 2014-09-22 Tony Huynh

Define B(n) to be the largest height of a polynomial in $\mathbb{Z}[x]$ dividing $x^n-1$. We formulate a number of conjectures related to the value of B(n) when $n$ is of a prescribed form. Additionally, we prove a lower bound for…

Number Theory · Mathematics 2010-09-30 Nathan C. Ryan , Bryan C. Ward , Ryan Ward

We provide a simple algorithm for finding the optimal upper bound for sums of products of matrix entries of the form S_pi(N) := sum_{j_1, ..., j_2m = 1}^N t^1_{j_1 j_2} t^2_{j_3 j_4} ... t^m_{j_2m-1 j_2m} where some of the summation indices…

Operator Algebras · Mathematics 2012-10-25 James A. Mingo , Roland Speicher

In this paper we show that for every positive integer $n$ there exists a prime number in the interval $[n,9(n+3)/8]$. Based on this result, we prove that if $a$ is an integer greater than 1, then for every integer $n>14.4a$ there are at…

Number Theory · Mathematics 2013-09-03 Germán Paz

For a natural number $k>1$, let $f_k(n)$ denote the number of distinct representations of a natural number $n$ of the form $p^k+q^k$ for primes $p,q$. We prove that, for all $k>1$, $$\limsup_{n\to\infty}f_k(n)=\infty.$$ This positively…

Number Theory · Mathematics 2025-09-17 Anay Aggarwal

A subset of the Hamming cube over $n$-letter alphabet is said to be $d$-maximal if its diameter is $d$, and adding any point increases the diameter. Our main result shows that each $d$-maximal set is either of size at most $(n+o(n))^d$ or…

Combinatorics · Mathematics 2025-07-16 Boris Bukh , Aleksandre Saatashvili

We obtain an upper bound for the number of pairs $ (a,b) \in {A\times B} $ such that $ a+b $ is a prime number, where $ A, B \subseteq \{1,...,N \}$ with $|A||B| \, \gg \frac{N^2}{(\log {N})^2}$, $\, N \geq 1$ an integer. This improves on a…

Number Theory · Mathematics 2017-10-24 Kummari Mallesham

For any fixed $k\geq 2$, we prove that every sufficiently large integer can be expressed as the sum of a $k$th power of a prime and a number with at most $M(k)=6k$ prime factors. For sufficiently large $k$ we also show that one can take…

Number Theory · Mathematics 2025-05-15 Daniel R. Johnston , Simon N. Thomas

For $n\ge 1$, the $n^{\rm th}$ Ramanujan prime is defined as the smallest positive integer $R_n$ such that for all $x\ge R_n$, the interval $(\frac{x}{2}, x]$ has at least $n$ primes. We show that for every $\epsilon>0$, there is a positive…

Number Theory · Mathematics 2017-06-23 Anitha Srinivasan , Pablo Arés

We estimate the number of solutions of certain diagonal congruences involving factorials. We use these results to bound exponential sums with products of two factorials $n!m!$ and also derive asymptotic formulas for the number of solutions…

Number Theory · Mathematics 2007-05-23 Moubariz Z. Garaev , Florian Luca , Igor E. Shparlinski

Let $n,k\in\mathbb{N}$ and let $p_{n}$ denote the $n$th prime number. We define $p_{n}^{(k)}$ recursively as $p_{n}^{(1)}:=p_{n}$ and $p_{n}^{(k)}=p_{p_{n}^{(k-1)}}$, that is, $p_{n}^{(k)}$ is the $p_{n}^{(k-1)}$th prime. In this note we…

Number Theory · Mathematics 2022-01-06 Błażej Żmija

In this paper, we study the number of representations of a positive integer $n$ by two positive integers whose product is a multiple of a polygonal number.

Number Theory · Mathematics 2017-09-20 Hao Zhong , Tianxin Cai

Let $R$ be a polynomial ring over a field of characteristic zero and let $I \subset R$ be a graded ideal of height $N$ which is minimally generated by $N+1$ homogeneous polynomials. If $I=(f_1,...,f_{N+1})$ where $f_i$ has degree $d_i$ and…

Commutative Algebra · Mathematics 2010-10-20 Bahman Engheta

Using an explicit version of Selberg's upper sieve, we obtain explicit upper bounds for the number of $n\leq x$ such that a non-empty set of irreducible polynomials $F_i(n)$ with integer coefficients are simultaneously prime; this set can…

Number Theory · Mathematics 2022-11-22 Matteo Bordignon , Ethan Simpson Lee

Let $k \geq 3$ and let $L_i(n) = A_in + B_i$ be some linear forms such that $A_i$ and $B_i$ are integers. Define ${\mathcal{P}(n) = \prod_{i=1}^k L_i(n)}$. For each $k$ it is known that $\Omega (\mathcal{P} (n) ) \leq \rho_k$ infinitely…

Number Theory · Mathematics 2020-06-16 Paweł Lewulis

Let $p_n$ be $n$th prime, and let $(S_n)_{n=1}^\infty:=(S_n)$ be the sequence of the sums of the first $2n$ consecutive primes, that is, $S_n=\sum_{k=1}^{2n}p_k$ with $n=1,2,\ldots$. Heuristic arguments supported by the corresponding…

Number Theory · Mathematics 2018-04-13 Romeo Meštrović

The 2-adic valuation of an integer n which is the exponent of the highest power of 2 that divides n. In this paper, we give representations of certain restricted partition functions in terms of 2-adic valuation.

Number Theory · Mathematics 2024-10-29 Sabi Biswas , Nipen Saikia