Unsolved Problems

Showing 351-400 of 632 problems (Page 8 of 13)

EP-642
Open

Erdős Problem #642

Let $f(n)$ be the maximal number of edges in a graph on $n$ vertices such that all cycles have more vertices than diagonals. Is it true that $f(n)\ll ...

L1
Graph Theory
0
0
EP-643
Open

Erdős Problem #643

Let $f(n;t)$ be minimal such that if a $t$-uniform hypergraph on $n$ vertices contains at least $f(n;t)$ edges then there must be four edges $A,B,C,D$...

L1
Graph Theory
0
0
EP-644
Open

Erdős Problem #644

Let $f(k,r)$ be minimal such that if $A_1,A_2,\ldots$ is a family of sets, all of size $k$, such that for every collection of $r$ of the $A_is$ there ...

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

Erdős Problem #652

Let $x_1,\ldots,x_n\in \mathbb{R}^2$ and let $R(x_i)=\#\{ \lvert x_j-x_i\rvert : j eq i\}$, where the points are ordered such that $ R(x_1)\leq \cdots...

L1
Geometry
0
0
EP-653
Open

Erdős Problem #653

Let $x_1,\ldots,x_n\in \mathbb{R}^2$ and let $R(x_i)=\#\{ \lvert x_j-x_i\rvert : j eq i\}$, where the points are ordered such that $ R(x_1)\leq \cdots...

L1
Geometry
0
0
EP-654
Open

Erdős Problem #654

Let $x_1,\ldots,x_n\in \mathbb{R}^2$ with no four points on a circle. Must there exist some $x_i$ with at least $(1-o(1))n$ distinct distances to othe...

L1
Combinatorics
0
0
EP-655
Open

Erdős Problem #655

Let $x_1,\ldots,x_n\in \mathbb{R}^2$ be such that no circle whose centre is one of the $x_i$ contains three other points. Are there at least $ (1+c)\f...

L1
Geometry
0
0
EP-657
Open

Erdős Problem #657

Is it true that if $A\subset \mathbb{R}^2$ is a set of $n$ points such that every subset of $3$ points determines $3$ distinct distances (i.e. $A$ has...

L1
Combinatorics
0
0
EP-660
Open

Erdős Problem #660

Let $x_1,\ldots,x_n\in \mathbb{R}^3$ be the vertices of a convex polyhedron. Are there at least $ (1-o(1))\frac{n}{2} $ many distinct distances betwee...

L1
Graph Theory
0
0
EP-661
Open

Erdős Problem #661

Are there, for all large $n$, some points $x_1,\ldots,x_n,y_1,\ldots,y_n\in \mathbb{R}^2$ such that the number of distinct distances $d(x_i,y_j)$ is $...

L1
Geometry
0
0
EP-662
Open

Erdős Problem #662

Consider the triangular lattice with minimal distance between two points $1$. Denote by $f(t)$ the number of distances from any points $\leq t$. For e...

L1
Geometry
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-668
Open

Erdős Problem #668

Is it true that the number of incongruent sets of $n$ points in $\mathbb{R}^2$ which maximise the number of unit distances tends to infinity as $n\to\...

L1
Graph Theory
0
0
EP-669
Open

Erdős Problem #669

Let $F_k(n)$ be minimal such that for any $n$ points in $\mathbb{R}^2$ there exist at most $F_k(n)$ many distinct lines passing through at least $k$ o...

L1
Geometry
0
0
EP-670
Open

Erdős Problem #670

Let $A\subseteq \mathbb{R}^d$ be a set of $n$ points such that all pairwise distances differ by at least $1$. Is the diameter of $A$ at least $(1+o(1)...

L1
Combinatorics
0
0
EP-671
Open

Erdős Problem #671

Given $a_{i}^n\in [-1,1]$ for all $1\leq i\leq n<\infty$ we define $p_{i}^n$ as the unique polynomial of degree $n-1$ such that $p_{i}^n(a_{i}^n)=1$ a...

L1
Graph 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
EP-677
Open

Erdős Problem #677

Let $M(n,k)=[n+1,\ldots,n+k]$ be the least common multiple of $\{n+1,\ldots,n+k\}$. Is it true that for all $m\geq n+k$ $ M(n,k) eq M(m,k)? $ ...

L1
Number Theory
0
0
EP-679
Open

Erdős Problem #679

Let $\epsilon>0$ and $\omega(n)$ count the number of distinct prime factors of $n$. Are there infinitely many values of $n$ such that $ \omega(n-k) < ...

L1
Number Theory
0
0
EP-680
Open

Erdős Problem #680

Is it true that, for all sufficiently large $n$, there exists some $k$ such that $ p(n+k)>k^2+1, $ where $p(m)$ denotes the least prime factor of $m$?...

L1
Number Theory
0
0
EP-681
Open

Erdős Problem #681

Is it true that for all large $n$ there exists $k$ such that $n+k$ is composite and $ p(n+k)>k^2, $ where $p(m)$ is the least prime factor of $m$?...

L1
Number Theory
0
0
EP-683
Open

Erdős Problem #683

Is it true that for every $1\leq k\leq n$ the largest prime divisor of $\binom{n}{k}$, say $P(\binom{n}{k})$, satisfies $ P\left(\binom{n}{k}\right)\g...

L1
Number Theory
0
0
EP-684
Open

Erdős Problem #684

For $0\leq k\leq n$ write $ \binom{n}{k} = uv $ where the only primes dividing $u$ are in $[2,k]$ and the only primes dividing $v$ are in $(k,n]$. Let...

L1
Number Theory
0
0
EP-685
Open

Erdős Problem #685

Let $\epsilon>0$ and $n$ be large depending on $\epsilon$. Is it true that for all $n^\epsilon<k\leq n^{1-\epsilon}$ the number of distinct prime divi...

L1
Number Theory
0
0
EP-686
Open

Erdős Problem #686

Can every integer $N\geq 2$ be written as $ N=\frac{\prod_{1\leq i\leq k}(m+i)}{\prod_{1\leq i\leq k}(n+i)} $ for some $k\geq 2$ and $m\geq n+k$?...

L1
Number Theory
0
0
EP-687
Open

Erdős Problem #687

Let $Y(x)$ be the maximal $y$ such that there exists a choice of congruence classes $a_p$ for all primes $p\leq x$ such that every integer in $[1,y]$ ...

L1
Number Theory
0
0
EP-688
Open

Erdős Problem #688

Define $\epsilon_n$ to be maximal such that there exists some choice of congruence class $a_p$ for all primes $n^{\epsilon_n}<p\leq n$ such that every...

L1
Number Theory
0
0
EP-689
Open

Erdős Problem #689

Let $n$ be sufficiently large. Is there some choice of congruence class $a_p$ for all primes $2\leq p\leq n$ such that every integer in $[1,n]$ satisf...

L1
Number Theory
0
0
EP-690
Open

Erdős Problem #690

Let $d_k(p)$ be the density of those integers whose $k$th smallest prime factor is $p$ (i.e. if $p_1<p_2<\cdots$ are the primes dividing $n$ then $p_k...

L1
Number Theory
0
0
EP-691
Open

Erdős Problem #691

Given $A\subseteq \mathbb{N}$ let $M_A=\{ n \geq 1 : a\mid n\textrm{ for some }a\in A\}$ be the set of multiples of $A$. Find a necessary and sufficie...

L1
Number Theory
0
0
EP-693
Open

Erdős Problem #693

Let $k\geq 2$ and $n$ be sufficiently large depending on $k$. Let $A=\{a_1<a_2<\cdots \}$ be the set of those integers in $[n,n^k]$ which have a divis...

L1
Number Theory
0
0
EP-694
Open

Erdős Problem #694

Let $f_{\max}(n)$ be the largest $m$ such that $\phi(m)=n$, and $f_{\min}(n)$ be the smallest such $m$, where $\phi$ is Euler's totient function. Inve...

L1
Number Theory
0
0
EP-695
Open

Erdős Problem #695

Let $p_1<p_2<\cdots$ be a sequence of primes such that $p_{i+1}\equiv 1\pmod{p_i}$. Is it true that $ \lim_k p_k^{1/k}=\infty? $ Does there exist such...

L1
Number Theory
0
0
EP-696
Open

Erdős Problem #696

Let $h(n)$ be the largest $\ell$ such that there is a sequence of primes $p_1<\cdots < p_\ell$ all dividing $n$ with $p_{i+1}\equiv 1\pmod{p_i}$. Let ...

L1
Number Theory
0
0
EP-700
Open

Erdős Problem #700

Let $ f(n)=\min_{1<k\leq n/2}\textrm{gcd}\left(n,\binom{n}{k}\right). $ {UL} {LI}Characterise those composite $n$ such that $f(n)=n/P(n)$, where $P(n)...

L1
Number Theory
0
0
EP-701
Open

Erdős Problem #701

Let $\mathcal{F}$ be a family of sets closed under taking subsets (i.e. if $B\subseteq A\in\mathcal{F}$ then $B\in \mathcal{F}$). There exists some el...

L1
Graph Theory
0
0
EP-704
Open

Erdős Problem #704

Let $G_n$ be the unit distance graph in $\mathbb{R}^n$, with two vertices joined by an edge if and only if the distance between them is $1$. Estimate ...

L1
Graph Theory
0
0
EP-705
Open

Erdős Problem #705

Let $G$ be a finite unit distance graph in $\mathbb{R}^2$ (i.e. the vertices are a finite collection of points in $\mathbb{R}^2$ and there is an edge ...

L1
Graph Theory
0
0
EP-706
Open

Erdős Problem #706

Let $L(r)$ be such that if $G$ is a graph formed by taking a finite set of points $P$ in $\mathbb{R}^2$ and some set $A\subset (0,\infty)$ of size $r$...

L1
Graph Theory
0
0
EP-708
Open

Erdős Problem #708

Let $g(n)$ be minimal such that for any $A\subseteq [2,\infty)\cap \mathbb{N}$ with $\lvert A\rvert =n$ and any set $I$ of $\max(A)$ consecutive integ...

L1
Number Theory
0
0
EP-709
Open

Erdős Problem #709

Let $f(n)$ be minimal such that, for any $A=\{a_1,\ldots,a_n\}\subseteq [2,\infty)\cap\mathbb{N}$ of size $n$, in any interval $I$ of $f(n)\max(A)$ co...

L1
Number Theory
0
0
EP-710
Open

Erdős Problem #710

Let $f(n)$ be minimal such that in $(n,n+f(n))$ there exist distinct integers $a_1,\ldots,a_n$ such that $k\mid a_k$ for all $1\leq k\leq n$. Obtain a...

L1
Number Theory
0
0
EP-711
Open

Erdős Problem #711

Let $f(n,m)$ be minimal such that in $(m,m+f(n,m))$ there exist distinct integers $a_1,\ldots,a_n$ such that $k\mid a_k$ for all $1\leq k\leq n$. Prov...

L1
Number Theory
0
0
EP-712
Open

Erdős Problem #712

Determine, for any $k>r>2$, the value of $ \frac{\mathrm{ex}_r(n,K_k^r)}{\binom{n}{r}}, $ where $\mathrm{ex}_r(n,K_k^r)$ is the largest number of $r$-...

L1
Graph Theory
0
0
EP-713
Open

Erdős Problem #713

Is it true that, for every bipartite graph $G$, there exists some $\alpha\in [1,2)$ and $c>0$ such that $ \mathrm{ex}(n;G)\sim cn^\alpha? $ Must $\alp...

L1
Number Theory
0
0
EP-714
Open

Erdős Problem #714

Is it true that $ \mathrm{ex}(n; K_{r,r}) \gg n^{2-1/r}? $ ...

L1
Graph Theory
0
0