Erdős Problem #1106
Let $p(n)$ denote the partition function of $n$ and let $F(n)$ count the number of distinct prime factors of $ \prod_{1\leq k\leq n}p(k). $ Does $F(n)...
Erdős Problem #1107
Let $r\geq 2$. A number $n$ is $r$-powerful if for every prime $p$ which divides $n$ we have $p^r\mid n$. Is every large integer the sum of at most $r...
Erdős Problem #1109
Let $f(N)$ be the size of the largest subset $A\subseteq \{1,\ldots,N\}$ such that every $n\in A+A$ is squarefree. Estimate $f(N)$. In particular, is ...
Erdős Problem #1110
Let $p>q\geq 2$ be two coprime integers. We call $n$ representable if it is the sum of integers of the form $p^kq^l$, none of which divide each other....
Erdős Problem #1112
Let $1\leq d_1<d_2$ and $k\geq 3$. Does there exist an integer $r$ such that if $B=\{b_1<\cdots\}$ is a lacunary sequence of positive integers with $b...
Erdős Problem #1113
A positive odd integer $m$ such that none of $2^km+1$ are prime for $k\geq 0$ is called a Sierpinski number. We say that a set of primes $P$ is a cove...