@anthony_wehnert: Make a ground beef wall asap

Anthony Wehnert
Anthony Wehnert
Open In TikTok:
Region: US
Tuesday 21 April 2026 20:48:07 GMT
2582771
190096
2692
81710

Music

Download

Comments

nwz680
. :
Clearly a wall beef not a ground beef
2026-04-22 18:29:16
85978
vigdis.brade
vigdis :
everyone is hating, but i actually hate it!
2026-04-23 13:09:38
29324
luismtg4
🇩🇪LuisMtg🧊 :
What if it rots?
2026-04-22 18:36:11
12158
jacklinksjerky
Jack Link's :
I dont know if we can get behind this one dawg
2026-04-29 17:30:56
828
hunterz_awesome
Hunter Iler :
wall of flesh
2026-05-01 00:29:42
367
unsupervised_moron
🏛️🪽* ࿔⋆☤ Hermes ☤⋆࿔ *🪽🏛️ :
I think I’m gunna pass on this one actually
2026-04-21 20:56:55
3357
tard4268
Tard4268 :
do I have to?
2026-04-24 00:16:59
5649
user229292872718
. :
grocery prices too fucking high for this bs
2026-04-26 00:50:32
831
bogdan_norcsa
N🐆 :
next day:
2026-04-23 14:59:00
683
dbldsupreme_
dbldsupreme :
In this economy?????
2026-04-24 23:54:51
172
rosnumberonefan
RoTheBoat :
Whose expectations does this meat bro ✌️😭
2026-04-24 05:08:56
1114
bigboyjerm
Jeremy Johnson :
I can’t defend this behavior
2026-04-22 02:20:43
304
cherie_elliot_ness
Liam_Elliot :
The Magnus archives ahh, anyone?
2026-04-23 08:44:39
120
anonymousghost502
🫠 anonymousghost 😶‍🌫️🇯🇲 :
ts so much bacteria everywhere also u could put a coating on this to
2026-06-10 22:53:06
3
avarequena118
Ayava :
My genuine reaction if I were to walk in a room and see this
2026-06-10 23:47:30
1
thisisthings209
things :
not me screaming ''COOK AND EAT IT!!!!''
2026-06-10 21:03:08
2
ziecharlie015
Zie :
I was waiting for it to cut to a stitch what is my fyp😭😭
2026-06-11 01:59:34
2
mompounderisback
MomPounderIsBack :
this is your sign to NOT do that
2026-06-04 16:47:17
9
pointofno_return
j :
In this economy!?
2026-04-24 11:38:03
345
_emotionlessdoll_
Ophie The Demi-human :
Magnus Archives episode: MAG 18: The Man Upstairs.
2026-04-26 06:20:30
80
yerp358
I_like_popeyes :
I dont like that.
2026-04-25 01:35:21
57
tulips.andlavender
clem🍊🪷 :
it sucks that we all have to do this
2026-05-17 15:25:32
12
To see more videos from user @anthony_wehnert, please go to the Tikwm homepage.

Other Videos

Graham's number is an immense 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 such as Skewes's number and Moser's number, both of which are in turn much, much larger than a googolplex. As with these, it is so large that the observable universe is far too small to contain an ordinary digital representation of Graham's number, assuming that each digit occupies one Planck volume, possibly the smallest measurable space. 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. Using Knuth's up-arrow notation, Graham's number is g 64 {\displaystyle g_{64}},[1] 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. #magyartiktok #neked #fyp #foryou #viral
Graham's number is an immense 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 such as Skewes's number and Moser's number, both of which are in turn much, much larger than a googolplex. As with these, it is so large that the observable universe is far too small to contain an ordinary digital representation of Graham's number, assuming that each digit occupies one Planck volume, possibly the smallest measurable space. 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. Using Knuth's up-arrow notation, Graham's number is g 64 {\displaystyle g_{64}},[1] 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. #magyartiktok #neked #fyp #foryou #viral

About