timon dzienus
Region: DE
Wednesday 19 August 2026 16:00:32 GMT
255386
24652
2518
906
Music
Download
Comments
👻 Mimikyu👻 :
Gänsehaut einfach wie krass der Sprüche rauskloppen kann. direkt gefolgt
2026-09-03 10:06:43
1
Gelibert :
Du bist spitze
2026-08-19 16:07:43
477
Saschaworld1.1 :
wir sollten die Grünen verbieten
2026-08-19 19:23:42
39
Ernst Pelz :
mich nerven die grünen nur noch
2026-08-20 16:06:18
128
Emma :
sei schlau scheiß auf blau
2026-08-20 10:35:52
103
rico zesing :
Gut das jemand sein Mund auf macht gegen die Scheiß AfD 👍
2026-08-19 16:06:42
69
Firefighter Robert :
AfD verbot genau Jetzt ❗️❗️❗️❗️❗️
2026-08-20 18:44:25
23
Masked Man :
niemals grün
2026-08-19 19:51:25
21
Gernot Pank :
niemals grüne
2026-08-19 21:16:45
101
Nina Kunst . :
SEI SCHLAU WÄHLT BLAU.
2026-08-19 18:01:16
34
Marcel Hawlitzky :
In meiner Kindheit habe ich gelernt, nur weil einer schreit und laut ist, hat er noch lange nicht recht
2026-08-19 18:37:56
38
stefanbaeder :
Grünen verboten 😝
2026-08-19 19:52:43
6
Michael :
sei schlau und wähle💙💙💙
2026-08-19 20:43:36
6
Stefan Erdmann348 :
Nur noch die AFD 💙💙💙💙😄
2026-08-19 20:57:08
14
Evatussi58 :
Wieviele Prozent haben eigentlich die Grünen?😂😂😂😂😂
2026-08-19 20:13:40
10
jrgenvoigt40 :
Beste Werbung für Blau 👍
2026-08-20 05:06:53
7
Da_Wirtl :
sei schlau gegen blau
2026-08-20 19:15:13
5
Seidel :
Die Grünen sind zurecht da wo sie sind. Hoffentlich bald unter 5 Prozent.
2026-08-19 20:41:01
30
J.W. :
Viele Worte. Behauptungen, Hetze.
2026-08-19 19:38:35
5
Shad0w :
sei schlau wähl auf keinen Fall blau
2026-08-20 18:59:23
55
emir :
Sei schlau und scheiß auf blau
2026-08-20 20:24:13
30
To see more videos from user @dzienus, please go to the Tikwm
homepage.
![my best friend from Brazil too #🍵🌊🌊 #graham #larp #rampage2009 #edits ||4|| Graham's number is a very large number that arose as an upper bound on the answer of a problem in the mathematical field of Ramsey theory. It is much larger than many other large numbers introduced as effective bounds in mathematics, such as Skewes's bound, which in turn is much larger than a googolplex. Graham's number is so large that the observable universe is far too small to contain its ordinary digital representation, assuming that each digit occupies one Planck volume. But even the number of digits in this digital representation of Graham's number would itself be a number so large that its digital representation cannot be represented in the observable universe. Nor even can the number of digits of that number—and so forth, for a number of times far exceeding the total number of Planck volumes in the observable universe. Thus, Graham's number cannot be expressed even by physical universe-scale power towers of the form a b c ⋅ ⋅ ⋅ {\displaystyle a^{b^{c^{\cdot ^{\cdot ^{\cdot }}}}}}, even though Graham's number is indeed a power of three. However, Graham's number can be explicitly given by computable recursive formulas using Knuth's up-arrow notation or equivalent, as was done by Ronald Graham, the number's namesake. As there is a recursive formula to define it, it is much smaller than typical busy beaver numbers, the sequence of which grows faster than any computable sequence. Though too large to ever be computed in full, the sequence of digits of Graham's number can be computed explicitly via simple algorithms; the last 10 digits of Graham's number are ...2464195387.[1] Using Knuth's up-arrow notation, Graham's number is g 64 {\displaystyle g_{64}},[2] where g n = { 3 ↑↑↑↑ 3 , if n = 1 and 3 ↑ g n − 1 3 , if n ≥ 2. {\displaystyle g_{n}={\begin{cases}3\uparrow \uparrow \uparrow \uparrow 3,&{\text{if }}n=1{\text{ and}}\\3\uparrow ^{g_{n-1}}3,&{\text{if }}n\geq 2.\end{cases}}} Graham's number was used by Graham in conversations with popular science writer Martin Gardner as a simplified explanation of the upper bounds of the problem he was working on. In 1977, Gardner described the number in Scientific American, introducing it to the general public. At the time of its introduction, it was the largest specific positive integer ever to have been used in a published mathematical proof. The number was described in the 1980 Guinness Book of World Records, adding to its popular interest. Other specific integers (such as TREE(3)) known to be far larger than Graham's number have since appeared in many serious mathematical proofs, for example in connection with Harvey Friedman's various finite forms of Kruskal's theorem. Additionally, smaller upper bounds on the Ramsey theory problem from which Graham's number was derived have since been proven to be valid. @Xatcc.v2 [🪖]](/video/cover/7680899654531173652.webp)
