Sana Amjad Official
Region: PK
Thursday 20 November 2025 10:42:15 GMT
12964877
376050
15230
33351
Music
Download
Comments
bint e Saleem :
bacho KO chorna BHT mushkil hota yeh ek maa hi Jan sakti😭
2025-11-20 16:51:29
3124
🦅pagal ladki 🦅 :
shehzadi bahut acchi baat thi ❤️❤️❤️❤️❤️❤️❤️
2025-11-21 06:57:46
433
🦋Ñ🦋 :
Sirf boolna asan h karna bht moskil
2025-11-20 17:58:45
340
reema :
bilkul sae kaha ke ap k sath hu
2025-11-20 13:02:57
213
❤️🫀, 𓆩𝑴𝑶𝑯𝑻𝑨𝑹𝑴𝑨𓆪 ... :
maa kbhi b bachy nhi Chor Sakti kbhi b boht mushkil hi😢
2025-11-20 18:56:20
120
zide girl :
yea ni koe samjtaa
2025-11-20 14:19:26
45
Sheezabeutican :
good ans 💯 reallity
2025-11-20 16:39:41
62
princess :
good right 💯💯
2025-11-20 17:19:09
40
Ayesha uk :
Love you sister ❤💜
2025-11-20 19:01:59
46
Saba🥰 :
sahi
2025-11-20 18:47:04
42
💞𝘽𝙞𝙡𝙡𝙞💞 :
good kya baat hai 💯💯👌🏻
2025-11-20 14:55:37
66
salu 46 king :
بلکل سہی بات ہے
2025-11-20 14:31:53
62
Zoya Ali :
bahut acchi baat Kahi very good🥰🥰🥰🥰
2025-11-21 01:53:33
26
Zubair Malik :
mza Agya sister bilkul
2025-11-20 20:09:46
28
Baba ki princes👑🦋😍 :
dil jet Lea apne sis☺️
2025-11-20 15:14:14
49
sanam :
I Love Muhammad S.A.W🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰
2025-12-07 05:14:20
14
Farhan Ahmed. :
absolutely right
2025-11-20 15:08:25
35
Esha7 :
bilkull sai
2025-11-20 15:13:43
24
Rumiha hon Yar🌹😉 :
Good agree 👍🏻 with you
2025-11-20 16:52:36
25
Abeerah khan :
bilkul good🥰
2025-11-20 15:13:09
47
❤️🌺❤️ :
yes ur right ✅️💯percent
2025-11-20 20:59:31
36
🤍⃟🖤⃝Malâika shèikh🦋 :
🙂 right akely Jio Maza sa jio
2025-11-21 04:34:07
34
bkkkhgjkkjgffd :
right
2025-11-21 02:15:33
26
𐙚🧸ྀིSoho Jutt ˚· ͟͟͞ᯓ(^_−)☆ :
Absolutely agree api 🔥
2025-11-20 15:06:18
25
devoic ❣️grill :
bchy ni chor skty maa ye kbi nhi kr skty💔
2025-11-20 19:31:12
28
To see more videos from user @sanamjad_official, please go to the Tikwm
homepage.
![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 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. #fyp #foryou #viral #trend #politics](/video/cover/7656892370222402849.webp)
