specifically the field of transcendental number theory, the four exponentials conjecture is a conjecture which, given the right conditions on the exponents, would...

theorem above. The currently unproven four exponentials conjecture would also follow from Schanuel's conjecture: If z 1 , z 2 {\displaystyle z_{1},z_{2}}...

of the five exponentials theorem as well, although it as yet unproven so is known as the sharp five exponentials conjecture. This conjecture implies both...

conjecture Kelvin's conjecture Kouchnirenko's conjecture Mertens conjecture Pólya conjecture, 1919 (1958) Ragsdale conjecture Schoenflies conjecture (disproved...

unproven Schanuel's conjecture, and does not imply the six exponentials theorem nor, clearly, the still open four exponentials conjecture. The main reason...

are themselves transcendental? The four exponentials conjecture: the transcendence of at least one of four exponentials of combinations of irrationals Are...

problems in mathematics) The Collatz conjecture is one of the most famous unsolved problems in mathematics. The conjecture asks whether repeating two simple...

They showed that this would follow from a special case of the four exponentials conjecture in transcendental number theory, specifically that for any two...

matrix Y. For matrix-matrix exponentials, there is a distinction between the left exponential YX and the right exponential XY, because the multiplication...

is exponential in the iterated logarithm of n necessarily contains a cycle whose length is a power of two (Sudakov & Verstraëte 2008). The conjecture is...

The abc conjecture (also known as the Oesterlé–Masser conjecture) is a conjecture in number theory that arose out of a discussion of Joseph Oesterlé and...

In mathematics, the Weil conjectures were highly influential proposals by André Weil (1949). They led to a successful multi-decade program to prove them...

had been used previously, it was applied twice and four times to coincide with the Hadamard conjecture, while triple application required more than double...

running a statistical computer program. An exponential decay can be described by any of the following four equivalent formulas:: 109–112  N ( t ) = N...

definitions of the trigonometric functions and the standard identities for exponentials are sufficient to easily derive most trigonometric identities. It provides...

{\displaystyle c_{p}^{n}} for some c p < p {\displaystyle c_{p}<p} . The cap set conjecture was solved in 2016 due to a series of breakthroughs in the polynomial...

the proof. The Poincaré conjecture and the spherical space form conjecture are corollaries of the geometrization conjecture, although there are shorter...

Dave L. Renfro, Web pages for infinitely iterated exponentials Knobel, R. (1981). "Exponentials Reiterated". American Mathematical Monthly. 88 (4):...

proof of the Goldbach conjecture". In the movie, this number is known as a "Martian prime". Cunningham chain Double exponential function Fermat number...

problems in mathematics) In the mathematics of graph coloring, Cereceda’s conjecture is an unsolved problem on the distance between pairs of colorings of sparse...

In mathematics, the Riemann hypothesis is the conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers...

Game complexity List of unsolved problems in mathematics Unique games conjecture Unsolved problems in computer science A nondeterministic Turing machine...

of results and ideas for using it to prove the Poincaré conjecture and geometrization conjecture from the field of geometric topology. Hamilton's work on...

problems in graph theory (such as the cycle double cover conjecture and the 5-flow conjecture), one encounters an interesting but somewhat mysterious variety...

In geometry, Keller's conjecture is the conjecture that in any tiling of n-dimensional Euclidean space by identical hypercubes, there are two hypercubes...

recognition of his contributions to partial differential equations, the Calabi conjecture, the positive energy theorem, and the Monge–Ampère equation. Yau is considered...

withstood proof for decades: all four of Landau's problems from 1912 are still unsolved. One of them is Goldbach's conjecture, which asserts that every even...

conjectures which can be encoded as "does this Turing machine halt or not". For example, a 27-state Turing machine could check Goldbach's conjecture for...

Srinivasa Ramanujan, who conjectured that it has only five integer solutions, and after Trygve Nagell, who proved the conjecture. It implies non-existence...

finitely many components. This conjecture implies that the integers are not Diophantine over the rationals and so if this conjecture is true a negative answer...