@ayanamii_: sorry for reposting, i got the words in the intro wrong 💔 #asushin #asukalangleysoryu #shinjiikari #neongenesisevangelion #evangelion @Luke @i-d-u @yourcasualeverydaynerd @pap3r 🧟‍♂️

kaden 🎵🪽

Open In TikTok:

Region: GB

Saturday 14 February 2026 23:28:25 GMT

49409

4876

41

463

Music

Download

No Watermark .mp4 (3.47MB) No Watermark(HD) .mp4 (3.47MB) Watermark .mp4 (3.57MB) Music .mp3

Comments

jad :

nobody can convince me they arent canon

2026-02-14 23:32:46

318

／⋆ ۪ ❝ ׁׁׅׅ݊⨍ 𝖤𝖫𝖨𝖢𝖨𝖠 𓏴 :

so so bad for each other but cared so so much

2026-02-15 19:36:45

139

Rei Ayanami · Friends :

Asushin so goated

2026-02-17 03:16:47

41

mar12b :

I do not remember her saying this it’s time for a rewatch also what ep

2026-02-16 21:49:57

4

⠀ :

Gonna repost and hope no one watches till the end 😭✌🏽

2026-02-15 19:08:32

28

w :

This is so peak

2026-02-14 23:33:16

4

Codex :

MARS ARGO IS BALL!!!

2026-03-17 04:28:48

2

vlad_to_be_here :

maybe I won't repost even tho its peak 😭🙏

2026-03-28 14:41:58

1

Windowshade :

Song name

2026-02-15 15:18:53

2

Stephen :

why didn't you show what she said before that 🤔

2026-02-15 20:05:44

10

Hoop :

shes soo cute

2026-02-14 23:31:10

1

jas 🌸 #1 asuka fan ♡ :

ASUKA MENTIONED!!!

2026-02-15 08:17:14

3

boone :

peak bro

2026-03-24 02:13:26

1

scoobert :

yayaya

2026-02-14 23:46:26

1

d33343 :

this was the duo of me and my ex best friend. I was shinji and she was asuka. I miss her even if it was like this. This edit makes me feel comfort although I know it wasn’t healthy, I miss it so much for some reason.

2026-03-05 01:47:50

2

Tenebris :

@Kiwi Not even joking just a few scrolls and my entire point shows up.

2026-03-01 05:04:37

1

𝕶𝖊𝖑𝖘𝖎 :

❤️❤️❤️

2026-04-21 00:24:40

0

To see more videos from user @ayanamii_, please go to the Tikwm homepage.

Other Videos

The MOST successful part of our campaign was making it FOR the people. That’s why our organization Kapow is teaming up with Common Power to change politics into a team sport through mutual aid, direct action, and boots on the ground. Here’s how: @Common Power #fyp #woketok #foryoupage #dnc #democrat

The MOST successful part of our campaign was making it FOR the people. That’s why our organization Kapow is teaming up with Common Power to change politics into a team sport through mutual aid, direct action, and boots on the ground. Here’s how: @Common Power #fyp #woketok #foryoupage #dnc #democrat

أنا لستُ متسللاً .. أنا فقط أسجل الهدف الثالث 😉🔥 بنظرة لا تخطئ 🎯✨ إليكم هدف

أنا لستُ متسللاً .. أنا فقط أسجل الهدف الثالث 😉🔥 بنظرة لا تخطئ 🎯✨ إليكم هدف "أوتو جون" في شباك نادي المدينة بكاميرا المركز الإعلامي📷🎬، مع رسالة صامتة للجميع: 💬 راجعوا حساباتكم 🤷‍♂️🔥 #نادي_لبلاد | #السويحلي_مصراتة #DemaSwehly | #SwehlySC

$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 #History #ottomanempire🇹🇷 #enverpasha #turkish #enverpaşa$
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 #History #ottomanempire🇹🇷 #enverpasha #turkish #enverpaşa

𝙍𝙚𝙥𝙤𝙨𝙩 𝙈𝙮 𝙫𝙞𝙙𝙚𝙤𝙨 𝙋𝙡𝙚𝙖𝙨𝙚 𝙑𝙞𝙚𝙬𝙨 𝙋𝙧𝙤𝙗𝙡𝙚𝙢𝙨🥺😭#foryoupage #viralvideo #trending #areebawrites12 #urdupoetry

𝙍𝙚𝙥𝙤𝙨𝙩 𝙈𝙮 𝙫𝙞𝙙𝙚𝙤𝙨 𝙋𝙡𝙚𝙖𝙨𝙚 𝙑𝙞𝙚𝙬𝙨 𝙋𝙧𝙤𝙗𝙡𝙚𝙢𝙨🥺😭#foryoupage #viralvideo #trending #areebawrites12 #urdupoetry

#🤲🤲🤲🤲🤲🤲🤲🤲🤲🕋🕋🕋🕋🕋🕋🕋🕋 #ኮፒሊንክ❤🙏 #pppppppppppppppppp

#🤲🤲🤲🤲🤲🤲🤲🤲🤲🕋🕋🕋🕋🕋🕋🕋🕋 #ኮፒሊንክ❤🙏 #pppppppppppppppppp

#Tunantada #Lunatucumana #arrieroargentino #2023 #Viral

#Tunantada #Lunatucumana #arrieroargentino #2023 #Viral

About

Robot
API

Legal

Privacy Policy