Unsolved Problems

Showing 151-200 of 350 problems (Page 4 of 7)

EP-428
Open

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

L1
Number Theory
0
0
EP-430
Open

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

L1
Number Theory
0
0
EP-431
Open

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

L1
Number Theory
0
0
EP-432
Open

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

L1
Number Theory
0
0
EP-436
Open

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

L1
Number Theory
0
0
EP-445
Open

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

L1
Number Theory
0
0
EP-450
Open

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

L1
Number Theory
0
0
EP-451
Open

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

L1
Number Theory
0
0
EP-452
Open

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

L1
Number Theory
0
0
EP-454
Open

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

L1
Number Theory
0
0
EP-455
Open

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

L1
Number Theory
0
0
EP-456
Open

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

L1
Number Theory
0
0
EP-457
Open

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

L1
Number Theory
0
0
EP-460
Open

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

L1
Number Theory
0
0
EP-461
Open

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

L1
Number Theory
0
0
EP-462
Open

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

L1
Number Theory
0
0
EP-463
Open

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

L1
Number Theory
0
0
EP-467
Open

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

L1
Number Theory
0
0
EP-468
Open

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

L1
Number Theory
0
0
EP-469
Open

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

L1
Number Theory
0
0
EP-470
Open

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

L1
Number Theory
0
0
EP-472
Open

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

L1
Number Theory
0
0
EP-478
Open

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

L1
Number Theory
0
0
EP-483
Open

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

L1
Number Theory
0
0
EP-486
Open

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

L1
Number Theory
0
0
EP-488
Open

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

L1
Number Theory
0
0
EP-489
Open

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

L1
Number Theory
0
0
EP-495
Open

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

L1
Number Theory
0
0
EP-520
Open

Erdős Problem #520

Let $f$ be a Rademacher multiplicative function: a random $\{-1,0,1\}$-valued multiplicative function, where for each prime $p$ we independently choos...

L1
Number Theory
0
0
EP-530
Open

Erdős Problem #530

Let $\ell(N)$ be maximal such that in any finite set $A\subset \mathbb{R}$ of size $N$ there exists a Sidon subset $S$ of size $\ell(N)$ (i.e. the onl...

L1
Number Theory
0
0
EP-535
Open

Erdős Problem #535

Let $r\geq 3$, and let $f_r(N)$ denote the size of the largest subset of $\{1,\ldots,N\}$ such that no subset of size $r$ has the same pairwise greate...

L1
Number Theory
0
0
EP-538
Open

Erdős Problem #538

Let $r\geq 2$ and suppose that $A\subseteq\{1,\ldots,N\}$ is such that, for any $m$, there are at most $r$ solutions to $m=pa$ where $p$ is prime and ...

L1
Number Theory
0
0
EP-552
Open

Erdős Problem #552

Determine the Ramsey number $ R(C_4,S_n), $ where $S_n=K_{1,n}$ is the star on $n+1$ vertices. In particular, is it true that, for any $c>0$, there ar...

L1
Number Theory
0
0
EP-555
Open

Erdős Problem #555

Let $R(G;k)$ denote the minimal $m$ such that if the edges of $K_m$ are $k$-coloured then there is a monochromatic copy of $G$. Determine the value of...

L1
Number Theory
0
0
EP-562
Open

Erdős Problem #562

Let $R_r(n)$ denote the $r$-uniform hypergraph Ramsey number: the minimal $m$ such that if we $2$-colour all edges of the complete $r$-uniform hypergr...

L1
Number Theory
0
0
EP-564
Open

Erdős Problem #564

Let $R_3(n)$ be the minimal $m$ such that if the edges of the $3$-uniform hypergraph on $m$ vertices are $2$-coloured then there is a monochromatic co...

L1
Number Theory
0
0
EP-572
Open

Erdős Problem #572

Show that for $k\geq 3$ $ \mathrm{ex}(n;C_{2k})\gg n^{1+\frac{1}{k}}. $ ...

L1
Number Theory
0
0
EP-591
Open

Erdős Problem #591

Let $\alpha$ be the infinite ordinal $\omega^{\omega^2}$. Is it true that in any red/blue colouring of the edges of $K_\alpha$ there is either a red $...

L1
Number Theory
0
0
EP-592
Open

Erdős Problem #592

Determine which countable ordinals $\beta$ have the property that, if $\alpha=\omega^{^\beta}$, then in any red/blue colouring of the edges of $K_\alp...

L1
Number Theory
0
0
EP-595
Open

Erdős Problem #595

Is there an infinite graph $G$ which contains no $K_4$ and is not the union of countably many triangle-free graphs?...

L1
Number Theory
0
0
EP-601
Open

Erdős Problem #601

For which limit ordinals $\alpha$ is it true that if $G$ is a graph with vertex set $\alpha$ then $G$ must have either an infinite path or independent...

L1
Number Theory
0
0
EP-604
Open

Erdős Problem #604

Given $n$ distinct points $A\subset\mathbb{R}^2$ must there be a point $x\in A$ such that $ \#\{ d(x,y) : y \in A\} \gg n^{1-o(1)}? $ Or even $\gg n/\...

L1
Number Theory
0
0
EP-633
Open

Erdős Problem #633

Classify those triangles which can only be cut into a square number of congruent triangles....

L1
Number Theory
0
0
EP-634
Open

Erdős Problem #634

Find all $n$ such that there is at least one triangle which can be cut into $n$ congruent triangles....

L1
Number Theory
0
0
EP-650
Open

Erdős Problem #650

Let $f(m)$ be such that if $A\subseteq \{1,\ldots,N\}$ has $\lvert A\rvert=m$ then every interval in $[1,\infty)$ of length $2N$ contains $\geq f(m)$ ...

L1
Number Theory
0
0
EP-663
Open

Erdős Problem #663

Let $k\geq 2$ and $q(n,k)$ denote the least prime which does not divide $\prod_{1\leq i\leq k}(n+i)$. Is it true that, if $k$ is fixed and $n$ is suff...

L1
Number Theory
0
0
EP-665
Open

Erdős Problem #665

A pairwise balanced design for $\{1,\ldots,n\}$ is a collection of sets $A_1,\ldots,A_m\subseteq \{1,\ldots,n\}$ such that $2\leq \lvert A_i\rvert <n$...

L1
Number Theory
0
0
EP-667
Open

Erdős Problem #667

Let $p,q\geq 1$ be fixed integers. We define $H(n)=H(N;p,q)$ to be the largest $m$ such that any graph on $n$ vertices where every set of $p$ vertices...

L1
Number Theory
0
0
EP-675
Open

Erdős Problem #675

We say that $A\subset \mathbb{N}$ has the translation property if, for every $n$, there exists some integer $t_n\geq 1$ such that, for all $1\leq a\le...

L1
Number Theory
0
0
EP-676
Open

Erdős Problem #676

Is every sufficiently large integer of the form $ ap^2+b $ for some prime $p$ and integer $a\geq 1$ and $0\leq b<p$?...

L1
Number Theory
0
0