Unsolved Problems

Showing 2001-2050 of 2084 problems (Page 41 of 42)

OPG-706
Open

Goldbach conjecture

Conjecture Every even integer greater than 2 is the sum of two primes....

L3
Number Theory
OPG-37192
Open

Are there an infinite number of lucky primes?

Conjecture If every second positive integer except 2 is remaining, then every third remaining integer except 3, then every fourth remaining integer et...

L1
Number Theory
OPG-573
Open

The Riemann Hypothesis

The zeroes of the Riemann zeta function that are inside the Critical Strip (i.e. the vertical strip of the complex plane where the real part of the co...

L3
Number Theory
OPG-1788
Open

Schanuel's Conjecture

Conjecture Given any $n$ complex numbers $z_1,...,z_n$ which are linearly independent over the rational numbers $\mathbb{Q}$, then the extension field...

L3
Number Theory
OPG-36961
Open

Distribution and upper bound of mimic numbers

Problem Let the notation $a|b$ denote " $a$ divides $b$ ". The mimic function in number theory is defined as follows [1]. Definition For any positiv...

L1
Number Theory
OPG-37255
Open

Lindelöf hypothesis

Conjecture For any $\epsilon>0$ $$\zeta\left(\frac12 + it\right) \mbox{ is }\mathcal{O}(t^\epsilon).$$ Since $\epsilon$ can be replaced by a smaller ...

L3
Number Theory
OPG-37329
Open

Euler-Mascheroni constant

Question Is Euler-Mascheroni constant an transcendental number?...

L2
Number Theory
OPG-37366
Open

Is Skewes' number e^e^e^79 an integer?

Conjecture Skewes' number $e^{e^{e^{79}}}$ is not an integer....

L1
Number Theory
OPG-55810
Open

Are all Fermat Numbers square-free?

Conjecture Are all Fermat Numbers $$ F_n = 2^{2^{n } } + 1 $$ Square-Free?...

L2
Number Theory
OPG-55812
Open

Are there only finite Fermat Primes?

Conjecture A Fermat prime is a Fermat number $$ F_n = 2^{2^n } + 1 $$ that is prime. The only known Fermat primes are F_0 =3,F_1=5,F_2=17,F_3 =257,F_...

L2
Number Theory
OPG-59976
Open

Are all Mersenne Numbers with prime exponent square-free?

Conjecture Are all Mersenne Numbers with prime exponent ${2^p-1}$ Square free?...

L2
Number Theory
OPG-59977
Open

Are there infinite number of Mersenne Primes?

Conjecture A Mersenne prime is a Mersenne number $$ M_n = 2^p - 1 $$ that is prime. Are there infinite number of Mersenne Primes?...

L3
Number Theory
OPG-155
Open

Olson's Conjecture

Conjecture If $a_1,a_2,\ldots,a_{2n-1}$ is a sequence of elements from a multiplicative group of order $n$, then there exist $1 \le j_1 < j_2 \ldots <...

L1
Number Theory
OPG-156
Open

Few subsequence sums in Z_n x Z_n

Conjecture For every $0 \le t \le n-1$, the sequence in ${\mathbb Z}_n^2$ consisting of $n-1$ copes of $(1,0)$ and $t$ copies of $(0,1)$ has the fewes...

L1
Number Theory
OPG-337
Open

Gao's theorem for nonabelian groups

For every finite multiplicative group $G$, let $s(G)$ ( $s'(G)$ ) denote the smallest integer $m$ so that every sequence of $m$ elements of $G$ has a ...

L1
Number Theory
OPG-414
Open

Sets with distinct subset sums

Say that a set $S \subseteq {\mathbb Z}$ has distinct subset sums if distinct subsets of $S$ have distinct sums. Conjecture There exists a fixed cons...

L2
Number Theory
OPG-432
Open

The 3n+1 conjecture

Conjecture Let $f(n) = 3n+1$ if $n$ is odd and $\frac{n}{2}$ if $n$ is even. Let $f(1) = 1$. Assume we start with some number $n$ and repeatedly take ...

L3
Number Theory
OPG-491
Open

Odd incongruent covering systems

Conjecture There is no covering system whose moduli are odd, distinct, and greater than 1....

L2
Number Theory
OPG-493
Open

Covering systems with big moduli

Problem Does for every integer $N$ exist a covering system with all moduli distinct and at least equal to~ $N$?...

L1
Number Theory
OPG-506
Open

Divisibility of central binomial coefficients

Problem (1) Prove that there exist infinitely many positive integers $n$ such that $$\gcd({2n\choose n}, 3\cdot 5\cdot 7) = 1.$$ Problem (2) Prove th...

L1
Number Theory
OPG-563
Open

Davenport's constant

For a finite (additive) abelian group $G$, the Davenport constant of $G$, denoted $s(G)$, is the smallest integer $t$ so that every sequence of elemen...

L2
Number Theory
OPG-655
Open

Snevily's conjecture

Conjecture Let $G$ be an abelian group of odd order and let $A,B \subseteq G$ satisfy $|A| = |B| = k$. Then the elements of $A$ and $B$ may be ordered...

L2
Number Theory
OPG-17958
Open

Frobenius number of four or more integers

Problem Find an explicit formula for Frobenius number $g(a_1, a_2, \dots, a_n)$ of co-prime positive integers $a_1, a_2, \dots, a_n$ for $n\geq 4$....

L1
Number Theory
OPG-60034
Open

Singmaster's conjecture

Conjecture There is a finite upper bound on the multiplicities of entries in Pascal's triangle, other than the number $1$. The number $2$ appears onc...

L1
Number Theory
OPG-508
Open

A sextic counterexample to Euler's sum of powers conjecture

Problem Find six positive integers $x_1, x_2, \dots, x_6$ such that $$x_1^6 + x_2^6 + x_3^6 + x_4^6 + x_5^6 = x_6^6$$ or prove that such integers do n...

L1
Number Theory
OPG-511
Open

Counterexamples to the Baillie-PSW primality test

Problem (1) Find a counterexample to Baillie-PSW primality test or prove that there is no one. Problem (2) Find a composite $n\equiv 3$ or $7\pmod{10...

L1
Number Theory
OPG-822
Open

Wall-Sun-Sun primes and Fibonacci divisibility

Conjecture For any prime $p$, there exists a Fibonacci number divisible by $p$ exactly once. Equivalently: Conjecture For any prime $p>5$, $p^2$ doe...

L1
Number Theory
OPG-16570
Open

Magic square of squares

Question Does there exist a $3\times 3$ magic square composed of distinct perfect squares?...

L1
Number Theory
OPG-37221
Open

Perfect cuboid

Conjecture Does a perfect cuboid exist?...

L1
Number Theory
OPG-60052
Open

KPZ Universality Conjecture

Conjecture Formulate a central limit theorem for the KPZ universality class....

L2
Probability
OPG-36887
Open

Sums of independent random variables with unbounded variance

Conjecture If $X_1, \dotsc, X_n \geq 0$ are independent random variables with $\mathbb{E}[X_i] \leq \mu$, then $$\mathrm{Pr} \left( \sum X_i - \mathbb...

L1
Computer Science
OPG-661
Open

P vs. NP

Problem Is P = NP?...

L3
Computer Science
OPG-36311
Open

Exponential Algorithms for Knapsack

Conjecture The famous 0-1 Knapsack problem is: Given $a_{1},a_{2},\dots,a_{n}$ and $b$ integers, determine whether or not there are $0-1$ values $x_{...

L1
Computer Science
OPG-445
Open

The robustness of the tensor product

Problem Given two codes $R,C$, their Tensor Product $R \otimes C$ is the code that consists of the matrices whose rows are codewords of $R$ and whose ...

L2
Computer Science
OPG-163
Open

Subset-sums equality (pigeonhole version)

Problem Let $a_1,a_2,\ldots,a_n$ be natural numbers with $\sum_{i=1}^n a_i < 2^n - 1$. It follows from the pigeon-hole principle that there exist dist...

L2
Computer Science
OPG-467
Open

Complexity of square-root sum

Question What is the complexity of the following problem? Given $a_1,\dots,a_n; k$, determine whether or not $\sum_i \sqrt{a_i} \leq k.$...

L1
Computer Science
OPG-474
Open

Linear-size circuits for stable $0,1 < 2$ sorting?

Problem Can $O(n)$-size circuits compute the function $f$ on $\{0,1,2\}^*$ defined inductively by $f(\lambda) = \lambda$, $f(0x) = 0f(x)$, $f(1x) = 1f...

L1
Computer Science
OPG-2150
Open

Discrete Logarithm Problem

If $p$ is prime and $g,h \in {\mathbb Z}_p^*$, we write $\log_g(h) = n$ if $n \in {\mathbb Z}$ satisfies $g^n = h$. The problem of finding such an int...

L2
Computer Science
OPG-36892
Open

P vs. PSPACE

Problem Is there a problem that can be computed by a Turing machine in polynomial space and unbounded time but not in polynomial time? More formally, ...

L3
Computer Science
OPG-59968
Open

One-way functions exist

Conjecture One-way functions exist....

L3
Computer Science
OPG-454
Open

Unconditional derandomization of Arthur-Merlin games

Problem Prove unconditionally that $\mathcal{AM}$ $\subseteq$ $\Sigma_2$....

L2
Computer Science
OPG-51618
Open

P vs. BPP

Conjecture Can all problems that can be computed by a probabilistic Turing machine (with error probability < 1/3) in polynomial time be solved by a de...

L2
Computer Science
OPG-36884
Open

Refuting random 3SAT-instances on $O(n)$ clauses (weak form)

Conjecture For every rational $\epsilon > 0$ and every rational $\Delta$, there is no polynomial-time algorithm for the following problem. Given is a...

L2
Computer Science
OPG-751
Open

S(S(f)) = S(f) for reloids

Question $S(S(f)) = S(f)$ for every endo-reloid $f$?...

L1
Topology
OPG-757
Open

Inscribed Square Problem

Conjecture Does every Jordan curve have 4 points on it which form the vertices of a square?...

L1
Topology
OPG-1783
Open

Rank vs. Genus

Question Is there a hyperbolic 3-manifold whose fundamental group rank is strictly less than its Heegaard genus? How much can the two differ by?...

L2
Topology
OPG-37123
Open

Smooth 4-dimensional Schoenflies problem

Problem Let $M$ be a $3$-dimensional smooth submanifold of $S^4$, $M$ diffeomorphic to $S^3$. By the Jordan-Brouwer separation theorem, $M$ separates ...

L3
Topology
OPG-37125
Open

Smooth 4-dimensional Poincare conjecture

Conjecture If a $4$-manifold has the homotopy type of the $4$-sphere $S^4$, is it diffeomorphic to $S^4$?...

L3
Topology
OPG-37129
Open

Slice-ribbon problem

Conjecture Given a knot in $S^3$ which is slice, is it a ribbon knot?...

L3
Topology
OPG-37131
Open

Realisation problem for the space of knots in the 3-sphere

Problem Given a link $L$ in $S^3$, let the symmetry group of $L$ be denoted $Sym(L) = \pi_0 Diff(S^3,L)$ ie: isotopy classes of diffeomorphisms of $S^...

L1
Topology