Search Results for ""
61 - 70 of 13135 for Palindromic Number ConjectureSearch Results

A Ramsey number of the form R(k,k;2).
The abc conjecture is a conjecture due to Oesterlé and Masser in 1985. It states that, for any infinitesimal epsilon>0, there exists a constant C_epsilon such that for any ...
An untouchable number is a positive integer that is not the sum of the proper divisors of any number. The first few are 2, 5, 52, 88, 96, 120, 124, 146, ... (OEIS A005114). ...
The Hajós number h(G) of a graph G is the maximum k such that G contains a subdivision of the complete graph K_k.
Grimm conjectured that if n+1, n+2, ..., n+k are all composite numbers, then there are distinct primes p_(i_j) such that p_(i_j)|(n+j) for 1<=j<=k.
Define g(k) as the quantity appearing in Waring's problem, then Euler conjectured that g(k)=2^k+|_(3/2)^k_|-2, where |_x_| is the floor function.
A generalization of Fermat's last theorem which states that if a^x+b^y=c^z, where a, b, c, x, y, and z are any positive integers with x,y,z>2, then a, b, and c have a common ...
A transcendental number is a (possibly complex) number that is not the root of any integer polynomial, meaning that it is not an algebraic number of any degree. Every real ...
Brocard's conjecture states that pi(p_(n+1)^2)-pi(p_n^2)>=4 for n>=2, where pi(n) is the prime counting function and p_n is the nth prime. For n=1, 2, ..., the first few ...
The only Wiedersehen surfaces are the standard round spheres. The conjecture was proven by combining the Berger-Kazdan comparison theorem with A. Weinstein's results for n ...

...