Unsolved Problems

Showing 251-300 of 627 problems (Page 6 of 13)

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-477
Open

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

L1
Graph 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-479
Open

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

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

Erdős Problem #500

What is $\mathrm{ex}_3(n,K_4^3)$? That is, the largest number of $3$-edges which can placed on $n$ vertices so that there exists no $K_4^3$, a set of ...

L1
Graph Theory
0
0
EP-501
Open

Erdős Problem #501

For every $x\in\mathbb{R}$ let $A_x\subset \mathbb{R}$ be a bounded set with outer measure $<1$. Must there exist an infinite independent set, that is...

L1
Combinatorics
0
0
EP-503
Open

Erdős Problem #503

What is the size of the largest $A\subseteq \mathbb{R}^d$ such that every three points from $A$ determine an isosceles triangle? That is, for any thre...

L1
Combinatorics
0
0
EP-507
Open

Erdős Problem #507

Let $\alpha(n)$ be such that every set of $n$ points in the unit disk contains three points which determine a triangle of area at most $\alpha(n)$. Es...

L1
Geometry
0
0
EP-508
Open

Erdős Problem #508

What is the chromatic number of the plane? That is, what is the smallest number of colours required to colour $\mathbb{R}^2$ such that no two points o...

L1
Graph Theory
0
0
EP-509
Open

Erdős Problem #509

Let $f(z)\in\mathbb{C}[z]$ be a monic non-constant polynomial. Can the set $ \{ z\in \mathbb{C} : \lvert f(z)\rvert \leq 1\} $ be covered by a set of ...

L1
Combinatorics
0
0
EP-510
Open

Erdős Problem #510

If $A\subset \mathbb{Z}$ is a finite set of size $N$ then is there some absolute constant $c>0$ and $\theta$ such that $ \sum_{n\in A}\cos(n\theta) < ...

L1
Combinatorics
0
0
EP-513
Open

Erdős Problem #513

Let $f=\sum_{n=0}^\infty a_nz^n$ be a transcendental entire function. What is the greatest possible value of $ \liminf_{r\to \infty} \frac{\max_n\lver...

L1
Combinatorics
0
0
EP-514
Open

Erdős Problem #514

Let $f(z)$ be an entire transcendental function. Does there exist a path $L$ so that, for every $n$, $ \lvert f(z)/z^n\rvert \to \infty $ as $z\to \in...

L1
Graph Theory
0
0
EP-517
Open

Erdős Problem #517

Let $f(z)=\sum_{k=1}^\infty a_kz^{n_k}$ be an entire function (with $a_k eq 0$ for all $k\geq 1$). Is it true that if $n_k/k\to \infty$ then $f(z)$ as...

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

Erdős Problem #521

Let $(\epsilon_k)_{k\geq 0}$ be independently uniformly chosen at random from $\{-1,1\}$. If $R_n$ counts the number of real roots of $f_n(z)=\sum_{0\...

L1
Graph Theory
0
0
EP-522
Open

Erdős Problem #522

Let $f(z)=\sum_{0\leq k\leq n} \epsilon_k z^k$ be a random polynomial, where $\epsilon_k\in \{-1,1\}$ independently uniformly at random for $0\leq k\l...

L1
Graph Theory
0
0
EP-524
Open

Erdős Problem #524

For any $t\in (0,1)$ let $t=\sum_{k=1}^\infty \epsilon_k(t)2^{-k}$ (where $\epsilon_k(t)\in \{0,1\}$). What is the correct order of magnitude (for alm...

L1
Combinatorics
0
0
EP-528
Open

Erdős Problem #528

Let $f(n,k)$ count the number of self-avoiding walks of $n$ steps (beginning at the origin) in $\mathbb{Z}^k$ (i.e. those walks which do not intersect...

L1
Combinatorics
0
0
EP-529
Open

Erdős Problem #529

Let $d_k(n)$ be the expected distance from the origin after taking $n$ random steps from the origin in $\mathbb{Z}^k$ (conditional on no self intersec...

L1
Graph 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-531
Open

Erdős Problem #531

Let $F(k)$ be the minimal $N$ such that if we two-colour $\{1,\ldots,N\}$ there is a set $A$ of size $k$ such that all subset sums $\sum_{a\in S}a$ (f...

L1
Graph Theory
0
0
EP-533
Open

Erdős Problem #533

Let $\delta>0$. If $n$ is sufficiently large and $G$ is a graph on $n$ vertices with no $K_5$ and at least $\delta n^2$ edges then $G$ contains a set ...

L1
Graph 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-536
Open

Erdős Problem #536

Let $\epsilon>0$ and $N$ be sufficiently large. Is it true that if $A\subseteq \{1,\ldots,N\}$ has size at least $\epsilon N$ then there must be disti...

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

Erdős Problem #539

Let $h(n)$ be such that, for any set $A\subseteq \mathbb{N}$ of size $n$, the set $ \left\{ \frac{a}{(a,b)}: a,b\in A\right\} $ has size at least $h(n...

L1
Combinatorics
0
0
EP-543
Open

Erdős Problem #543

Define $f(N)$ be the minimal $k$ such that the following holds: if $G$ is an abelian group of size $N$ and $A\subseteq G$ is a random set of size $k$ ...

L1
Combinatorics
0
0
EP-544
Open

Erdős Problem #544

Show that $ R(3,k+1)-R(3,k)\to\infty $ as $k\to \infty$. Similarly, prove or disprove that $ R(3,k+1)-R(3,k)=o(k). $ ...

L1
Graph Theory
0
0
EP-545
Open

Erdős Problem #545

Let $G$ be a graph with $m$ edges and no isolated vertices. Is the Ramsey number $R(G)$ maximised when $G$ is 'as complete as possible'? That is, if $...

L1
Graph Theory
0
0
EP-550
Open

Erdős Problem #550

Let $m_1\leq\cdots\leq m_k$ and $n$ be sufficiently large. If $T$ is a tree on $n$ vertices and $G$ is the complete multipartite graph with vertex cla...

L1
Graph 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-554
Open

Erdős Problem #554

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$. Show that $ \lim_{k\to...

L1
Graph 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-557
Open

Erdős Problem #557

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$. Is it true that $ R(T;...

L1
Graph Theory
0
0
EP-558
Open

Erdős Problem #558

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 $ R(K_{s,t};...

L1
Graph Theory
0
0
EP-560
Open

Erdős Problem #560

Let $\hat{R}(G)$ denote the size Ramsey number, the minimal number of edges $m$ such that there is a graph $H$ with $m$ edges such that in any $2$-col...

L1
Graph Theory
0
0
EP-561
Open

Erdős Problem #561

Let $\hat{R}(G)$ denote the size Ramsey number, the minimal number of edges $m$ such that there is a graph $H$ with $m$ edges such that in any $2$-col...

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