humanology 2236 .

Name: humanology 2236 .
Uploaded: 2025-05-14T22:34:05+00:00
Duration: 1 h 19 min 4 s
Channel: Huhnkie Lee
Description: linear combination for least common multiple

Huhnkie Lee

5/14/2025

linear combination for least common multiple

Category

🦄

Creativity

Transcript

Display full video transcript

00:00:00Hello friends, welcome to Humanology 2236

00:00:08Happy Wednesday? Is it Wednesday already?

00:00:13Okay

00:00:17Okay

00:00:22Yeah, so we get back to mathematics in this episode later on

00:00:35We proved the common divisor SAT theorem yesterday, which is great

00:00:43Today we'll make some connection with

00:00:46Bezu theorem, like Bezu coefficient, Bezu linear combination theorem

00:00:54as we can rename it as such

00:00:56But before that I need to find that whiteboard, you'll be like treasure hunting

00:01:01Okay, so I need to find that whiteboard where we came up with an algorithm to find Bezu coefficient

00:01:09and also the generic version of that

00:01:12That is more efficient than what's known to mainstream mathematicians

00:01:17Okay, so

00:01:18Yeah, I'll look for it later

00:01:20Okay, but for now let's do

00:01:22Sorry about math here

00:01:25Gosh

00:01:27It's so horrible

00:01:29Okay

00:01:32We'll do some stretching

00:01:33Yeah, I did some running this morning

00:01:35So we'll do some stretching and then we'll get back to mathematics

00:01:38It's okay

00:01:39Okay

00:01:40Okay

00:01:41Go ahead

00:01:42Okay

00:01:43Okay

00:01:44Okay

00:01:45All right

00:01:48All right

00:01:53Some stretching

00:01:55I'm stretching, yeah, I might have some interviews in the near future as a, you know, because

00:02:10I'm looking for a lawyer job, so I did look up some in the internet like common lawyer

00:02:17interview questions, yeah, I keep studying that, interesting, you know, to get ready for the

00:02:25interviews, so no matter what job you apply to, yeah, look for some interview

00:02:30questions in that area of your career, okay, so that you get ready, okay, yeah, it's fun to

00:02:41prepare for interviews, yeah, actually, we did that several weeks ago, right, here, yeah,

00:02:49yeah, uh-huh, yeah,

00:02:54uh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh-huh

00:03:24Oh, oh, oh, oh, oh, oh, oh.

00:03:54Oh, oh, oh, oh, oh, oh.

00:04:24By the way, I remember the name of the creek, Midtown Anchorage, Campbell Creek, okay, yeah.

00:04:34Downtown Anchorage, the creek, Chester Creek, I think.

00:04:39Those are really nice creeks, yeah.

00:04:42Oh, yeah.

00:04:43Mm-hmm.

00:04:44Yeah, there's some salmon raw in those creeks sometimes.

00:04:48I've seen them.

00:04:49Yeah.

00:04:55Uh-huh.

00:04:56Uh-huh.

00:04:57Uh-huh.

00:05:01Uh-huh.

00:05:05Uh-huh.

00:05:19Okay.

00:05:27Okay.

00:05:28Okay.

00:05:41Okay.

00:05:41What time is it?

00:06:08It's noon.

00:06:09Yeah.

00:06:11Yeah, I woke up early in the morning and offered to one job, like online, in the internet

00:06:26web page.

00:06:27And then I went back to bed.

00:06:32Yeah.

00:06:34Okay.

00:06:39Let's see.

00:06:46Okay.

00:06:56Okay.

00:06:58Visual exercise.

00:07:00Two exercises.

00:07:05Okay.

00:07:10One, two exercises.

00:08:28Now for more additional exercise, let's do some jumping.

00:08:34Okay.

00:08:36Make sure there's no objects around.

00:08:40Jumping, okay?

00:08:42Okay.

00:08:52Nice.

00:08:54Five minutes.

00:08:58Woo!

00:09:00Good exercise, you know?

00:09:02Booyah!

00:09:04All right.

00:09:10All right.

00:09:12All right.

00:09:14All right.

00:09:16All right.

00:09:18All right.

00:09:20All right.

00:09:22All right.

00:09:24All right.

00:09:26All right.

00:09:28All right.

00:09:30All right.

00:09:32All right.

00:16:47Can we...

00:16:49Can we express this common multiple as linear combination of two input numbers?

00:16:52Okay, let's look it up in the internet.

00:16:55Okay, so...

00:16:57Let's see if...

00:16:59Let's see if somebody already explored that area.

00:17:03Okay, okay, okay, so...

00:17:05I don't know if...

00:17:06Okay, but...

00:17:09I don't know if...

00:17:10I don't know...

00:17:11I don't know if...

00:17:15I don't know if...

00:17:19I don't know whether somebody already asked that question before.

00:17:23They may have.

00:17:24We found out soon enough.

00:17:26Maybe they asked that question and also answered it.

00:17:29Who knows?

00:17:30Let's see.

00:17:35Common multiple as linear combination.

00:17:45Well, there's some Google suggestion

00:17:48that means somebody will look for it.

00:17:50OK.

00:17:56Bezo identity.

00:18:00OK.

00:18:00LCM cannot be expressed as linear combination in the same way.

00:18:10Well, LCM is not.

00:18:12OK.

00:18:18But here, this part is wrong in the AI, OK?

00:18:26So the Bezo expression is not a unique representation of it.

00:18:32of linear combination, OK?

00:18:34There are infinitely many, OK?

00:18:36Yeah.

00:18:37Which is also well known, OK?

00:18:38But yeah, this part is wrong.

00:18:39OK.

00:18:40OK.

00:18:41OK.

00:18:42OK.

00:18:43OK.

00:18:44OK.

00:18:45OK.

00:18:46OK.

00:18:47What's the citation?

00:18:48OK.

00:18:49It's not a unique representation of linear combination, OK?

00:18:50There are infinitely many, OK?

00:18:51Yeah.

00:18:52Which is also well known, OK?

00:18:53But yeah, this part is wrong, OK?

00:18:54But yeah, this part is wrong.

00:19:13OK.

00:19:14What's the citation?

00:19:15Howíciosramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramatramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramramram

00:19:45Well, inner tab, new tab, to take a look at this.

00:20:45Yeah, here is this LIDAR, Euclidean Division.

00:21:09Yeah, this kind of looks like linear combination.

00:21:17I did notice that quite recently, about a week ago.

00:21:21Mm-hmm.

00:21:29That's helpful.

00:21:31Well, let's explore this area, okay?

00:21:41Okay.

00:21:42We'll try to express this common multiple of two numbers in terms of linear combination

00:21:51of those two numbers, okay?

00:21:53So, I'm curious.

00:21:54If that's possible, then that means we defeat that AI result, okay?

00:22:01If that's not possible, yeah, let's see why that's not possible.

00:22:05Okay.

00:22:06Let's find some whiteboard tunes.

00:22:15Let's find some whiteboard tunes.

00:22:22Yeah, here we have some project in Obeyence.

00:22:34Yeah, we kind of like started this sub project, but we'll continue that later.

00:22:43So, we're not going to erase, but we'll use just this empty space.

00:22:47As necessary, we'll get back to it, okay?

00:22:49Cheers.

00:22:51Cheers.

00:22:52Cheers.

00:22:53Cheers.

00:22:54Cheers.

00:22:55Cheers.

00:22:56Cheers.

00:22:57Cheers.

00:22:58Cheers.

00:22:59Cheers.

00:23:00Cheers.

00:23:01Cheers.

00:23:02Cheers.

00:23:03Cheers.

00:23:04Cheers.

00:23:05Cheers.

00:23:06Cheers.

00:23:07Cheers.

00:23:08Cheers.

00:23:09Cheers.

00:23:10Cheers.

00:23:11Cheers.

00:23:12Cheers.

00:23:13Cheers.

00:23:14Cheers.

00:23:15Cheers.

00:23:16Cheers.

00:23:17Cheers.

00:23:18Cheers.

00:23:19Cheers.

00:23:20Cheers.

00:23:21Yeah, interesting problem, I'm excited, least common multiple, our brand new notation,

00:23:49a lambda b, least common multiple of a and b, can it be expressed as ax plus by, where a, b, x, y, they're all integers, okay, it could be negative or positive, whatever, zero, whatever.

00:24:16Okay, yeah, if you want to work on this, go for it, okay, now let me start preparing my lunch.

00:24:27Are you okay?

00:24:34Yeah, five minutes break, thank you.

00:24:37Okay.

00:24:40Okay.

00:36:49Okay.

00:37:19Yeah.

00:37:49Now let me...

00:38:18Okay.

00:38:48Gamma...

00:39:48Okay.

00:40:18You can just...