Shadowing Practice: The Simplest Math Problem No One Can Solve - Collatz Conjecture - Learn English Speaking with Video

- This is the most dangerous problem in mathematics, one that young mathematicians are warned not to waste their time on.

It's a simple conjecture that not even the world's best mathematicians have been able to solve.

Paul Erdos, a famous mathematician, said, "Mathematics is not yet ripe enough for such questions." Here's how it works.

Pick a number, any number.

Seven? Good choice.

Okay, we're gonna apply two rules.

If the number is odd, we multiply by three and add one.

So three times seven is 21, plus one is 22.

If the number is even, we divide by two.

So 22 divided by two is 11.

Now, we keep applying these two rules.

11 is odd, so we multiply by 3, 33, and add 1, 34.

Even, divide by two, 17, odd.

Multiply by 3, 51, add 1, 52, even.

Divide by two, 26, still even.

Divide by two, 13, odd.

So we multiply by 3, 39, add one, and that's 40, which is even, so we divide by two, 20, divide by two, 10, divide by two, five, odd.

Multiply by three, 15, add one, 16, divide by two that's eight, and then four, two, and one.

Now, one is odd, so we multiply by three and add one, which equals four.

But four goes to two, goes to one, so we're in a loop, and the lowest number is one.

Now, the conjecture is this: every positive integer, if you apply these rules, will eventually end up in the four, two, one loop.

This is commonly called the Collatz conjecture after German mathematician, Luther Collatz, who may have come up with it in the 1930s.

But the problem has many origin stories and many names.

It's also known as the Ulam conjecture, Kakutani's problem, Thwaites conjecture, Hasse's algorithm, the Syracuse problem, and simply 3N+1.

Why is 3x+1 so famous?

- Among professional mathematicians, maybe it's not famous but infamous, in the sense that if someone actually admits in public that they're working on it, then there's something wrong with them.

- The numbers you get by applying 3x+1 are called hailstone numbers, because they go up and down like hailstones in a thundercloud, but eventually, they all fall down to one, or at least we think they do.

You can think of the numbers as representing the height above the ground in meters.

So a number like 26 would start 26 meters above the ground.

And if you apply 3x+1, it rises up as high as 40 meters.

And, in total, it takes 10 steps to get to one.

So 10 is called its total stopping time.

But take the very next number, 27, and it bounces around all over the place.

In fact, it climbs all the way up to 9,232.

As an altitude, that is higher than Mount Everest, before it too falls back to the ground.

In total, it takes 111 steps for 27 to get down to one and end up in the four, two, one loop.

The paths that different numbers take vary so widely, even numbers right next to each other.

So how do you even start to make progress on this problem?

Well, honestly, mathematicians struggled.

- People just decided that this was something invented by the Soviets to slow down U.S. science, and it was doing a good job at it 'cause everybody's sitting there twiddling their thumbs and making no progress on this trivial thing that you can tell a school of children.

- Jeffrey Lagarias is the world authority on 3x+1.

- The first time I met him I was a senior in college, and he pulled me aside and he said, "Don't do this.

Don't work on this problem.

If you want to have a career, do not start spending time writing about this or publishing any papers about this.

Do real math for a while to establish yourself." - Alex Kontorovich didn't listen.

He and Yakov Sinai looked at the paths of the hailstone numbers.

Were there any patterns?

But obviously all of them ended up at one.

But what about the paths they take to get there?

The pattern is randomness.

Here is the sequence of a large number chosen at random.

The graph peaks and then drop so low that you can't really see what's happening at this scale.

But if you take the logarithm, you find this wiggly graph with a downward trend.

It looks like the stock market on a bad day.

And this is no coincidence.

Both are examples of geometric Brownian motion.

That means if you take the log and remove the linear trend, the fluctuations are random.

It's like flipping a coin each step.

If the coin is heads, the line goes up, tails, it goes down.

3x+1 is just like the random wiggles of the stock market.

Over long-enough periods, the stock market tends to trend upwards, while 3x+1 trends down.

Another way to analyze 3x+1 is by looking at the leading digit of each number in a sequence.

Here are the hailstone numbers starting with three as the seed.

And we can count up how many numbers start with a one, how many start with a two, how many start with a three, and so on to make a histogram.

We can do the same thing for the sequence that starts with four, and that's a short one, and for the sequences that start with five, six, and seven.

Again, for each sequence, we're just counting up how many numbers start with each digit, one through nine, and adding that to our histogram.

If you keep doing this for more and more numbers, eventually the histogram settles into a stable pattern.

For the first billion sequences, you'll find one is by far the most common leading digit.

30% of all numbers start with one, around 17.5% start with two, 12% start with three, and the frequency decreases for higher digits.

Fewer than 5% of all the numbers start with nine.

Now, this pattern is not unique to 3x+1.

It actually comes up everywhere, from the populations of countries, to the value of companies, all the physical constants and the Fibonacci numbers, just to name a few.

The distribution is known as Benford's law, and it is even used to detect fraud.

If all the numbers on your income tax forms obey Benford's law, then, well, you're probably being honest.

If not, you may be hiding something.

In elections, Benford's law can be used to spot irregularities, though you have to apply it correctly.

Benford's law works best when the numbers involved span several orders of magnitude as they do for 3x+1.

But Benford's law can't tell us whether all numbers will end up in the four, two, one loop or not.

For that, we need a different sort of analysis.

Now, at first glance, it seems strange that when you apply 3x+1, all numbers should end up at one.

I mean, consider that there are the same number of odd and even numbers, but odd numbers are more than tripled, while even numbers are only cut in half.

Therefore, it seems like every sequence on average should grow, not shrink.

But here's the catch.

Every time you multiply an odd number by three and then add one, it will always become an even number, and that means the next step is to divide by two.

So odd numbers are not actually tripled by 3x+1.

They're increased by a factor of about three over two.

I'm neglecting the plus one because it's insignificant for large numbers.

And 3/2 is actually the most an odd number can grow in one step.

Think of the path from one odd number in a sequence to the next odd number.

After multiplying by three and adding one, you have an even number.

And 50% of the time, dividing by two brings you back to an odd number.

But a quarter of the time, you can divide by four before you get to the next odd number.

So, for a quarter of numbers, the next one in the sequence will be 3/4 of its initial value.

An 1/8 the time, you can divide by eight before getting to the next odd number, and 1/16 of the time, you can divide by 16 and so on.

If you take the geometric mean, you find, on average, to get from one odd number to the next one, you multiply by three over four, which is less than one.

So statistically speaking, 3x+1 sequences are more likely to shrink than grow.

Take 341 for example, multiply by three and add one, you get 1,024, which you can divide by two and then divide by two again, and again, and again, and again, 10 times in total until you're down to one.

One way to visualize these paths of numbers in 3x+1 is simply to show how each number connects to the next one in its sequence.

This is called a directed graph.

100

It looks like a tree or a series of little streams that flow into each other.

101

If the conjecture is true, it means that every single number is connected to this graph.

102

Every tiny stream all the way out to infinity eventually flows into the massive river of four, two, one.

103

Some mathematicians have modified this visualization by rotating the graph at each number; anticlockwise if it's an odd number, and clockwise if it's even.

104

And then you end up with a structure that looks like a coral or seaweed.

105

And by adjusting the degree of rotation for odd and even numbers, you can create these beautiful, organic-looking shapes.

106

Now, there are two ways the conjecture could be false.

107

There could be a number somewhere, some seed, that starts a sequence of numbers that grows to infinity.

108

For whatever reason, it doesn't obey the same numerical gravity as all of the other numbers.

109

Another possibility is there exists a sequence of numbers that forms a closed loop.

110

All the numbers in this loop would be unconnected to the main graph.

111

But thus far, no loop or sequence that shoots off to infinity has been found.

112

And not for lack of trying, mathematicians have tested by brute force every single number up to two to the 68.

113

That's 295,147,905,179,352,825,856 numbers.

114

We know, for certain, that every single one of those numbers eventually comes back down to one.

115

We have tested nearly 300 quintillion numbers, and none of them disproves the conjecture.

116

In fact, given this information, mathematicians calculate that any loop other than four, two, one must be at least 186 billion numbers long.

117

So, it seems pretty likely that the conjecture is true, but this doesn't prove it.

118

One way mathematicians have attempted to prove it is by making a scatterplot with all the seed numbers on the x-axis and a number from each seeds sequence on the y-axis.

119

Now, if you can show that in every 3x+1 sequence there is a number that is smaller than the original seed, well then you have proven the Collatz conjecture, because whatever number you pick, you know it will at some point get smaller, and that smaller number as a seed also gets smaller, and so on down to one, meaning the only way any sequence can end is in the four, two, one loop.

120

This has not yet been shown.

121

But, in 1976, Riho Terras was able to show that almost all Collatz sequences reach a point below their initial value.

122

In 1979, this limit was reduced with almost all numbers going to less than X to the power of 0.869.

123

And then in 1994, it was further lowered to less than X to the power of 0.7925.

124

In this case, the term almost all numbers has a technical mathematical definition.

125

It means that as the numbers you're looking at go to infinity, the fraction that end up under the curve goes to one.

126

Then in 2019, one of the world's greatest living mathematicians, Terry Tao, was able to show 3x+1 obeys even stricter criteria.

127

He showed almost all numbers will end up smaller than any arbitrary function f of x so long as that function goes to infinity as x goes to infinity.

128

But the function can rise as slowly as you like.

129

So, log x is an example, or log, log, log x works too, or log, log, log, log x.

130

What this means is, for almost all numbers, you can guarantee that there is an arbitrarily small number somewhere in its sequence.

131

In a public talk he gave in 2020, Terry Tao said, "This is about as close as one can get to the Collatz conjecture without actually solving it." This is an impressive result, but it's still not a proof.

132

So why can't we prove the conjecture true?

133

Could it be because it's not true?

134

I mean, everyone is trying to prove it true, which means almost no one is looking for counterexamples.

135

- It had happened to me just two years ago, where there was something I was trying to prove, that I was trying for three years to prove, and I couldn't get it to work.

136

And then I found a counterexample, and then I realized what the correct statement should have been.

137

And then a month later, I proved the correct statement.

138

Maybe we should be spending more energy looking for counterexamples than we're currently spending.

139

- I mean, remember how the number 27 grows all the way to 9,232?

140

Here is a plot of seed numbers up to 10,000, with the largest number reached for each seed plotted on the y-axis.

141

The y-axis stops at a 100,000, but not all numbers can be shown at this scale.

142

The seed 9,663, for example, climbs as high as 27 million.

143

And as yet, no one has proven why a number couldn't just shoot off to infinity.

144

And it would take only one to disprove the conjecture, or some set of numbers could be part of a loop not connected to the main graph.

145

As far as we know, there is only one loop: four, two, one.

146

But something strange happens if you include negative numbers.

147

Applying the same 3x+1 rules as before, there is not one loop, not two loops, but three independent loops of numbers.

148

And they start at low values like -17 and -5.

149

Why should there be disconnected loops on the negative side of the number line, but not on the positive side?

150

Now, one of the most convincing pieces of evidence supporting the conjecture is Terry Tao's proof that almost all numbers have a number in their sequence that is arbitrarily small.

151

But proving that almost all numbers obey this criteria isn't the same thing as proving that all numbers do.

152

How many numbers between one and 100 are perfect squares?

153

The answer is 10.

154

So, 10% of numbers up to 100 are perfect squares.

155

How many numbers between one and 1,000 are perfect squares?

156

The answer is 31.

157

So only 3.1% of the numbers up to 1,000 are perfect squares.

158

And the higher you go, the smaller this percentage becomes, such that in the limit, you could say almost all numbers are not perfect squares.

159

The fraction of numbers that are not perfect squares goes to one as X goes to infinity.

160

And yet we know there are an infinite number of perfect squares and we know exactly where they are.

161

Now, we've tested by brute force all numbers up to two to the 68, and they all obey the Collatz conjecture.

162

And you might be thinking that, well, we should have found a counterexample by this point.

163

But on the scale of all numbers, two to the 68 is nothing.

164

I mean, the Polya conjecture proposed in 1919 by George Polya asserted that the majority of natural numbers up to any given number have an odd number of prime factors.

165

The conjecture was eventually proven false by C. Brian Haselgrove in 1958 when he identified a counterexample.

166

What's remarkable is the value of this counterexample was 1.845 times 10 to the 361.

167

That's some 10 to 340 times bigger than all the numbers checked for 3x+1.

168

One way to think about 3x+1 is as though it's a simple program run on a turing machine.

169

The seed number is the input to the machine.

170

So in this picture, two to the 68 is simply an input tape 68 squares long.

171

You can think of them as a string of ones and zeros or black and white squares.

172

Saying the machine has transformed every input up to this 68 square taped down to one should not give you a lot of confidence that it will do so for all inputs.

173

In fact, it's fairly simple to calculate a number that shows any arbitrary behavior you like, so long as it is finite.

174

But if you want a number that increases by three over two five consecutive times, you can calculate that number.

175

If you want a number that climbs by three over two 10 times in a row, or 100 times or 1,000 times, you can easily calculate those numbers.

176

But after the finite section you specify, you have no more control.

177

And every that has ever been tested, always falls to one.

178

If there is a counterexample, it's virtually impossible that someone's gonna guess it.

179

And the space of all possibilities is too big to search exhaustively by brute force.

180

- Two to the 1,000 is not a searchable space.

181

So, if we're gonna find it, we have to find it by some intelligent process and not by guess and check.

182

I had been on team 3x+1 for 20 years.

183

And then this point of view, I realized that, what do we really know?

184

It's very hard to prove a theorem that's false.

185

And so, could it be that everyone is struggling to prove this thing because it's not actually true?

186

And two to the 60 is not a lot of evidence.

187

And even the statistical version is maybe true and not evidence for the non-existence of a divergent trajectory somewhere in the 3x+1 sequence.

188

- Of course there is another option, and that is that we'll never know, that the problem is undecidable.

189

In 1987, John Conway created a generalization of 3x+1.

190

It was a mathematical machine that he called FRACTRAN.

191

And he was able to show this machine is turing-complete, which means it can do anything a modern computer can do, but it also means that it's subject to the halting problem, a chance that the machine never stops running and so doesn't give you an output.

192

And this does not prove that 3x+1 is also subject to the halting problem, but it is possible that given what we know, we may never prove the Collatz conjecture true or false.

193

- You're gonna be taught in school that we know a bunch of stuff, and it's a lie.

194

They're all lies.

195

Here's this stupid little problem.

196

Come on, really we can't solve this?

197

Really? You know, it just shows that math is hard.

198

If anything, it shows that all of the things that we can solve are miracles.

199

We have no right to have solutions to all of these other problems.

200

- For my whole life, I've thought of numbers as these incredibly regular things full of patterns, symmetry, and repetition.

201

But what I'm realizing only now is just how peculiar numbers really are.

202

You can see this most clearly in the coral representation.

203

From a simple mathematical operation comes something intricate, organic-looking, and, thus far, intractable to us.

204

Do all numbers connect to the structure, or is there some unique filament, a spindly little thread, that doesn't connect to any of this, that runs off to infinity?

205

And why is it so hard to tell?

206

I think that's why Paul Erdos said, "Mathematics is not yet ripe enough for such questions." What I love about 3x+1 is it's a problem almost anyone can understand and play around with.

207

And actually trying to figure things out for yourself is the best way to learn, which is why I subscribed to Brilliant, the sponsor of this video.

208

Now, recently, Brilliant have upped their interactivity.

209

For example, here is a great lesson on the Pythagorean theorem.

210

So, you don't just remember the formula, but you really understand what it means.

211

Now, Brilliant is a website and an app designed to get you thinking deeply by engaging you in problem-solving.

212

It's one thing to read through a textbook and think that you get it, but it's quite another to play with interactives and actually test yourself as you go, and Brilliant curates the experiences so they get more and more challenging over time.

213

There's always a helpful tip or explanation that takes your understanding to the next level.

214

I'd highly recommend their course on mathematical fundamentals, which now has even more interactivity and it has topics that are relevant to all areas of STEM and algorithm fundamentals for anyone interested in coding.

215

It's great to have a resource like this to inspire you to learn something new every single day.

216

I try to start off my day by challenging myself with Brilliant.

217

And so if you'd like to join me and a community of 8 million other learners, go to brilliant.org/veritasium.

218

I will put that link down in the description.

219

So I wanna thank Brilliant for sponsoring this video, and I wanna thank you for watching.

📺 Zelfde Kanaal

✨ Aanbevolen Video

86 zinnen

The End of Human Mathematics? AI's Recent Breakthrough -- And What's Next

Daily ConversationUniversity StudentsWorking Adults

552 zinnen

The Professor Who Taught People How To Think (1962)

Daily ConversationUniversity StudentsWorking Adults

110 zinnen

Two Sum - Leetcode 1 - HashMap - Python

Daily ConversationUniversity StudentsWorking Adults

81 zinnen

Mathematician Collapses All Functions to One Weird Formula

Daily ConversationUniversity StudentsWorking Adults

238 zinnen

Cosmic Insignificance Theory: A Simple Idea That Will Change Your Life Forever

Daily ConversationUniversity StudentsWorking Adults

24 zinnen

This structure feels impossible to move

Daily ConversationUniversity StudentsWorking Adults

178 zinnen

25 crazy software bugs explained

Daily ConversationUniversity StudentsWorking Adults

14 zinnen

A Cosmic Coincidence

Daily ConversationUniversity StudentsWorking Adults

66 zinnen

What science can’t answer, according to physicist Jim Al-Khalili | Big Think

Daily ConversationUniversity StudentsWorking Adults

155 zinnen

How to be a creative thinker | Carnegie Mellon University Po-Shen Loh

Daily ConversationUniversity StudentsWorking Adults

50 zinnen

We Fell For The Oldest Lie On The Internet

Daily ConversationUniversity StudentsWorking Adults

Woordenschat en spreektips bij deze les

Deze spreekles op niveau C1 is gebaseerd op de video “The Simplest Math Problem No One Can Solve - Collatz Conjecture”. Deze woorden komen het vaakst terug: sequence, odd, conjecture, loop, divide. Deze video bevat 219 zinnen en 3511 woorden om na te spreken. Het gesproken deel duurt 22:09. De spreker praat in een natuurlijk tempo van ongeveer 159 woorden per minuut, dicht bij een alledaags gesprek. 82% van de woorden hoort bij de 3.000 meest gebruikte Engelse woorden; de rest kun je beter vooraf bekijken.

Belangrijke woorden in deze video

De 15 moeilijkste woorden uit de video, met uitspraak en betekenis:

Woord	Uitspraak	Betekenis
conjecture zelfstandig naamwoord	/kənˈd͡ʒɛkt͡ʃə/	gissing, giswerk
mathematician zelfstandig naamwoord	/ˌmæθ.(ə.)məˈtɪʃ.ən/	wiskundige, mathematicus
multiply werkwoord	/ˈmʌltɪplaɪ/	vermenigvuldigen
infinity zelfstandig naamwoord	/ɪnˈfɪnɪti/	oneindigheid
counterexample zelfstandig naamwoord		tegenvoorbeeld
graph zelfstandig naamwoord	/ɡɹæf/	grafiek
hailstone zelfstandig naamwoord	/ˈheɪlstoʊn/	hagelsteen
digit zelfstandig naamwoord	/ˈdɪd͡ʒɪt/	cijfer
obey werkwoord	/oʊˈbeɪ/	gehoorzamen
calculate werkwoord	/ˈkælkjʊleɪt/	berekenen, uitwerken
axis zelfstandig naamwoord	/ˈæksɪs/	as
mathematical bijvoeglijk naamwoord	/ˌmæθ(.ə)ˈmæt.ɪ.kəl/	wiskundig
histogram zelfstandig naamwoord	/ˈhɪstəˌɡɹæm/	histogram
meter zelfstandig naamwoord	/ˈmitəɹ/	meter, teller
criterion zelfstandig naamwoord	/kɹaɪˈtɪɹ.i.ən/	criterium

Phrasal verbs die je zult horen

Woord	Betekenis
end up werkwoord	belanden, terechtkomen
come back werkwoord	terugkomen
come up with werkwoord	bedenken, verzinnen
go down werkwoord	afdalen
slow down werkwoord	afremmen

Zinnen om te herhalen

Korte, volledige zinnen uit de video die je in alledaagse gesprekken kunt gebruiken:

So why can't we prove the conjecture true?
Could it be because it's not true?
Come on, really we can't solve this?

Grammatica in deze video

De structuren die de spreker het meest gebruikt, met de exacte woorden uit de video:

Structuur	In de video
Present perfect have/has + voltooid deelwoord — iets uit het verleden dat nu nog telt	have been · have modified · has been found
Lijdende vorm be + voltooid deelwoord — het gaat om wat er gebeurt, niet om wie het doet	are warned · are called · is called
Betrekkelijke bijzinnen who / which + zin — extra informatie over een persoon of ding	four, which is · true, which means · complete, which means

Uitspraak om op te letten

De spreker gebruikt 41 samentrekkingen en verkorte vormen, zoals we're, can't, doesn't. Spreek ze kort uit, zoals je ze hoort.

De “th”-klanken: mathematician /ˌmæθ.(ə.)məˈtɪʃ.ən/, mathematical /ˌmæθ(.ə)ˈmæt.ɪ.kəl/, theorem /ˈθiərəm/, algorithm /ˈælɡəɹɪðm̩/, logarithm /ˈlɑ.ɡə.ɹɪ.ð(ə)m/
De klanken “sh” en “zh”: mathematician /ˌmæθ.(ə.)məˈtɪʃ.ən/, fraction /ˈfɹæk.ʃən/, fluctuation /flʌkt͡ʃuːˈeɪʃən/, repetition /ˌɹɛp.əˈtɪʃ.ən/, rotation /ɹoʊˈteɪʃən/
Lange woorden — let op de klemtoon: mathematician /ˌmæθ.(ə.)məˈtɪʃ.ən/, infinity /ɪnˈfɪnɪti/, mathematical /ˌmæθ(.ə)ˈmæt.ɪ.kəl/, criterion /kɹaɪˈtɪɹ.i.ən/, interactivity /ɪntəɹækˈtɪvɪti/

Klanken die Nederlandstaligen lastig vinden:

Stemhebbende eindmedeklinker — /b/, /d/, /g/, /z/, /v/ niet verscherpen: disprove /dɪsˈpɹuv/, anticlockwise /ˌæn.tɪˈklɑkˌwaɪz/, clockwise /ˈklɒkwaɪz/, seaweed /ˈsiwid/, downward /ˈdaʊnwɚd/
/æ/ — opener dan de Nederlandse “e”: mathematician /ˌmæθ.(ə.)məˈtɪʃ.ən/, graph /ɡɹæf/, calculate /ˈkælkjʊleɪt/, axis /ˈæksɪs/, mathematical /ˌmæθ(.ə)ˈmæt.ɪ.kəl/
/g/ — een harde plofklank, geen Nederlandse “g”: graph /ɡɹæf/, histogram /ˈhɪstəˌɡɹæm/, algorithm /ˈælɡəɹɪðm̩/, exhaustively /ɛɡˈzɑ.stɪv.li/, irregularity /ɪˌɹɛ.ɡjʊˈlæ.ɹɪ.ti/

Zo oefen je met deze video

Luister de hele video één keer zonder te spreken en noteer de woorden die je niet kent.
Begin op 0,75× snelheid, spreek zin voor zin na en ga terug naar normale snelheid zodra het makkelijk gaat.
Neem jezelf op en vergelijk met het origineel; let daarbij op woorden als conjecture, mathematician, multiply.

Wat is de Shadowing-techniek?

Shadowing is een wetenschappelijk onderbouwde taalleermethode die oorspronkelijk is ontwikkeld voor professionele tolkentraining en gepopulariseerd door polyglot Dr. Alexander Arguelles. De methode is eenvoudig maar krachtig: je luistert naar native Engelse audio en herhaalt het onmiddellijk hardop — als een schaduw die de spreker volgt met slechts 1–2 seconden vertraging. In tegenstelling tot passief luisteren of grammaticadrills, dwingt shadowing je hersenen en mondspieren om echte spraakpatronen tegelijkertijd te verwerken en te reproduceren. Onderzoek toont aan dat het de uitspraaknauwkeurigheid, intonatie, ritme, verbonden spraak, luisterbegrip en spreekvaardigheid aanzienlijk verbetert — waardoor het een van de meest effectieve methoden is voor IELTS Speaking-voorbereiding en echte Engelse communicatie.

Shadowing-techniek: lees de volledige stap-voor-stap-gids →

Shadowing Practice: The Simplest Math Problem No One Can Solve - Collatz Conjecture - Learn English Speaking with Video

Something is jamming GPS over Europe. Here's what we found

The Absurd Engineering Behind the Internet

Why It Was Almost Impossible to Make the Blue LED

You've (Likely) Been Playing The Game Of Life Wrong

We're trying something new...

How does light 'know' the shortest path?

The CIA's new tech doesn't make sense

Why does every mammal get 1 billion heartbeats in their life?

Why Cold Drinks Were Deadly Before 1914

Exposing The Flaw In Our Phone System

Our Greatest Delusion

The Most Controversial Problem in Philosophy

Why Boredom is Good For You

Why Are 96,000,000 Black Balls on This Reservoir?

We've Been Using The Wrong Science In Court For 50 years

Explaining Pi With Pizza

5 Fun Physics Phenomena

The Most Misunderstood Concept in Physics

Falling ladders - why does this happen?

How a slinky falls in slow motion #shorts

The End of Human Mathematics? AI's Recent Breakthrough -- And What's Next

The Professor Who Taught People How To Think (1962)

Two Sum - Leetcode 1 - HashMap - Python

Mathematician Collapses All Functions to One Weird Formula

Cosmic Insignificance Theory: A Simple Idea That Will Change Your Life Forever

This structure feels impossible to move

25 crazy software bugs explained

A Cosmic Coincidence

What science can’t answer, according to physicist Jim Al-Khalili | Big Think

How to be a creative thinker | Carnegie Mellon University Po-Shen Loh

We Fell For The Oldest Lie On The Internet

Woordenschat en spreektips bij deze les

Belangrijke woorden in deze video

Phrasal verbs die je zult horen

Zinnen om te herhalen

Grammatica in deze video

Uitspraak om op te letten

Zo oefen je met deze video

Wat is de Shadowing-techniek?