[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math

Search:


View post   

>> No.12801535 [View]
File: 23 KB, 647x644, jykurih1gjc11.jpg [View same] [iqdb] [saucenao] [google]
12801535

THE NUMBAHS BRADY, WHAT DO THEY MEAN ?

>> No.11231101 [View]
File: 23 KB, 647x644, jykurih1gjc11.jpg [View same] [iqdb] [saucenao] [google]
11231101

>>11231093
goddamn, anon. control your tism or at least hide your powerlevel.

>> No.11123834 [View]
File: 23 KB, 647x644, jykurih1gjc11.jpg [View same] [iqdb] [saucenao] [google]
11123834

Dude....primes
LOL

>> No.11113193 [View]
File: 23 KB, 647x644, jykurih1gjc11.jpg [View same] [iqdb] [saucenao] [google]
11113193

Proof that [math]g(TREE(64))<TREE(g(64))[/math]

Let the function [math]g(n)[/math] be defined recursively such that
[math]
g(n) =
\begin{cases}
g(1)= 3 \uparrow\uparrow\uparrow\uparrow 3 & n = 1 \\
g(n)= 3 \uparrow^{g(n-1)}3 & n> 1
\end{cases}
[/math]

Where [math]g(64)[/math] is Graham's Number. By the Brady's Power Juice™ function [math]J(n)[/math] ,we can observe by sheer mathematical intuition, that [math]g(TREE(64))[/math] has less juice that [math]TREE(g(64))[/math]

[math]
J(g(TREE(64))) < J(TREE(g(64)))
[/math]

Then, by the Juice theorem, which states
that, for any two integers [math]m,n[/math]

[math]
J(n)>J(m)\Rightarrow n>m
[/math]

We follow that

[math]
g(TREE(64))<TREE(g(64))
[/math]

Q.E.D

>> No.10256196 [View]
File: 23 KB, 647x644, jykurih1gjc11.jpg [View same] [iqdb] [saucenao] [google]
10256196

>>10256164
pic related will be considered the best in 1000 years

Navigation
View posts[+24][+48][+96]