Theorems only valid for huge numbers

Asked Aug 22 '21 at 08:47

Active Aug 22 '21 at 08:57

Viewed 78 times

I am trying to find a theorem that is valid only for very large numbers.

Example:

There are numbers which have more than 100 distinct factors.

Above theorem satisfies this condition, but it is a trivial one. What I would like is not a trivial one just for the purpose of being for huge numbers. I mean the huge number part should be a side effect rather than main focus.

I want to use it to show that even if you use brute force, trying up to hundred digit numbers, it may still not be successful proof.

Thank you

asked Aug 22 '21 at 08:47

xycf7

2

The asymptotically-fastest known algirithm for integer multiplication is only faster than other methods when the numbers to be multiplied are larger than around $10^{10^{10^{38}}}$. Similar examples are given at: https://en.wikipedia.org/wiki/Galactic_algorithm – MJD Aug 22 '21 at 09:27
3

This is, in some sense, the same as this – Arctic Char Aug 22 '21 at 09:42
3

My favourite would be : There are positive integers $x$ with $\pi(x)>li(x)$ – Peter Aug 22 '21 at 09:48
2

Also related: Examples of patterns that eventually fail – MJD Aug 22 '21 at 10:09
1

This one is from Math Overflow: Examples of patterns that eventually fail – MJD Aug 22 '21 at 13:46
1

@xycf7 Are the linked posts close enough to what you wanted? If you're looking for something different, could you please amend your question to explain in what way it should be different? – MJD Aug 22 '21 at 17:24
@MJD they are indeed good examples. Unfortunately no one entered them as answers, so I cannot accept them. Thank you all for the information. – xycf7 Aug 22 '21 at 21:45
1

Sure, I'm glad we could help. I've suggested that we close your question as being a duplicate of one of the earlier ones. – MJD Aug 22 '21 at 21:50

Theorems only valid for huge numbers

0 Answers0