Unsolved Problems

Showing 451-497 of 497 problems (Page 10 of 10)

EP-971
Open

Erdős Problem #971

Let $p(a,d)$ be the least prime congruent to $a\pmod{d}$. Does there exist a constant $c>0$ such that, for all large $d$, $ p(a,d) > (1+c)\phi(d)\log ...

L1
Number Theory
0
0
EP-972
Open

Erdős Problem #972

Let $\alpha>1$ be irrational. Are there infinitely many primes $p$ such that $\lfloor p\alpha\rfloor$ is also prime?...

L3
Number Theory
0
0
EP-975
Open

Erdős Problem #975

Let $f\in \mathbb{Z}[x]$ be an irreducible non-constant polynomial such that $f(n)\geq 1$ for all large $n\in\mathbb{N}$. Does there exist a constant ...

L1
Number Theory
0
0
EP-976
Open

Erdős Problem #976

Let $f\in \mathbb{Z}[x]$ be an irreducible polynomial of degree $d\geq 2$. Let $F_f(n)$ be maximal such that there exists $1\leq m\leq n$ with $f(m)$ ...

L1
Number Theory
0
0
EP-978
Open

Erdős Problem #978

Let $f\in \mathbb{Z}[x]$ be an irreducible polynomial of degree $k>2$ (and suppose that $k eq 2^l$ for any $l\geq 1$) such that the leading coefficien...

L1
Number Theory
0
0
EP-979
Open

Erdős Problem #979

Let $k\geq 2$, and let $f_k(n)$ count the number of solutions to $ n=p_1^k+\cdots+p_k^k, $ where the $p_i$ are prime numbers. Is it true that $\limsup...

L1
Number Theory
0
0
EP-983
Open

Erdős Problem #983

Let $n\geq 2$ and $\pi(n)<k\leq n$. Let $f(k,n)$ be the smallest integer $r$ such that in any $A\subseteq \{1,\ldots,n\}$ of size $\lvert A\rvert=k$ t...

L1
Number Theory
0
0
EP-985
Open

Erdős Problem #985

Is it true that, for every prime $p$, there is a prime $q<p$ which is a primitive root modulo $p$?...

L1
Number Theory
0
0
EP-987
Open

Erdős Problem #987

Let $x_1,x_2,\ldots \in (0,1)$ be an infinite sequence and let $ A_k=\limsup_{n\to \infty}\left\lvert \sum_{j\leq n} e(kx_j)\right\rvert, $ where $e(x...

L1
Number Theory
0
0
EP-992
Open

Erdős Problem #992

Let $x_1<x_2<\cdots$ be an infinite sequence of integers. Is it true that, for almost all $\alpha \in [0,1]$, the discrepancy $ D(N)=\max_{I\subseteq ...

L1
Number Theory
0
0
EP-995
Open

Erdős Problem #995

Let $n_1<n_2<\cdots$ be a lacunary sequence of integers and $f\in L^2([0,1])$. Estimate the growth of, for almost all $\alpha$, $ \sum_{1\leq k\leq N}...

L1
Number Theory
0
0
EP-996
Open

Erdős Problem #996

Let $n_1<n_2<\cdots$ be a lacunary sequence of integers, and let $f\in L^2([0,1])$. Let $f_n$ be the $n$th partial sum of the Fourier series of $f(x)$...

L1
Number Theory
0
0
EP-997
Open

Erdős Problem #997

Call $x_1,x_2,\ldots \in (0,1)$ well-distributed if, for every $\epsilon>0$, if $k$ is sufficiently large then, for all $n>0$ and intervals $I\subsete...

L1
Number Theory
0
0
EP-1003
Open

Erdős Problem #1003

Are there infinitely many solutions to $\phi(n)=\phi(n+1)$, where $\phi$ is the Euler totient function?...

L1
Number Theory
0
0
EP-1004
Open

Erdős Problem #1004

Let $c>0$. If $x$ is sufficiently large then does there exist $n\leq x$ such that the values of $\phi(n+k)$ are all distinct for $1\leq k\leq (\log x)...

L1
Number Theory
0
0
EP-1005
Open

Erdős Problem #1005

Let $\frac{a_1}{b_1},\frac{a_2}{b_2},\ldots$ be the Farey fractions of order $n\geq 4$. Let $f(n)$ be the largest integer such that if $1\leq k<l\leq ...

L1
Number Theory
0
0
EP-1017
Open

Erdős Problem #1017

Let $f(n,k)$ be such that every graph on $n$ vertices and $k$ edges can be partitioned into at most $f(n,k)$ edge-disjoint complete graphs. Estimate $...

L1
Number Theory
0
0
EP-1049
Open

Erdős Problem #1049

Let $t>1$ be a rational number. Is $ \sum_{n=1}^\infty\frac{1}{t^n-1}=\sum_{n=1}^\infty \frac{\tau(n)}{t^n} $ irrational, where $\tau(n)$ counts the d...

L1
Number Theory
0
0
EP-1051
Open

Erdős Problem #1051

Is it true that if $a_1<a_2<\cdots$ is a sequence of integers with $ \liminf a_n^{1/2^n}>1 $ then $ \sum_{n=1}^\infty \frac{1}{a_na_{n+1}} $ is irrati...

L1
Number Theory
0
0
EP-1052
Open

Erdős Problem #1052

A unitary divisor of $n$ is $d\mid n$ such that $(d,n/d)=1$. A number $n\geq 1$ is a unitary perfect number if it is the sum of its unitary divisors (...

L1
Number Theory
0
0
EP-1053
Open

Erdős Problem #1053

Call a number $k$-perfect if $\sigma(n)=kn$, where $\sigma(n)$ is the sum of the divisors of $n$. Must $k=o(\log\log n)$?...

L1
Number Theory
0
0
EP-1054
Open

Erdős Problem #1054

Let $f(n)$ be the minimal integer $m$ such that $n$ is the sum of the $k$ smallest divisors of $m$ for some $k\geq 1$. Is it true that $f(n)=o(n)$? Or...

L1
Number Theory
0
0
EP-1055
Open

Erdős Problem #1055

A prime $p$ is in class $1$ if the only prime divisors of $p+1$ are $2$ or $3$. In general, a prime $p$ is in class $r$ if every prime factor of $p+1$...

L1
Number Theory
0
0
EP-1056
Open

Erdős Problem #1056

Let $k\geq 2$. Does there exist a prime $p$ and consecutive intervals $I_1,\ldots,I_k$ such that $ \prod_{n\in I_i}n \equiv 1\pmod{p} $ for all $1\leq...

L1
Number Theory
0
0
EP-1057
Open

Erdős Problem #1057

Let $C(x)$ count the number of Carmichael numbers in the interval $[1,x]$. Is it true that $C(x)=x^{1-o(1)}$?...

L1
Number Theory
0
0
EP-1059
Open

Erdős Problem #1059

Are there infinitely many primes $p$ such that $p-k!$ is composite for each $k$ such that $1\leq k!<p$?...

L1
Number Theory
0
0
EP-1060
Open

Erdős Problem #1060

Let $f(n)$ count the number of solutions to $k\sigma(k)=n$, where $\sigma(k)$ is the sum of divisors of $k$. Is it true that $f(n)\leq n^{o(\frac{1}{\...

L1
Number Theory
0
0
EP-1061
Open

Erdős Problem #1061

How many solutions are there to $ \sigma(a)+\sigma(b)=\sigma(a+b) $ with $a+b\leq x$, where $\sigma$ is the sum of divisors function? Is it $\sim cx$ ...

L1
Number Theory
0
0
EP-1065
Open

Erdős Problem #1065

Are there infinitely many primes $p$ such that $p=2^kq+1$ for some prime $q$ and $k\geq 0$? Or $p=2^k3^lq+1$?...

L1
Number Theory
0
0
EP-1072
Open

Erdős Problem #1072

For any prime $p$, let $f(p)$ be the least integer such that $f(p)!+1\equiv 0\pmod{p}$. Is it true that there are infinitely many $p$ for which $f(p)=...

L1
Number Theory
0
0
EP-1073
Open

Erdős Problem #1073

Let $A(x)$ count the number of composite $u<x$ such that $n!+1\equiv 0\pmod{u}$ for some $n$. Is it true that $A(x)\leq x^{o(1)}$?...

L1
Number Theory
0
0
EP-1074
Open

Erdős Problem #1074

Let $S$ be the set of all $m\geq 1$ such that there exists a prime $p ot\equiv 1\pmod{m}$ such that $m!+1\equiv 0\pmod{p}$. Does $ \lim \frac{\lvert S...

L1
Number Theory
0
0
EP-1084
Open

Erdős Problem #1084

Let $f_d(n)$ be minimal such that in any collection of $n$ points in $\mathbb{R}^d$, all of distance at least $1$ apart, there are at most $f_d(n)$ ma...

L1
Number Theory
0
0
EP-1093
Open

Erdős Problem #1093

For $n\geq 2k$ we define the deficiency of $\binom{n}{k}$ as follows. If $\binom{n}{k}$ is divisible by a prime $p\leq k$ then the deficiency is undef...

L1
Number Theory
0
0
EP-1094
Open

Erdős Problem #1094

For all $n\geq 2k$ the least prime factor of $\binom{n}{k}$ is $\leq \max(n/k,k)$, with only finitely many exceptions....

L1
Number Theory
0
0
EP-1095
Open

Erdős Problem #1095

Let $g(k)>k+1$ be the smallest $n$ such that all prime factors of $\binom{n}{k}$ are $>k$. Estimate $g(k)$....

L1
Number Theory
0
0
EP-1097
Open

Erdős Problem #1097

Let $A$ be a set of $n$ integers. How many distinct $d$ can occur as the common difference of a three-term arithmetic progression in $A$? Are there al...

L1
Number Theory
0
0
EP-1100
Open

Erdős Problem #1100

If $1=d_1<\cdots<d_{\tau(n)}=n$ are the divisors of $n$, then let $\tau_\perp(n)$ count the number of $i$ for which $(d_i,d_{i+1})=1$. Is it true that...

L1
Number Theory
0
0
EP-1101
Open

Erdős Problem #1101

If $u=\{u_1<u_2<\cdots\}$ is a sequence of integers such that $(u_i,u_j)=1$ for all $i eq j$ and $\sum \frac{1}{u_i}<\infty$ then let $\{a_1<a_2<\cdot...

L1
Number Theory
0
0
EP-1103
Open

Erdős Problem #1103

Let $A$ be an infinite sequence of integers such that every $n\in A+A$ is squarefree. How fast must $A$ grow?...

L1
Number Theory
0
0
EP-1106
Open

Erdős Problem #1106

Let $p(n)$ denote the partition function of $n$ and let $F(n)$ count the number of distinct prime factors of $ \prod_{1\leq k\leq n}p(k). $ Does $F(n)...

L1
Number Theory
0
0
EP-1107
Open

Erdős Problem #1107

Let $r\geq 2$. A number $n$ is $r$-powerful if for every prime $p$ which divides $n$ we have $p^r\mid n$. Is every large integer the sum of at most $r...

L1
Number Theory
0
0
EP-1109
Open

Erdős Problem #1109

Let $f(N)$ be the size of the largest subset $A\subseteq \{1,\ldots,N\}$ such that every $n\in A+A$ is squarefree. Estimate $f(N)$. In particular, is ...

L1
Number Theory
0
0
EP-1110
Open

Erdős Problem #1110

Let $p>q\geq 2$ be two coprime integers. We call $n$ representable if it is the sum of integers of the form $p^kq^l$, none of which divide each other....

L1
Number Theory
0
0
EP-1112
Open

Erdős Problem #1112

Let $1\leq d_1<d_2$ and $k\geq 3$. Does there exist an integer $r$ such that if $B=\{b_1<\cdots\}$ is a lacunary sequence of positive integers with $b...

L1
Number Theory
0
0
EP-1113
Open

Erdős Problem #1113

A positive odd integer $m$ such that none of $2^km+1$ are prime for $k\geq 0$ is called a Sierpinski number. We say that a set of primes $P$ is a cove...

L1
Number Theory
0
0
EP-1135
Open

Erdős Problem #1135

Define $f:\mathbb{N}\to \mathbb{N}$ by $f(n)=n/2$ if $n$ is even and $f(n)=\frac{3n+1}{2}$ if $n$ is odd. Given any integer $m\geq 1$ does there exist...

L5
Number Theory
0
0