Erdős Problem #396
Is it true that for every $k$ there exists $n$ such that $ \prod_{0\leq i\leq k}(n-i) \mid \binom{2n}{n}? $ ...
Erdős Problem #400
For any $k\geq 2$ let $g_k(n)$ denote the maximum value of $ (a_1+\cdots+a_k)-n $ where $a_1,\ldots,a_k$ are integers such that $a_1!\cdots a_k! \mid ...
Erdős Problem #404
For which integers $a\geq 1$ and primes $p$ is there a finite upper bound on those $k$ such that there are $a=a_1<\cdots<a_n$ with $ p^k \mid (a_1!+\c...
Erdős Problem #406
Is it true that there are only finitely many powers of $2$ which have only the digits $0$ and $1$ when written in base $3$?...
Erdős Problem #408
Let $\phi(n)$ be the Euler totient function and $\phi_k(n)$ be the iterated $\phi$ function, so that $\phi_1(n)=\phi(n)$ and $\phi_k(n)=\phi(\phi_{k-1...
Erdős Problem #409
How many iterations of $n\mapsto \phi(n)+1$ are needed before a prime is reached? Can infinitely many $n$ reach the same prime? What is the density of...
Erdős Problem #410
Let $\sigma_1(n)=\sigma(n)$, the sum of divisors function, and $\sigma_k(n)=\sigma(\sigma_{k-1}(n))$. Is it true that for all $n\geq 2$ $ \lim_{k\to \...
Erdős Problem #411
Let $g_1=g(n)=n+\phi(n)$ and $g_k(n)=g(g_{k-1}(n))$. For which $n$ and $r$ is it true that $g_{k+r}(n)=2g_k(n)$ for all large $k$?...
Erdős Problem #412
Let $\sigma_1(n)=\sigma(n)$, the sum of divisors function, and $\sigma_k(n)=\sigma(\sigma_{k-1}(n))$. Is it true that, for every $m,n\geq 2$, there ex...
Erdős Problem #413
Let $\omega(n)$ count the number of distinct primes dividing $n$. Are there infinitely many $n$ such that, for all $m<n$, we have $m+\omega(m) \leq n$...
Erdős Problem #414
Let $h_1(n)=h(n)=n+\tau(n)$ (where $\tau(n)$ counts the number of divisors of $n$) and $h_k(n)=h(h_{k-1}(n))$. Is it true, for any $m,n$, there exist ...
Erdős Problem #415
For any $n$ let $F(n)$ be the largest $k$ such that any of the $k!$ possible ordering patterns appears in some sequence of $\phi(m+1),\ldots,\phi(m+k)...
Erdős Problem #416
Let $V(x)$ count the number of $n\leq x$ such that $\phi(m)=n$ is solvable. Does $V(2x)/V(x)\to 2$? Is there an asymptotic formula for $V(x)$?...
Erdős Problem #417
Let $ V'(x)=\#\{\phi(m) : 1\leq m\leq x\} $ and $ V(x)=\#\{\phi(m) \leq x : 1\leq m\}. $ Does $\lim V(x)/V'(x)$ exist? Is it $>1$?...
Erdős Problem #420
If $\tau(n)$ counts the number of divisors of $n$ then let $ F(f,n)=\frac{\tau((n+\lfloor f(n)\rfloor)!)}{\tau(n!)}. $ Is it true that $ \lim_{n\to \i...
Erdős Problem #421
Is there a sequence $1\leq d_1<d_2<\cdots$ with density $1$ such that all products $\prod_{u\leq i\leq v}d_i$ are distinct?...
Erdős Problem #422
Let $f(1)=f(2)=1$ and for $n>2$ $ f(n) = f(n-f(n-1))+f(n-f(n-2)). $ Does $f(n)$ miss infinitely many integers? What is its behaviour?...
Erdős Problem #423
Let $a_1=1$ and $a_2=2$ and for $k\geq 3$ choose $a_k$ to be the least integer $>a_{k-1}$ which is the sum of at least two consecutive terms of the se...
Erdős Problem #424
Let $a_1=2$ and $a_2=3$ and continue the sequence by appending to $a_1,\ldots,a_n$ all possible values of $a_ia_j-1$ with $i eq j$. Is it true that th...
Erdős Problem #425
Let $F(n)$ be the maximum possible size of a subset $A\subseteq\{1,\ldots,N\}$ such that the products $ab$ are distinct for all $a<b$. Is there a cons...
Erdős Problem #428
Is there a set $A\subseteq \mathbb{N}$ such that, for infinitely many $n$, all of $n-a$ are prime for all $a\in A$ with $0<a<n$ and $ \liminf\frac{\lv...
Erdős Problem #430
Fix some integer $n$ and define a decreasing sequence in $[1,n)$ by $a_1=n-1$ and, for $k\geq 2$, letting $a_k$ be the greatest integer in $[1,a_{k-1}...
Erdős Problem #431
Are there two infinite sets $A$ and $B$ such that $A+B$ agrees with the set of prime numbers up to finitely many exceptions?...
Erdős Problem #432
Let $A,B\subseteq \mathbb{N}$ be two infinite sets. How dense can $A+B$ be if all elements of $A+B$ are pairwise relatively prime?...
Erdős Problem #436
If $p$ is a prime and $k,m\geq 2$ then let $r(k,m,p)$ be the minimal $r$ such that $r,r+1,\ldots,r+m-1$ are all $k$th power residues modulo $p$. Let $...
Erdős Problem #445
Is it true that, for any $c>1/2$, if $p$ is a sufficiently large prime then, for any $n\geq 0$, there exist $a,b\in(n,n+p^c)$ such that $ab\equiv 1\pm...
Erdős Problem #450
How large must $y=y(\epsilon,n)$ be such that the number of integers in $(x,x+y)$ with a divisor in $(n,2n)$ is at most $\epsilon y$?...
Erdős Problem #451
Estimate $n_k$, the smallest integer $>2k$ such that $\prod_{1\leq i\leq k}(n_k-i)$ has no prime factor in $(k,2k)$....
Erdős Problem #452
Let $\omega(n)$ count the number of distinct prime factors of $n$. What is the size of the largest interval $I\subseteq [x,2x]$ such that $\omega(n)>\...
Erdős Problem #454
Let $ f(n) = \min_{i<n} (p_{n+i}+p_{n-i}), $ where $p_k$ is the $k$th prime. Is it true that $ \limsup_n (f(n)-2p_n)=\infty? $ ...
Erdős Problem #455
Let $q_1<q_2<\cdots$ be a sequence of primes such that $ q_{n+1}-q_n\geq q_n-q_{n-1}. $ Must $ \lim_n \frac{q_n}{n^2}=\infty? $ ...
Erdős Problem #456
Let $p_n$ be the smallest prime $\equiv 1\pmod{n}$ and let $m_n$ be the smallest integer such that $n\mid \phi(m_n)$. Is it true that $m_n<p_n$ for al...
Erdős Problem #457
Is there some $\epsilon>0$ such that there are infinitely many $n$ where all primes $p\leq (2+\epsilon)\log n$ divide $ \prod_{1\leq i\leq \log n}(n+i...
Erdős Problem #460
Let $a_0=0$ and $a_1=1$, and in general define $a_k$ to be the least integer $>a_{k-1}$ for which $(n-a_k,n-a_i)=1$ for all $0\leq i<k$. Does $ \sum_{...
Erdős Problem #461
Let $s_t(n)$ be the $t$-smooth component of $n$ - that is, the product of all primes $p$ (with multiplicity) dividing $n$ such that $p<t$. Let $f(n,t)...
Erdős Problem #462
Let $p(n)$ denote the least prime factor of $n$. There is a constant $c>0$ such that $ \sum_{\substack{n<x\\ n\textrm{ not prime}}}\frac{p(n)}{n}\sim ...
Erdős Problem #463
Is there a function $f$ with $f(n)\to \infty$ as $n\to \infty$ such that, for all large $n$, there is a composite number $m$ such that $ n+f(n)<m<n+p(...
Erdős Problem #467
Prove the following for all large $x$: there is a choice of congruence classes $a_p$ for all primes $p\leq x$ and a decomposition $\{p\leq x\}=A\sqcup...
Erdős Problem #468
For any $n$ let $D_n$ be the set of sums of the shape $d_1,d_1+d_2,d_1+d_2+d_3,\ldots$ where $1<d_1<d_2<\cdots$ are the divisors of $n$. What is the s...
Erdős Problem #469
Let $A$ be the set of all $n$ such that $n=d_1+\cdots+d_k$ with $d_i$ distinct proper divisors of $n$, but this is not true for any $m\mid n$ with $m<...
Erdős Problem #470
Call $n$ weird if $\sigma(n)\geq 2n$ and $n$ is not pseudoperfect, that is, it is not the sum of any set of its divisors. Are there any odd weird numb...
Erdős Problem #472
Given some initial finite sequence of primes $q_1<\cdots<q_m$ extend it so that $q_{n+1}$ is the smallest prime of the form $q_n+q_i-1$ for $n\geq m$....
Erdős Problem #477
Is there a polynomial $f:\mathbb{Z}\to \mathbb{Z}$ of degree at least $2$ and a set $A\subset \mathbb{Z}$ such that for any $n\in \mathbb{Z}$ there is...
Erdős Problem #478
Let $p$ be a prime and $ A_p = \{ k! \pmod{p} : 1\leq k<p\}. $ Is it true that $ \lvert A_p\rvert \sim (1-\tfrac{1}{e})p? $ ...
Erdős Problem #479
Is it true that, for all $k eq 1$, there are infinitely many $n$ such that $2^n\equiv k\pmod{n}$?...
Erdős Problem #483
Let $f(k)$ be the minimal $N$ such that if $\{1,\ldots,N\}$ is $k$-coloured then there is a monochromatic solution to $a+b=c$. Estimate $f(k)$. In par...
Erdős Problem #486
Let $A\subseteq \mathbb{N}$, and for each $n\in A$ choose some $X_n\subseteq \mathbb{Z}/n\mathbb{Z}$. Let $ B = \{ m\in \mathbb{N} : m ot\in X_n\pmod{...
Erdős Problem #488
Let $A$ be a finite set and $ B=\{ n \geq 1 : a\mid n\textrm{ for some }a\in A\}. $ Is it true that, for every $m>n\geq \max(A)$, $ \frac{\lvert B\cap...
Erdős Problem #489
Let $A\subseteq \mathbb{N}$ be a set such that $\lvert A\cap [1,x]\rvert=o(x^{1/2})$. Let $ B=\{ n\geq 1 : a mid n\textrm{ for all }a\in A\}. $ If $B=...
Erdős Problem #495
Let $\alpha,\beta \in \mathbb{R}$. Is it true that $ \liminf_{n\to \infty} n \| n\alpha \| \| n\beta\| =0 $ where $\|x\|$ is the distance from $x$ to ...