Googology Wiki
Googology Wiki
No edit summary
m (Added two more (a bit small though))
Tag: Visual edit
Line 5: Line 5:
 
*The cubes such that [[sums of cubes|their sum]] isn't congruent to 4 or 5 mod 9 can be very large for small sums.
 
*The cubes such that [[sums of cubes|their sum]] isn't congruent to 4 or 5 mod 9 can be very large for small sums.
 
*If they exist, counterexamples to the {{w|Collatz conjecture}} must be above \(2^{68}\)<ref>D. Barina, [https://api.semanticscholar.org/CorpusID:220294340 Convergence Verification of the Collatz Problem] (2020, accessed 2020-11-29)</ref>
 
*If they exist, counterexamples to the {{w|Collatz conjecture}} must be above \(2^{68}\)<ref>D. Barina, [https://api.semanticscholar.org/CorpusID:220294340 Convergence Verification of the Collatz Problem] (2020, accessed 2020-11-29)</ref>
  +
*If there are only a finite number of twin primes, then the largest are at least 2996863034895 · 2<sup>1290000</sup>-1 and 2996863034895 · 2<sup>1290000</sup>+1.<ref>https://primes.utm.edu/primes/page.php?id=122213</ref>
  +
*If the Goldbach conjecture is false, the smallest even number that cannot be written as a sum of two primes is at least 4·10<sup>18</sup>.<ref>http://sweet.ua.pt/tos/goldbach.html</ref>
  +
 
==Sources==
 
==Sources==
 
<references/>
 
<references/>

Revision as of 20:51, 29 November 2020

These are large numbers that are related to unsolved problems. Some of these values are subject to change, e.g. bounds on solutions.

  • If Singmaster's conjecture holds for \(N=6\), then the second smallest number that satisfies this condition in Pascal's triangle is \(61,218,182,743,304,701,891,431,482,520\approx 6.12\times 10^{28}\).[1]
  • If odd perfect numbers exist, they must be at least as large as \(10^{1500}\).[2]
  • A 2009 bound by Tao on the entries of sequences whose existence is proven by the Green-Tao theorem is that each entry is less than \(2^{2^{2^{2^{2^{2^{2^{100n}}}}}}}\)[3] for a sequence of length \(n\).
  • The cubes such that their sum isn't congruent to 4 or 5 mod 9 can be very large for small sums.
  • If they exist, counterexamples to the Collatz conjecture must be above \(2^{68}\)[4]
  • If there are only a finite number of twin primes, then the largest are at least 2996863034895 · 21290000-1 and 2996863034895 · 21290000+1.[5]
  • If the Goldbach conjecture is false, the smallest even number that cannot be written as a sum of two primes is at least 4·1018.[6]

Sources