Unsolved Problems

Showing 651-700 of 1146 problems (Page 14 of 23)

EP-260
Open

Erdős Problem #260

Let $a_1<a_2<\cdots$ be an increasing sequence such that $a_n/n\to \infty$. Is the sum $ \sum_n \frac{a_n}{2^{a_n}} $ irrational?...

L1
Combinatorics
0
0
EP-261
Open

Erdős Problem #261

Are there infinitely many $n$ such that there exists some $t\geq 2$ and distinct integers $a_1,\ldots,a_t\geq 1$ such that $ \frac{n}{2^n}=\sum_{1\leq...

L1
Number Theory
0
0
EP-263
Open

Erdős Problem #263

Let $a_n$ be a sequence of positive integers such that for every sequence of positive integers $b_n$ with $b_n/a_n\to 1$ the sum $ \sum\frac{1}{b_n} $...

L1
Number Theory
0
0
EP-264
Open

Erdős Problem #264

Let $a_n$ be a sequence of positive integers such that for every bounded sequence of integers $b_n$ (with $a_n+b_n eq 0$ and $b_n eq 0$ for all $n$) t...

L1
Number Theory
0
0
EP-265
Open

Erdős Problem #265

Let $1\leq a_1<a_2<\cdots$ be an increasing sequence of integers. How fast can $a_n\to \infty$ grow if $ \sum\frac{1}{a_n}\quad\textrm{and}\quad\sum\f...

L1
Number Theory
0
0
EP-267
Open

Erdős Problem #267

Let $F_1=F_2=1$ and $F_{n+1}=F_n+F_{n-1}$ be the Fibonacci sequence. Let $n_1<n_2<\cdots $ be an infinite sequence with $n_{k+1}/n_k \geq c>1$. Must $...

L1
Number Theory
0
0
EP-269
Open

Erdős Problem #269

Let $P$ be a finite set of primes with $\lvert P\rvert \geq 2$ and let $\{a_1<a_2<\cdots\}=\{ n\in \mathbb{N} : \textrm{if }p\mid n\textrm{ then }p\in...

L1
Number Theory
0
0
EP-271
Open

Erdős Problem #271

Let $A(n)=\{a_0<a_1<\cdots\}$ be the sequence defined by $a_0=0$ and $a_1=n$, and for $k\geq 1$ define $a_{k+1}$ as the least positive integer such th...

L1
Number Theory
0
0
EP-272
Open

Erdős Problem #272

Let $N\geq 1$. What is the largest $t$ such that there are $A_1,\ldots,A_t\subseteq \{1,\ldots,N\}$ with $A_i\cap A_j$ a non-empty arithmetic progress...

L1
Number Theory
0
0
EP-273
Open

Erdős Problem #273

Is there a covering system all of whose moduli are of the form $p-1$ for some primes $p\geq 5$?...

L1
Number Theory
0
0
EP-274
Open

Erdős Problem #274

If $G$ is a group then can there exist an exact covering of $G$ by more than one cosets of different sizes? (i.e. each element is contained in exactly...

L1
Number Theory
0
0
EP-276
Open

Erdős Problem #276

Is there an infinite Lucas sequence $a_0,a_1,\ldots$ where $a_{n+2}=a_{n+1}+a_n$ for $n\geq 0$ such that all $a_k$ are composite, and yet no integer h...

L1
Number Theory
0
0
EP-278
Open

Erdős Problem #278

Let $A=\{n_1<\cdots<n_r\}$ be a finite set of positive integers. What is the maximum density of integers covered by a suitable choice of congruences $...

L1
Number Theory
0
0
EP-279
Open

Erdős Problem #279

Let $k\geq 3$. Is there a choice of congruence classes $a_p\pmod{p}$ for every prime $p$ such that all sufficiently large integers can be written as $...

L1
Number Theory
0
0
EP-281
Open

Erdős Problem #281

Let $n_1<n_2<\cdots$ be an infinite sequence such that, for any choice of congruence classes $a_i\pmod{n_i}$, the set of integers not satisfying any o...

L1
Number Theory
0
0
EP-282
Open

Erdős Problem #282

Let $A\subseteq \mathbb{N}$ be an infinite set and consider the following greedy algorithm for a rational $x\in (0,1)$: choose the minimal $n\in A$ su...

L1
Number Theory
0
0
EP-283
Open

Erdős Problem #283

Let $p:\mathbb{Z}\to \mathbb{Z}$ be a polynomial whose leading coefficient is positive and such that there exists no $d\geq 2$ with $d\mid p(n)$ for a...

L1
Number Theory
0
0
EP-288
Open

Erdős Problem #288

Is it true that there are only finitely many pairs of intervals $I_1,I_2$ such that $ \sum_{n_1\in I_1}\frac{1}{n_1}+\sum_{n_2\in I_2}\frac{1}{n_2}\in...

L1
Combinatorics
0
0
EP-289
Open

Erdős Problem #289

Is it true that, for all sufficiently large $k$, there exist finite intervals $I_1,\ldots,I_k\subset \mathbb{N}$, distinct, not overlapping or adjacen...

L1
Graph Theory
0
0
EP-291
Open

Erdős Problem #291

Let $n\geq 1$ and define $L_n$ to be the least common multiple of $\{1,\ldots,n\}$ and $a_n$ by $ \sum_{1\leq k\leq n}\frac{1}{k}=\frac{a_n}{L_n}. $ I...

L1
Number Theory
0
0
EP-293
Open

Erdős Problem #293

Let $k\geq 1$ and let $v(k)$ be the minimal integer which does not appear as some $n_i$ in a solution to $ 1=\frac{1}{n_1}+\cdots+\frac{1}{n_k} $ with...

L1
Number Theory
0
0
EP-295
Open

Erdős Problem #295

Let $N\geq 1$ and let $k(N)$ denote the smallest $k$ such that there exist $N\leq n_1<\cdots <n_k$ with $ 1=\frac{1}{n_1}+\cdots+\frac{1}{n_k}. $ Is i...

L1
Combinatorics
0
0
EP-301
Open

Erdős Problem #301

Let $f(N)$ be the size of the largest $A\subseteq \{1,\ldots,N\}$ such that there are no solutions to $ \frac{1}{a}= \frac{1}{b_1}+\cdots+\frac{1}{b_k...

L1
Number Theory
0
0
EP-302
Open

Erdős Problem #302

Let $f(N)$ be the size of the largest $A\subseteq \{1,\ldots,N\}$ such that there are no solutions to $ \frac{1}{a}= \frac{1}{b}+\frac{1}{c} $ with di...

L1
Number Theory
0
0
EP-304
Open

Erdős Problem #304

For integers $1\leq a<b$ let $N(a,b)$ denote the minimal $k$ such that there exist integers $1<n_1<\cdots<n_k$ with $ \frac{a}{b}=\frac{1}{n_1}+\cdots...

L1
Number Theory
0
0
EP-306
Open

Erdős Problem #306

Let $a/b\in \mathbb{Q}_{>0}$ with $b$ squarefree. Are there integers $1<n_1<\cdots<n_k$, each the product of two distinct primes, such that $ \frac{a}...

L1
Number Theory
0
0
EP-311
Open

Erdős Problem #311

Let $\delta(N)$ be the minimal non-zero value of $\lvert 1-\sum_{n\in A}\frac{1}{n}\rvert$ as $A$ ranges over all subsets of $\{1,\ldots,N\}$. Is it t...

L1
Graph Theory
0
0
EP-312
Open

Erdős Problem #312

Does there exist some $c>0$ such that, for any $K>1$, whenever $A$ is a sufficiently large finite multiset of positive integers with $\sum_{n\in A}\fr...

L1
Number Theory
0
0
EP-313
Open

Erdős Problem #313

Are there infinitely many solutions to $ \frac{1}{p_1}+\cdots+\frac{1}{p_k}=1-\frac{1}{m}, $ where $m\geq 2$ is an integer and $p_1<\cdots<p_k$ are di...

L1
Number Theory
0
0
EP-317
Open

Erdős Problem #317

Is there some constant $c>0$ such that for every $n\geq 1$ there exists some $\delta_k\in \{-1,0,1\}$ for $1\leq k\leq n$ with $ 0< \left\lvert \sum_{...

L1
Combinatorics
0
0
EP-318
Open

Erdős Problem #318

Let $A\subseteq \mathbb{N}$ be an infinite arithmetic progression and $f:A\to \{-1,1\}$ be a non-constant function. Must there exist a finite non-empt...

L1
Graph Theory
0
0
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-320
Open

Erdős Problem #320

Let $S(N)$ count the number of distinct sums of the form $\sum_{n\in A}\frac{1}{n}$ for $A\subseteq \{1,\ldots,N\}$. Estimate $S(N)$....

L1
Combinatorics
0
0
EP-321
Open

Erdős Problem #321

What is the size of the largest $A\subseteq \{1,\ldots,N\}$ such that all sums $\sum_{n\in S}\frac{1}{n}$ are distinct for $S\subseteq A$?...

L1
Combinatorics
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-326
Open

Erdős Problem #326

Let $A\subset \mathbb{N}$ be an additive basis of order $2$. Must there exist $B=\{b_1<b_2<\cdots\}\subseteq A$ which is also a basis such that $ \lim...

L1
Combinatorics
0
0
EP-327
Open

Erdős Problem #327

Suppose $A\subseteq \{1,\ldots,N\}$ is such that if $a,b\in A$ and $a eq b$ then $a+b mid ab$. Can $A$ be 'substantially more' than the odd numbers? W...

L1
Combinatorics
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-335
Open

Erdős Problem #335

Let $d(A)$ denote the density of $A\subseteq \mathbb{N}$. Characterise those $A,B\subseteq \mathbb{N}$ with positive density such that $ d(A+B)=d(A)+d...

L1
Combinatorics
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