Greatest common divisor and least common multiple: building blocks

  Рет қаралды 3,139

Proof of Concept

Proof of Concept

Күн бұрын

Пікірлер: 6
@godchild7490
@godchild7490 2 жыл бұрын
Love this lots.....it really helped me with my math work
@jamesedwards6173
@jamesedwards6173 2 жыл бұрын
I've liked puzzles my whole life, and this is one of my favorites (encountered long, long ago), which this video reminded me of. There are two integers, A and B; both are greater than 1. Mathematician S knows their sum. Mathematician P knows their product. (All they know otherwise is what you’ve just been told.) The following conversation ensues. S says to P: "You don't know A and B." P says to S: "Now I do know A and B." S says to P: "Now I know A and B, too." What are the values of A and B (that result in a minimal sum)?
@atifachaudhry
@atifachaudhry Жыл бұрын
The example at 8:21 of gcd of the two large numbers is stated as 7, yet both these numbers are even, so the gcd should be even.
@martinjaskulla5688
@martinjaskulla5688 3 жыл бұрын
Amazing!
@sidharthgopalakrishnan6718
@sidharthgopalakrishnan6718 2 жыл бұрын
Regarding the pop quiz question. How is it a yes ? Let me show using a example. For example if I take 6 and 9 , 6 = 2 x 3 9 = 3 x 3 hence gcd is 3 but as per your proposition ANY other divisor of a and b ie 2 must also divide gcd ( 6,9) which is false so am I mis understanding your proposition or did you mean ANY common divisor ? Great explanation btw it is really intuitive.
@marthanelis225
@marthanelis225 2 жыл бұрын
I think it has to be a common divisor, so 2 should be a divisor of 6 AND 9 to be a divisor of the greatest common divisor. Since 2 isn't a divisor of 9, it indeed does not divide the gcd (6,9)
The Euclidean Algorithm:  How and Why, Visually
13:29
Proof of Concept
Рет қаралды 37 М.
Rethinking the real line #SoME3
14:54
Proof of Concept
Рет қаралды 100 М.
小丑教训坏蛋 #小丑 #天使 #shorts
00:49
好人小丑
Рет қаралды 54 МЛН
黑天使只对C罗有感觉#short #angel #clown
00:39
Super Beauty team
Рет қаралды 36 МЛН
Арыстанның айқасы, Тәуіржанның шайқасы!
25:51
QosLike / ҚосЛайк / Косылайық
Рет қаралды 700 М.
Lehmer Factor Stencils: A paper factoring machine before computers
26:06
Proof of Concept
Рет қаралды 54 М.
Modular Arithmetic: Under the Hood
17:27
Proof of Concept
Рет қаралды 2,3 М.
The Doomsday Algorithm - Numberphile
14:33
Numberphile
Рет қаралды 859 М.
All possible pythagorean triples, visualized
16:58
3Blue1Brown
Рет қаралды 3,9 МЛН
How to Find the Greatest Common Divisor by Using the Euclidian Algorithm
4:10
Learn Math Tutorials
Рет қаралды 1 МЛН
Modular Arithmetic: User's Manual
9:23
Proof of Concept
Рет қаралды 3,1 М.
Simple Explanation of the Birthday Paradox
12:11
Wrath of Math
Рет қаралды 827 М.
GCD, Bezout, and Modular Inverses | The Extended Euclidean Algorithm
22:21
When the PHONE CASE can be your BEST FRIEND! #shorts
0:33
One More
Рет қаралды 18 МЛН
DID YOU NOTICE ANY LAPSES IN THE VIDEO or NOT? / MARGO_FLURY
0:34
MARGO FLURY | Маргарита Дьяченкова
Рет қаралды 12 МЛН
СИЖУ БЕЗ ЕДЫ, ПЬЮ ОДНУ ВОДИЧКУ.
21:37
Быть Добру
Рет қаралды 79 М.
BIP HOUSE  .бип хаус 🥰🏡  #shorts
0:13
bip_house
Рет қаралды 1,2 МЛН
This thing is CRAZY 🤯 #shorts
0:20
House of Highlights
Рет қаралды 48 МЛН