Leave these fields empty (spam trap):
You can leave this blank to post anonymously, or you can create a Tripcode by using the format Name#Password
[i]Italic Text[/i]
[b]Bold Text[/b]
[spoiler]Spoiler Text[/spoiler]
>Highlight/Quote Text
[pre]Preformatted & Monospace Text[/pre]
[super]Superset Text[/super]
[sub]Subset Text[/sub]
1. Numbered lists become ordered lists
* Bulleted lists become unordered lists


420chan is Getting Overhauled - Changelog/Bug Report/Request Thread (Updated March 22)
Superman Prime by Samuel Ginderstone - Thu, 18 Oct 2018 19:38:58 EST ID:bWRuE3ZW No.15697 Ignore Report Quick Reply
File: 1539905938116.jpg -(74839B / 73.08KB, 568x438) Thumbnail displayed, click image for full size. 74839
The largest mersenne prime starts with 738905609893065022733042746057570078131803155705518473240871278225225737960790577633843124850791217947737531612654788661238846036...-+1 It's the largest prime you can approach with computation.

Have a nice day.
Samuel Ginderstone - Thu, 18 Oct 2018 19:45:00 EST ID:bWRuE3ZW No.15698 Ignore Report Quick Reply
It's magnitude is uncountable and contains more numbers then you have space to represent it;however, it is predictable and like a spigot. We can choose any sequence of numbers along this infinitely large chain arbitrarily.

That is the end of mersenne primes. It simply collapses periodically. It can be extended... but it's occurrence is completely predictable and useless.
Samuel Ginderstone - Thu, 18 Oct 2018 19:50:16 EST ID:bWRuE3ZW No.15699 Ignore Report Quick Reply
This is ultimately the highest amount possible with 2^n systems. This number is the limitation to binary systems.

The limitation to number in an infinite amount of parallel binary systems is also not difficult.
Samuel Ginderstone - Thu, 18 Oct 2018 19:56:07 EST ID:bWRuE3ZW No.15700 Ignore Report Quick Reply

2^n systems refers to the computational complexity of a problem for turning machines.
Simon Nirringford - Thu, 18 Oct 2018 20:04:21 EST ID:bWRuE3ZW No.15701 Ignore Report Quick Reply
There are exactly log_10(2) (without a decimal point) numbers in this sequence. 7....3....8.....9.....0....5
Simon Nirringford - Thu, 18 Oct 2018 20:05:16 EST ID:bWRuE3ZW No.15702 Ignore Report Quick Reply
Yes. It's infinitely huge and cannot be approached in any time frame.
Simon Nirringford - Thu, 18 Oct 2018 20:16:17 EST ID:bWRuE3ZW No.15703 Ignore Report Quick Reply
So, in order to represent every prime possible you need a dimensional complexity equal to the limit of gamma(x) as x goes to infinity. Let's keep in mind that complex numbers has a dimensional complexity of 2 and octionions of 8.
Simon Nirringford - Thu, 18 Oct 2018 20:18:14 EST ID:bWRuE3ZW No.15704 Ignore Report Quick Reply
Imaginary numbers are useful for giving real numbers extra smoothness... But any expert can tell you that imaginary numbers are completely useless. Any imaginary number that exists can be represented by two reals.

This is law.
Simon Nirringford - Thu, 18 Oct 2018 20:36:14 EST ID:bWRuE3ZW No.15705 Ignore Report Quick Reply
2^x as x goes to infinity can also be represented as a number near e^e with magnitude I've left unspecified.

Report Post
Please be descriptive with report notes,
this helps staff resolve issues quicker.