Draft:Nirwan's number
 | Draft article not currently submitted for review.
This is a draft Articles for creation (AfC) submission. It is not currently pending review. While there are no deadlines, abandoned drafts may be deleted after six months. To edit or make changes to this draft, simply click on the "Edit" tab at the top of the window. To be accepted, a draft should:
It is strongly discouraged to write about either yourself or your business or employer. If you do so, you must declare it. Where to get help
How to improve a draft
You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Editor resources
Last edited by Qwerfjkl (bot) (talk | contribs) 8 days ago. (Update) |
Nirwan's number
[edit]Nirwan's number is an exceptionally large finite number derived from combinations of combinatorial functions, fast-growing hierarchies, and large-number notation. It is defined as the evaluation of the graph-theoretic TREE function using a specific input derived from Graham's number and an extended power of ten.
1. Mathematical Definition
[edit]The formal definition of Nirwan's number is expressed as:
Nirwan's Number = TREE(G × 10^(10^261 + 2211))
Where:
- G represents Graham's number, a famously massive integer once recognized by the Guinness Book of World Records as the largest number ever used in a serious mathematical proof.
- TREE(n) represents the TREE function, a weakly-computable function originating from Kruskal's Tree Theorem in graph theory, known for its extreme rate of growth.
2. Structure and Scale
[edit]The construction of Nirwan's number occurs in three distinct tiers of mathematical scaling, each expanding exponentially past the last:
- The Exponential Base: The foundation of the inner input begins with a stacked exponent upon a power of ten: \(10^{(10^{261}+2,211)}\). This sub-component alone represents a value where the total quantity of its trailing zeros far exceeds the total number of subatomic particles in the observable universe (approximately 10⁸⁰), easily surpassing the scale of a standard Googolplex (\(10^{10^{100}}\)).
- The Graham Multiplier: This base value is subsequently multiplied by Graham's Number (G). Because Graham's number is an integer ending in the digit 7, and the base is a pure power of ten, the resulting product preserves the final ten known digits of Graham's number (\(\dots2464195387\)) followed by 10²⁶¹ + 2,211 trailing zeros.
- The TREE Function Expansion: The final tier applies the graph-theoretic TREE function to the entire product. Because the TREE function grows at a rate that rapidly outpaces standard Knuth's up-arrow notation, the final value of Nirwan's number cannot be written down using conventional mathematical notation systems, positioning it within the upper echelons of large numbers alongside entries like Rayo's number.