@katehgtb: On ne pourra pas toujours être là pour les protéger. Mais on peut leur apprendre quoi faire quand nous ne sommes pas là. Ces 5 réflexes, j’aimerais que mes enfants les connaissent par cœur avant de commencer à sortir seuls. Lequel ajouterais-tu à cette liste? #parentalité #parents #ados #enfants #sécurité

Kate 🇨🇦✌️
Kate 🇨🇦✌️
Open In TikTok:
Region: CA
Thursday 27 August 2026 17:07:08 GMT
150477
2435
38
4356

Music

Download

Comments

isabelle.lvl76
🌹 :
et toujours regarder comment il est habillé,la description des vêtements,chaussures aide les policiers.. c est toujours ce que je fais...
2026-08-28 07:37:01
3
xrcuu68
joker21 :
mais il est où le 4 laaa ?😁
2026-08-29 10:54:08
0
titikyara
titikyara :
j'aurais rajouté 1 règle. ne me désobéi pas si je te dit 1 truc c'est pour ton bien
2026-08-28 11:26:05
5
luluapeupres
Lulu à Peu Près🍓 :
hier j'ai eu la discussion des ballons avec lui , et là il me sort: non mais Maman, je vais finir comme mona de nasdass, ça va pas ,jamais je touche à ça et puis avec mon asthme en plus , punaise j'ai été rassurée,🥰 c'est un fléau ce truc , il a 15ans DC à cet âge je sais qu'on a envie de commencer ses expériences de merde 😅j'ai fini par lui dire que si un jour il teste des trucs c'est Normal d'en avoir envie mais que je préfère qu'il m'en parle et que je ne l'engueulerai pas bref je vais entrer dans la période panique qd même 🤣
2026-08-28 09:06:48
1
tylerd160
tylerD :
Il commence pas à sortir tout seul!!!
2026-08-29 09:29:59
0
nia.ina311
𝑁𝑖𝑎 🍀 :
Pour ma part j en parle toujours et toujours a mon fils
2026-08-28 21:02:34
1
altyrion
Altyrion :
c'est bien mais j'en vois que 4
2026-08-29 09:23:45
0
oliviaboutique6
Olivia Boutique :
y en a que 4 du coup 🤷🏻‍♀️😅
2026-08-27 21:54:36
0
obiwanjubo
Julien Baumer :
déjà fait
2026-08-27 23:35:14
1
ladamelucide
ladame :
toujours : je suis la ! je suis ta meilleure allié ! ne craint rien même si tu as fait une connerie , je suis ici pour trouver des solutions !
2026-08-28 08:52:15
0
maghraoui233
Lati :
Le BA-BA
2026-08-27 21:32:46
0
sandy.erika.clin
Sandy Erika Clin :
@†𝔈𝔯𝔦𝔨𝔞†
2026-08-28 22:07:53
2
melalexia2024
Mel Alexia 2024🪶Native Canada :
@Just_a_stay ♥️♥️♥️
2026-08-28 12:41:20
1
jkonstanzom
Juan Carlos Costa779 :
🥰🥰🥰
2026-08-28 21:54:47
0
joepat6
Joe Pat :
🥰🥰🥰
2026-08-28 02:32:39
0
carolineboudreaul
Caroline Boudreault :
@la gaga des chats😻
2026-08-28 00:06:58
0
moimoidu31
C’est moi :
👍👍👍
2026-08-28 03:52:24
1
bibibi1234561
bibibi1234561 :
🥰🥰🥰
2026-08-27 22:24:20
0
bibibi1234561
bibibi1234561 :
😂😂😂
2026-08-27 22:24:16
0
fabianblondiau0
Fabian Blondiau710 :
😂😂😂
2026-08-27 23:33:16
0
fabfaby83
fabfaby83 :
@Tanita 🇨🇮🫱🏼‍🫲🏽 💖💖💖
2026-08-28 09:20:48
0
To see more videos from user @katehgtb, please go to the Tikwm homepage.

Other Videos

#targetaudience   Graham's number is a very large 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 abc⋅⋅⋅, 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 g64,[2] wheregn={3↑↑↑↑3,if n=1 and3↑gn−13,if n≥2. Graham's number was used by Graham in conversations with popular scienceMartin 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 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.
#targetaudience Graham's number is a very large 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 abc⋅⋅⋅, 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 g64,[2] wheregn={3↑↑↑↑3,if n=1 and3↑gn−13,if n≥2. Graham's number was used by Graham in conversations with popular scienceMartin 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 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