Unsolved Problems

Showing 101-150 of 356 problems (Page 3 of 8)

EP-319
Open

Erdős Problem #319

What is the size of the largest $A\subseteq \{1,\ldots,N\}$ such that there is a function $\delta:A\to \{-1,1\}$ such that $ \sum_{n\in A}\frac{\delta...

L1
Number Theory
0
0
EP-322
Open

Erdős Problem #322

Let $k\geq 3$ and $A\subset \mathbb{N}$ be the set of $k$th powers. What is the order of growth of $1_A^{(k)}(n)$, i.e. the number of representations ...

L1
Number Theory
0
0
EP-323
Open

Erdős Problem #323

Let $1\leq m\leq k$ and $f_{k,m}(x)$ denote the number of integers $\leq x$ which are the sum of $m$ many nonnegative $k$th powers. Is it true that $ ...

L1
Number Theory
0
0
EP-324
Open

Erdős Problem #324

Does there exist a polynomial $f(x)\in\mathbb{Z}[x]$ such that all the sums $f(a)+f(b)$ with $a<b$ nonnegative integers are distinct?...

L1
Number Theory
0
0
EP-325
Open

Erdős Problem #325

Let $k\geq 3$ and $f_{k,3}(x)$ denote the number of integers $\leq x$ which are the sum of three nonnegative $k$th powers. Is it true that $ f_{k,3}(x...

L1
Number Theory
0
0
EP-329
Open

Erdős Problem #329

Suppose $A\subseteq \mathbb{N}$ is a Sidon set. How large can $ \limsup_{N\to \infty}\frac{\lvert A\cap \{1,\ldots,N\}\rvert}{N^{1/2}} $ be?...

L1
Number Theory
0
0
EP-330
Open

Erdős Problem #330

Does there exist a minimal basis with positive density, say $A\subset\mathbb{N}$, such that for any $n\in A$ the (upper) density of integers which can...

L1
Number Theory
0
0
EP-332
Open

Erdős Problem #332

Let $A\subseteq \mathbb{N}$ and $D(A)$ be the set of those numbers which occur infinitely often as $a_1-a_2$ with $a_1,a_2\in A$. What conditions on $...

L1
Number Theory
0
0
EP-334
Open

Erdős Problem #334

Find the best function $f(n)$ such that every $n$ can be written as $n=a+b$ where both $a,b$ are $f(n)$-smooth (that is, are not divisible by any prim...

L1
Number Theory
0
0
EP-336
Open

Erdős Problem #336

For $r\geq 2$ let $h(r)$ be the maximal finite $k$ such that there exists a basis $A\subseteq \mathbb{N}$ of order $r$ (so every large integer is the ...

L1
Number Theory
0
0
EP-338
Open

Erdős Problem #338

The restricted order of a basis is the least integer $t$ (if it exists) such that every large integer is the sum of at most $t$ distinct summands from...

L1
Number Theory
0
0
EP-340
Open

Erdős Problem #340

Let $A=\{1,2,4,8,13,21,31,45,66,81,97,\ldots\}$ be the greedy Sidon sequence: we begin with $1$ and iteratively include the next smallest integer that...

L1
Number Theory
0
0
EP-341
Open

Erdős Problem #341

Let $A=\{a_1<\cdots<a_k\}$ be a finite set of positive integers and extend it to an infinite sequence $\overline{A}=\{a_1<a_2<\cdots \}$ by defining $...

L1
Number Theory
0
0
EP-342
Open

Erdős Problem #342

With $a_1=1$ and $a_2=2$ let $a_{n+1}$ for $n\geq 2$ be the least integer $>a_n$ which can be expressed uniquely as $a_i+a_j$ for $i<j\leq n$. What ca...

L1
Number Theory
0
0
EP-345
Open

Erdős Problem #345

Let $A\subseteq \mathbb{N}$ be a complete sequence, and define the threshold of completeness $T(A)$ to be the least integer $m$ such that all $n\geq m...

L1
Number Theory
0
0
EP-346
Open

Erdős Problem #346

Let $A=\{1\leq a_1< a_2<\cdots\}$ be a set of integers such that {UL} {LI} $A\backslash B$ is complete for any finite subset $B$ and {/LI} {LI} $A\bac...

L1
Number Theory
0
0
EP-348
Open

Erdős Problem #348

For what values of $0\leq m<n$ is there a complete sequence $A=\{a_1\leq a_2\leq \cdots\}$ of integers such that {UL} {LI} $A$ remains complete after ...

L1
Number Theory
0
0
EP-349
Open

Erdős Problem #349

For what values of $t,\alpha \in (0,\infty)$ is the sequence $\lfloor t\alpha^n\rfloor$ complete (that is, all sufficiently large integers are the sum...

L1
Number Theory
0
0
EP-351
Open

Erdős Problem #351

Let $p(x)\in \mathbb{Q}[x]$. Is it true that $ A=\{ p(n)+1/n : n\in \mathbb{N}\} $ is strongly complete, in the sense that, for any finite set $B$, $ ...

L1
Number Theory
0
0
EP-354
Open

Erdős Problem #354

Let $\alpha,\beta\in \mathbb{R}_{>0}$ such that $\alpha/\beta$ is irrational. Is the multiset $ \{ \lfloor \alpha\rfloor,\lfloor 2\alpha\rfloor,\lfloo...

L1
Number Theory
0
0
EP-357
Open

Erdős Problem #357

Let $1\leq a_1<\cdots <a_k\leq n$ be integers such that all sums of the shape $\sum_{u\leq i\leq v}a_i$ are distinct. Let $f(n)$ be the maximal such $...

L1
Number Theory
0
0
EP-358
Open

Erdős Problem #358

Let $A=\{a_1<\cdots\}$ be an infinite sequence of integers. Let $f(n)$ count the number of solutions to $ n=\sum_{u\leq i\leq v}a_i. $ Is there such a...

L1
Number Theory
0
0
EP-359
Open

Erdős Problem #359

Let $a_1<a_2<\cdots$ be an infinite sequence of integers such that $a_1=n$ and $a_{i+1}$ is the least integer which is not a sum of consecutive earlie...

L1
Number Theory
0
0
EP-361
Open

Erdős Problem #361

Let $c>0$ and $n$ be some large integer. What is the size of the largest $A\subseteq \{1,\ldots,\lfloor cn\rfloor\}$ such that $n$ is not a sum of a s...

L1
Number Theory
0
0
EP-365
Open

Erdős Problem #365

Do all pairs of consecutive powerful numbers $n$ and $n+1$ come from solutions to Pell equations? In other words, must either $n$ or $n+1$ be a square...

L1
Number Theory
0
0
EP-367
Open

Erdős Problem #367

Let $B_2(n)$ be the 2-full part of $n$ (that is, $B_2(n)=n/n'$ where $n'$ is the product of all primes that divide $n$ exactly once). Is it true that,...

L1
Number Theory
0
0
EP-368
Open

Erdős Problem #368

How large is the largest prime factor of $n(n+1)$?...

L1
Number Theory
0
0
EP-369
Open

Erdős Problem #369

Let $\epsilon>0$ and $k\geq 2$. Is it true that, for all sufficiently large $n$, there is a sequence of $k$ consecutive integers in $\{1,\ldots,n\}$ a...

L1
Number Theory
0
0
EP-371
Open

Erdős Problem #371

Let $P(n)$ denote the largest prime factor of $n$. Show that the set of $n$ with $P(n)<P(n+1)$ has density $1/2$....

L1
Number Theory
0
0
EP-373
Open

Erdős Problem #373

Show that the equation $ n! = a_1!a_2!\cdots a_k!, $ with $n-1>a_1\geq a_2\geq \cdots \geq a_k\geq 2$, has only finitely many solutions....

L1
Number Theory
0
0
EP-374
Open

Erdős Problem #374

For any $m\in \mathbb{N}$, let $F(m)$ be the minimal $k\geq 2$ (if it exists) such that there are $a_1<\cdots <a_k=m$ with $a_1!\cdots a_k!$ a square....

L1
Number Theory
0
0
EP-376
Open

Erdős Problem #376

Are there infinitely many $n$ such that $\binom{2n}{n}$ is coprime to $105$?...

L1
Number Theory
0
0
EP-377
Open

Erdős Problem #377

Is there some absolute constant $C>0$ such that $ \sum_{p\leq n}1_{p mid \binom{2n}{n}}\frac{1}{p}\leq C $ for all $n$ (where the summation is restric...

L1
Number Theory
0
0
EP-380
Open

Erdős Problem #380

We call an interval $[u,v]$ 'bad' if the greatest prime factor of $\prod_{u\leq m\leq v}m$ occurs with an exponent greater than $1$. Let $B(x)$ count ...

L1
Number Theory
0
0
EP-382
Open

Erdős Problem #382

Let $u\leq v$ be such that the largest prime dividing $\prod_{u\leq m\leq v}m$ appears with exponent at least $2$. Is it true that $v-u=v^{o(1)}$? Can...

L1
Number Theory
0
0
EP-383
Open

Erdős Problem #383

Is it true that for every $k$ there are infinitely many primes $p$ such that the largest prime divisor of $ \prod_{0\leq i\leq k}(p^2+i) $ is $p$?...

L1
Number Theory
0
0
EP-385
Open

Erdős Problem #385

Let $ F(n) = \max_{\substack{m<n\\ m\textrm{ composite}}} m+p(m), $ where $p(m)$ is the least prime divisor of $m$. Is it true that $F(n)>n$ for all s...

L1
Number Theory
0
0
EP-386
Open

Erdős Problem #386

Let $2\leq k\leq n-2$. Can $\binom{n}{k}$ be the product of consecutive primes infinitely often? For example $ \binom{21}{2}=2\cdot 3\cdot 5\cdot 7. $...

L1
Number Theory
0
0
EP-387
Open

Erdős Problem #387

Is there an absolute constant $c>0$ such that, for all $1\leq k< n$, the binomial coefficient $\binom{n}{k}$ has a divisor in $(cn,n]$?...

L1
Number Theory
0
0
EP-393
Open

Erdős Problem #393

Let $f(n)$ denote the minimal $m\geq 1$ such that $ n! = a_1\cdots a_t $ with $a_1<\cdots <a_t=a_1+m$. What is the behaviour of $f(n)$?...

L1
Number Theory
0
0
EP-394
Open

Erdős Problem #394

Let $t_k(n)$ denote the least $m$ such that $ n\mid m(m+1)(m+2)\cdots (m+k-1). $ Is it true that $ \sum_{n\leq x}t_2(n)\ll \frac{x^2}{(\log x)^c} $ fo...

L1
Number Theory
0
0
EP-396
Open

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}? $ ...

L1
Number Theory
0
0
EP-400
Open

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 ...

L1
Number Theory
0
0
EP-404
Open

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...

L1
Number Theory
0
0
EP-406
Open

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$?...

L1
Number Theory
0
0
EP-408
Open

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...

L1
Number Theory
0
0
EP-409
Open

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...

L1
Number Theory
0
0
EP-410
Open

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 \...

L1
Number Theory
0
0
EP-411
Open

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$?...

L1
Number Theory
0
0
EP-412
Open

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...

L1
Number Theory
0
0