1. Home
  2. Detail

@pelliegadston: After many attempts over the the past 8 months of Jesse trying to put Nina in the pond… he finally achieved it! 😂 @jessealligood2122 @Nina Cortes #funny #couples #teen #trending

PellieMoore ♾️🎧🦆✈️
PellieMoore ♾️🎧🦆✈️
Open In TikTok:
Region: US
Saturday 07 June 2025 15:24:28 GMT
3668090
340962
1324
4805

Music

Download

No Watermark .mp4 (94.43MB) No Watermark(HD) .mp4 (78.05MB) Watermark .mp4 (94.79MB) Music .mp3

Comments

ahhh_itstayaaaaa
TAYA🔧🪼 :
and they broke up.
2026-08-16 18:00:01
2731
ms.cheyanneeee
ms.cheyanneeee :
If they don’t get married when there older imma be so pisss
2025-06-07 22:28:39
20741
hyleigh.spamzz
hyleigh spamzz! :
they broke up..
2026-08-16 16:34:03
589
ur_localblonde.0
ur_localblonde.0 :
her voice is so calming, she didn’t yell once 😭
2025-06-08 09:14:36
20940
bellaisbank910
✝️🎣🦌𝓑𝓮𝓵𝓵𝓪🦌🎣✝️ :
“I missed youuuu” “I missed you to” “I home”
2025-06-11 04:12:29
2416
bre_732814
bre_732814 :
Are Jesse and Nina still together?
2026-04-16 23:30:43
74
bumblrxemkc
🧿💎Braylee💎 🧿 :
“I missed youuuu”I missed you too”that’s so cute
2025-06-07 22:48:51
7354
ur.fav_blonde02
ur.fav_blonde02 :
need a relationship like this!
2025-06-07 15:30:29
3775
lilymayxx51
🪩 Lilyxmayx 🪩 :
her voice is so cutee
2025-06-08 10:49:39
1814
mrwhipstar
mrwhipstar :
"I like sitting so let's sit for awhile " I agree nina 😂 I agree.
2025-06-07 16:44:40
2551
sawyerg63
Sawyer🦄 :
Did she jump on his dad cause if she did that’s so cute
2025-06-08 01:17:58
967
littlegosch07
Its me Emily ⚽️😂 :
“Let me tell you something!!” Made me cackle! 🤣 I strive for a relationship like theirs.
2025-06-07 15:35:14
8930
charlie_shields
charlie_shields :
Her voice is so calm and sweet
2025-06-19 22:12:01
413
darren__d
darren...D :
Not mom egging it on "I don't think your brave enough" 😂😂😂
2025-06-07 21:00:30
3060
holliecousinsx
holliecousinsx :
See I’ve been told about the things in that pond I would freak if I didn’t know what I was stepping on😭😂
2025-06-07 16:52:25
244
countrygeorgiagirl1982
🍭⚡JESSIE 🌴 LEIGH🩷 🐒 :
this is hilarious.. especially her jumping on Gadston... lol 😂 😂 😂 😂
2025-06-07 21:52:23
436
kyrielizabeth
✨Kyri elizabeth✨ :
Awh i love how she jumped into a hug when he got home and he wasnt mad he got wet ☺️
2025-06-07 16:48:05
808
huntingontop4
Miaaa🙂 :
Not the jump😭😂
2025-06-07 15:37:00
256
scottjones00
sj3010 :
can we talk about it 🤣🤣🤣
2025-06-07 15:39:29
243
that1emo_girl8
💕💗that1emo_girl💜💙🧡 :
"I don't know what I'm STEPPIN ONN!"
2025-06-30 21:30:02
194
dani._.koifish
🪿 :
“Nina might get wet” she is already soaked 🥹
2025-12-05 02:38:11
338
karli_knight6
♾️✈️🦋🍀🐆🌻karli 🍀🐆🌻🦋✈️♾️ :
I love how she said I am not ready. She will be ok it’s just water
2025-06-07 18:15:35
110
jae20314
Jae🤍 :
I am so sick . Been watching them since day 1
2026-08-17 02:36:28
193
To see more videos from user @pelliegadston, please go to the Tikwm homepage.

Other Videos

#somalilandtiktok #kenyantiktok🇰🇪 #fyp #fyp #foryoupage
#somalilandtiktok #kenyantiktok🇰🇪 #fyp #fyp #foryoupage
#malitiktok🇲🇱 #humour #pourtoi #visibilite
#malitiktok🇲🇱 #humour #pourtoi #visibilite


chính a🤫
chính a🤫
vẫn thích tóc đen nhất huhuu #fyp #foryou #tiktok #foryoupage
vẫn thích tóc đen nhất huhuu #fyp #foryou #tiktok #foryoupage
Just a Turkish soldier hugging his Kurdish friends🇹🇷❤️ #turanbirliği🇹🇷🇦🇿🇺🇿🇰🇿🇰🇬🇹🇲 #iqmaxx #tkd #turkic #kesfet 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.
Just a Turkish soldier hugging his Kurdish friends🇹🇷❤️ #turanbirliği🇹🇷🇦🇿🇺🇿🇰🇿🇰🇬🇹🇲 #iqmaxx #tkd #turkic #kesfet 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.

About

Legal