@berniceeb__: J’ai mis la vidéo en accéléré un peu parce que je trouvais que je parlais lentement 🥸 même si ça réduit la qualité du son 😂 c’est pas grave 🥲 BREF ça reste quand même un très bon kdrama qui devrait avoir plus de visibilité parce que c’est un bon thriller EXCELLENT même 🙂‍↕️ ça fait partie des meilleures kdramas que j’ai regardé cette année franchement 🥲 @viki #thescarecrow #kdrama #review #parkhaesoo #thriller

B’
B’
Open In TikTok:
Region: FR
Thursday 23 July 2026 12:25:24 GMT
328
48
0
3

Music

Download

Comments

There are no more comments for this video.
To see more videos from user @berniceeb__, please go to the Tikwm homepage.

Other Videos

HE IS SO CUTEEEEEEEEEE ( I lying. ) //  #333 #larp #awd #iq333 #iqmaxx fully grasp Graham's number, labeled as \(G\) or \(g_{64}\), we must break down a number so large that standard mathematics completely breaks down when trying to write it. It is not infinity; it is a exact, finite whole number, but its scale is entirely beyond physical reality.1. Understanding Knuth's Up-Arrow NotationTo understand how Graham's number is built, we must first understand the operator used to construct it. Knuth's up-arrow notation extends basic arithmetic operations beyond addition, multiplication, and exponentiation.Let us define the progression of these operations using the base number \(3\):Level 1: Multiplication (Repeated Addition)\(3\times 3=3+3+3=9\)Level 2: Exponentiation (Repeated Multiplication)\(3\uparrow 3=3^{3}=3\times 3\times 3=27\)Level 3: Tetration (Repeated Exponentiation)Two arrows (\(\uparrow\uparrow\)) mean you create a
HE IS SO CUTEEEEEEEEEE ( I lying. ) // #333 #larp #awd #iq333 #iqmaxx fully grasp Graham's number, labeled as \(G\) or \(g_{64}\), we must break down a number so large that standard mathematics completely breaks down when trying to write it. It is not infinity; it is a exact, finite whole number, but its scale is entirely beyond physical reality.1. Understanding Knuth's Up-Arrow NotationTo understand how Graham's number is built, we must first understand the operator used to construct it. Knuth's up-arrow notation extends basic arithmetic operations beyond addition, multiplication, and exponentiation.Let us define the progression of these operations using the base number \(3\):Level 1: Multiplication (Repeated Addition)\(3\times 3=3+3+3=9\)Level 2: Exponentiation (Repeated Multiplication)\(3\uparrow 3=3^{3}=3\times 3\times 3=27\)Level 3: Tetration (Repeated Exponentiation)Two arrows (\(\uparrow\uparrow\)) mean you create a "power tower" of \(3\)s, where the height of the tower is determined by the number after the arrows.\(3\uparrow \uparrow 3=3^{3^{3}}=3^{27}=7,625,597,484,987\)Level 4: Pentation (Repeated Tetration)Three arrows (\(\uparrow\uparrow\uparrow\)) mean you repeat the tetration operation. The number of towers you stack depends on the previous result.\(3\uparrow \uparrow \uparrow 3=3\uparrow \uparrow (3\uparrow \uparrow 3)=3\uparrow \uparrow 7,625,597,484,987\)This creates a power tower of \(3\)s that is 7.6 trillion layers tall. You cannot write this number down, even if every atom in the universe turned into ink.2. Building the 64 Layers of Graham's NumberGraham's number does not stop at three arrows. It uses a 64-layer recursive sequence where the number of arrows in one layer is determined by the total value of the previous layer.Let us define the sequence step-by-step:Layer 1 (\(g_{1}\))The sequence begins with four up-arrows:\(g_{1}=3\uparrow \uparrow \uparrow \uparrow 3\)To solve \(g_{1}\), you must calculate:\(g_{1}=3\uparrow \uparrow \uparrow (3\uparrow \uparrow \uparrow 3)\)We already established that \(3 \uparrow\uparrow\uparrow 3\) is a power tower 7.6 trillion layers tall. Therefore, \(g_{1}\) is a power tower of \(3\)s whose height is equal to that un-writable 7.6-trillion-layer number.Layer 2 (\(g_{2}\))\(g_{2}=3\uparrow \dots \dots \dots \uparrow 3\)The number of up-arrows between these two \(3\)s is exactly equal to the value of \(g_{1}\).Layer 3 (\(g_{3}\))\(g_{3}=3\uparrow \dots \dots \dots \uparrow 3\)The number of up-arrows between these two \(3\)s is equal to the value of \(g_{2}\).The Final Step (\(g_{64}\))This process continues sequentially for 64 iterations:\(\text{Graham}^{\prime }\text{s\ Number\ }(G)=g_{64}\)Layer 64: g_64 = 3 ↑↑↑... ...↑↑↑ 3 <--- This is Graham's Number \ / g_63 arrows . . Layer 3: g_3 = 3 ↑↑↑... ...↑↑↑ 3 \ / g_2 arrows Layer 2: g_2 = 3 ↑↑↑... ...↑↑↑ 3 \ / g_1 arrows Layer 1: g_1 = 3 ↑↑↑↑ 3 3. The Ramsey Theory Problem It SolvesRonald Graham did not create this number simply to make a large value. It was calculated as an upper bound to solve a specific problem in a branch of combinatorics called Ramsey theory, which looks for guaranteed order within chaos.The problem can be visualized through dimensions:The Setup: Imagine an \(n\)-dimensional hypercube (a cube extended into any number of dimensions).The Connections: Connect every single vertex (corner) of this hypercube to every other vertex using lines. This forms a complete graph.The Coloring: Color every single one of those connecting lines using only two colors: blue or red.The Question: What is the minimum number of dimensions (\(n\)) required to guarantee that, no matter how randomly you color the lines, there will always exist a single-colored flat plane connecting four vertices?Graham proved that a dimension size

About