humanology 2111 .
Category
🦄
CreativityTranscript
00:00:00Hello, friends. Welcome to Humanize 2111. Happy Monday.
00:00:08Uh, let's see.
00:00:20Uh, martial arts? Hmm. What kind of martial arts?
00:00:25Okay.
00:00:27Let's do a side kick as fast as possible.
00:00:32Focusing on the speed, okay? Yeah.
00:00:37Kind of Bruce Lee, Jeet Kune Do style, okay? Yeah.
00:00:40How about that?
00:00:51Not as good as Bruce Lee, but now it's okay.
00:00:54Okay. Good exercise there, okay? Yeah.
00:00:56Five minutes break, please. Thank you.
00:01:05All right.
00:01:24Oh.
00:01:54Oh.
00:02:16Oh.
00:02:40Oh.
00:03:10Oh.
00:03:40Oh.
00:03:50Oh.
00:04:00Oh.
00:04:10Oh.
00:04:20Oh.
00:04:44Oh.
00:04:54Oh.
00:05:16Okay.
00:05:21Welcome. Happy Monday.
00:05:23Well, let's talk about Indonesia's natural disasters, right?
00:05:27Yeah, I'm very, again, very sorry about hurricane situation in eastern coast.
00:05:34In Arasa, we have an earthquake, okay? We don't have hurricane.
00:05:38Flooding, not really.
00:05:40Yeah, so Machu Valley, where I live, okay, we have earthquakes, okay?
00:05:48And some other parts of Alaska landslide.
00:05:54Sorry about that.
00:05:57So is there a place in America where there's absolutely no natural disasters?
00:06:06In the western coast, yeah, wildfire, right, or human-caused fire.
00:06:17But not as much as Alaska.
00:06:20And eastern coast, hurricane.
00:06:30Maybe Texas.
00:06:34Or maybe Alabama or Wyoming, Montana.
00:06:41Maybe they don't have natural disasters.
00:06:45Some parts of America have tornadoes, like Tornado Valley, the Midwest.
00:06:56But I guess there are some states, plus Maine, they don't really have natural disasters like that, okay?
00:07:05Yeah, maybe moving to those places would be a good idea, okay?
00:07:11If places get too frequent natural disasters, maybe it's time to move out of there, you know?
00:07:23How about Alaska?
00:07:26We do have earthquakes, okay?
00:07:30But the damage it caused, in my case, I was at work, so bookshelf fell on top of my back.
00:07:40It was ouch, but no broken bones.
00:07:44Next time I was scared, I go under the desk, like, right away.
00:07:48I was like, eh, we'll stop.
00:07:51That was my mistake, okay?
00:07:52I should have known better.
00:07:56I waited until it got really worse.
00:07:58Next time, I go under the desk, like, right away.
00:08:03Because before big tremor, there's small tremor, you know?
00:08:07Next time, I'll move the bookshelf.
00:08:10But when it comes to damage, yeah, in my workplace, some cracked walls, you know?
00:08:22In my house, there is absolutely no cracked walls, you know?
00:08:27Okay, okay.
00:08:31The only thing was some of these liquor cups fell to the floor.
00:08:41That's it.
00:08:42That was that.
00:08:44Nothing else.
00:08:45No broken glasses, no nothing.
00:08:48Why?
00:08:50I asked my friends who know about earthquakes, okay, in Alaska.
00:08:55It has to do with the foundation of the place, like, beneath this house.
00:09:01Maybe it's more rocky, hard rock foundation.
00:09:05Maybe that's why.
00:09:07But it's kind of like what you just said, like, castle built upon a sand, right?
00:09:13So, yeah, some places have very soil-based ground.
00:09:22Yeah, it does get damaged on a lot of occasions, so, yeah.
00:09:33I don't want to move out of Alaska just because of earthquakes.
00:09:35It's not that common, anyway.
00:09:37So, I think I can handle it.
00:09:47Yeah.
00:09:54I'll be more careful next time, yeah.
00:09:56I'll just go under the desk, like, right away and move away from those bookshelves.
00:10:05Bookshelves, they bounce off a wall, okay, and then fall, okay?
00:10:08Yeah.
00:10:11That's what happened when I was at work.
00:10:14I think it was 2018.
00:10:18Mm-hmm.
00:10:24Yeah.
00:10:31But building damage, mostly it was just cosmetics.
00:10:35Cosmetic damage, like cracks on the wall.
00:10:38Not some structural damage.
00:10:41Cosmetic.
00:10:44Yeah.
00:10:50Yeah.
00:10:52Refill that.
00:10:56Anything else?
00:10:59Need to be refilled.
00:11:09Ooh.
00:11:13We can get back to mathematics today, yeah.
00:11:17So we can upgrade from there.
00:11:22Yeah.
00:11:36Okay.
00:11:53Yeah, this computer is doing virus scan.
00:11:57That's why it's running the fan.
00:11:59We'll just let it run like that.
00:12:02Yeah, though.
00:12:04Anti-virus software, let's do this job.
00:12:06Sure.
00:12:09Okay.
00:12:13Okay.
00:12:18Five minutes, thank you.
00:12:20We'll continue from where we left off of last time.
00:12:25Yeah.
00:12:26Yeah, five minutes, thank you.
00:12:55Yeah.
00:12:58Yeah.
00:15:27I worked with...
00:15:31I worked out the FEC filing and then switched the 3.0 plug-in
00:15:39with my car heating pad.
00:15:42That's enough.
00:15:45I took a bath yesterday, of course.
00:15:48Okay.
00:15:50Let's go.
00:15:55I'm excited.
00:16:02So this time we are focusing on X.
00:16:04We are focusing more on K, okay?
00:16:06So, yeah.
00:16:11Uh-huh.
00:16:23All right, 16, 15, 7, 1, 7.
00:16:33We got seven of that.
00:16:34Good.
00:16:36Go to the next case.
00:16:45Yeah, like row distribution theorem, you use that.
00:16:48Yeah.
00:16:50That comes in handy.
00:16:53Okay.
00:17:00Let me stop drinking a little bit.
00:17:12Happy Monday.
00:17:35Cheers.
00:17:41Nice.
00:17:43Very spring taste.
00:17:47Very fresh.
00:17:49All right, let's go to 17.
00:18:02Yeah, first one, we just skip it, okay?
00:18:17Let me just do it.
00:18:2818.
00:18:42Okay.
00:18:48Let's go to 19.
00:19:12Okay.
00:19:26So we have enhanced algorithm here.
00:19:3517K.
00:19:42Row 7 is equal to plus minus 1, meaning 1 or 6.
00:19:536 and 7 is minus 1, like row 7, right?
00:19:55Yeah, so.
00:19:57And 17 is 17 row 7.
00:20:02Yeah, 3.
00:20:04Now we have enhanced algorithm, okay?
00:20:06So now 3K row 7 is either 1 or 6.
00:20:17Okay?
00:20:18Yeah.
00:20:19What is K?
00:20:202.
00:20:24Okay.
00:20:26If K is 2, you slowly set...
00:20:47It didn't quite work, actually.
00:20:502 times 17, 34.
00:20:5334 plus minus 1, that's odd number.
00:20:56That's not even number.
00:20:57So yeah, whatever reason, it didn't work.
00:21:01Okay, so maybe this method doesn't always work.
00:21:06Okay.
00:21:07Yeah, well, cheers.
00:21:09Yeah.
00:21:30Oh, I'm sorry, I'm sorry.
00:21:35We are not doing row 7 here.
00:21:37Why are we doing row 7?
00:21:44We are supposed to do row 2.
00:21:48My bad.
00:22:0217 row 2, 1.
00:22:05Okay.
00:22:09K should be 1 then.
00:22:15Okay.
00:22:16Now, 2x is equal to 17 minus 1, 16.
00:22:26So x is 8.
00:22:29Okay?
00:22:30True?
00:22:40Well, actually minus 8, because we adopt minus 1, okay?
00:22:45Okay.
00:22:53Now, 18 times ... 19 times 8.
00:23:04Numbers start to get real big.
00:23:06Okay, so ...
00:23:1272 plus 80.
00:23:17152.
00:23:23Okay?
00:23:25And 152 plus 1 will be 17 times something, okay?
00:23:29So ...
00:23:41153.
00:23:47Yeah, 6.
00:23:56No?
00:23:58Oh, 9, 9, sorry.
00:24:04Okay?
00:24:07Now ...
00:24:13Let's manually verify if it's really 8 is the smallest number here, okay?
00:24:18Because ...
00:24:22Yeah, so it seems that we have working algorithm, okay?
00:24:26Now let's verify it, okay?
00:24:28To make sure this is smallest.
00:24:29That's a good question, okay?
00:24:30Yeah, cheers.
00:24:31Good.
00:24:32We are making great progress here, okay?
00:24:4119.
00:24:4319 is multiples.
00:25:03Okay?
00:25:17Okay.
00:25:30Okay?
00:25:33Multiples 7, 10.
00:25:487, 10.
00:26:087, 10.
00:26:137, 10.
00:26:18Okay, difference between 1 ...
00:26:41Yeah, it's the smallest one.
00:26:43Good.
00:26:45Yeah, we got it.
00:26:46We have algorithm now.
00:26:47Now let me explain that to you after 5 minutes break, okay?
00:26:50Yeah.
00:26:51If you want to decipher this, go for it.
00:26:53If you want to, okay, go.
00:26:55Yeah, 5 minutes break.
00:26:57Oh, yeah, good progress there.
00:27:00Mm-hmm.
00:27:04Okay.
00:27:07Here we go.
00:27:09Very cool.
00:27:13Yeah, I explained the algorithm to you after 5 minutes break.
00:27:18But if you want to come up with decipher this, go for it, okay?
00:27:22After that, we come up with formula based on that algorithm, okay?
00:27:26Yeah.
00:27:275 minutes.
00:27:29Nice.
00:27:30Very nice.
00:27:31Thanks.
00:28:01Bye-bye.
00:28:31Bye-bye.
00:29:01Bye-bye.
00:29:31Bye-bye.
00:30:01Bye-bye.
00:30:31Bye-bye.
00:31:01Bye-bye.
00:31:31Bye-bye.
00:32:01Bye-bye.
00:32:31Bye-bye.
00:33:01Bye-bye.
00:33:32Bye-bye.
00:33:35Bye-bye.
00:33:38Bye-bye.
00:33:41Bye-bye.
00:33:44Bye-bye.
00:33:47Bye-bye.
00:33:50Bye-bye.
00:33:53Bye-bye.
00:33:56Bye-bye.
00:33:59Bye-bye.
00:34:02Bye-bye.
00:34:05Okay.
00:34:07Yeah.
00:34:08So we got the algorithm.
00:34:09Fantastic.
00:34:10We've been looking for, by now, like weeks.
00:34:15Okay.
00:34:18What is this algorithm for?
00:34:21To find the principal Bezier coefficients.
00:34:24Okay.
00:34:25Yeah.
00:34:26I thought we would get the left Bezier principal coefficient first, and then right one.
00:34:32Actually, it's the other way.
00:34:35We get, according to this algorithm, we calculate the right Bezier coefficient principle, the
00:34:40smallest one, okay?
00:34:42And then we find the left Bezier coefficient, okay?
00:34:45Yeah.
00:34:46Cheers.
00:34:47Yeah.
00:34:50Mm-hmm.
00:35:01But cheating a little bit for now.
00:35:06Okay?
00:35:07We need to know what the greatest common divisor is first.
00:35:11Okay?
00:35:12So given that we know what the greatest common divisor is, then we can calculate the principal
00:35:21Bezier coefficients.
00:35:22Okay?
00:35:23Next step would be, okay, there are infinitely many Bezier coefficients for a given pair
00:35:28of numbers.
00:35:29Okay?
00:35:30Then how to calculate the rest of Bezier coefficients, starting from the principal
00:35:35Bezier coefficients.
00:35:36Okay?
00:35:37That would be our next step.
00:35:38Okay?
00:35:39Yeah.
00:35:40Cheers.
00:35:41Yeah.
00:35:42It's like x-axis, y-axis expansion.
00:35:46Okay?
00:35:47Cheers.
00:35:48Yeah.
00:35:49Mm-hmm.
00:35:50Okay.
00:35:51So in this particular example, we are dealing with greatest common divisor of 17 and 19.
00:36:07Smaller number, we call it base.
00:36:10Larger number, we call it other ones, of gamma function, greatest common divisor function.
00:36:14Okay?
00:36:15Now, the GCD of 17 and 19 is 1.
00:36:22Okay?
00:36:23Yeah.
00:36:25Then, how to calculate right principal Bezier coefficients?
00:36:36It's like this.
00:36:3919 minus 17, 2.
00:36:43The difference between two infinite numbers.
00:36:45Okay?
00:36:46Yeah.
00:36:47Okay?
00:36:48So that's the base of rho, rho 2.
00:36:51The argument of rho operator would be GCD, which is 1, times k.
00:37:02Okay?
00:37:03Yeah.
00:37:04And, so 2 times x, x is left Bezier coefficient, k is right Bezier coefficient.
00:37:26Okay?
00:37:27So 2 times x is equal to 17 times k plus minus 1.
00:37:33This 1 comes from GCD.
00:37:35Okay?
00:37:36Yeah.
00:37:49But minus 1 is same as, in rho 2, minus 1 is same as 1, rho 2.
00:37:55Okay?
00:37:56Yeah.
00:37:57So, yeah.
00:37:581 times k rho 2 is equal to 1.
00:38:01Okay?
00:38:03In this particular case.
00:38:08What is k?
00:38:09Sum of this k?
00:38:101.
00:38:16Yeah.
00:38:23Next k, 3.
00:38:27Okay?
00:38:29Well, then we have formula for more generic Bezier coefficient.
00:38:34Let's do that.
00:38:35Let's go for it.
00:38:36If k is 3.
00:38:452x is equal to 17k plus minus 1.
00:38:56Okay?
00:38:58So that's, we have 51 here, so we adopt minus 1.
00:39:06So 51, 50, x is 25.
00:39:16Okay?
00:39:22And let's calculate that.
00:39:24And?
00:39:27And in terms?
00:39:40Booyah!
00:39:55Booyah!
00:40:09Okay.
00:40:25But wait a minute.
00:40:29When previously k was 1.
00:40:33Okay, it's not left Bezier coefficient.
00:40:36Okay, it's not, it's not.
00:40:37Okay, okay.
00:40:38My bad.
00:40:39It is complicated procedure.
00:40:41Okay?
00:40:42So, k is not right Bezier coefficient.
00:40:46Okay?
00:40:47Yeah.
00:40:55Okay.
00:41:00Okay.
00:41:0619 times 25.
00:41:12It's 20 minus 1 times 25.
00:41:24500 minus 25
00:41:27475, okay?
00:41:30Now, 476 is equal to
00:41:3517 times
00:41:379 plus 17, okay?
00:41:56What is 9 plus 17?
00:41:5826?
00:42:08But that's not true.
00:42:12How about 9 plus 19?
00:42:17Yeah, that would make sense.
00:42:20That would be 28.
00:42:24Yeah, it seems to be working, okay?
00:42:29So
00:42:3430 minus 2
00:42:37times 17
00:42:39equal to
00:42:46510
00:42:50minus
00:42:5234
00:42:59minus 476, okay?
00:43:05Yeah?
00:43:07So the rest of the best coefficients, yeah, just add 17 here
00:43:10and add 19 here, okay?
00:43:12Yeah, that seems to be working.
00:43:14Okay, good.
00:43:16Okay, so, nice.
00:43:20Cheers, yeah.
00:43:26Now, we don't have to make any more examples anymore.
00:43:30We got the algorithm.
00:43:33Our next step, yeah, to express this algorithm as a mathematical formula.
00:43:38Okay?
00:43:45Okay.
00:43:47Time check.
00:43:54Yeah, the antiviral software is scanning the computer, I guess.
00:43:57It's still running.
00:43:58I didn't let it run.
00:44:06It's been less than one hour.
00:44:07Okay, good.
00:44:08Yeah, five minutes break, please.
00:44:11Very good progress today.
00:44:13Yeah, it's about time.
00:44:17It all paid off, our hard work, making many examples.
00:44:22Then we started recognizing some pattern in the calculation, right?
00:44:25So it worked, yeah?
00:44:27Systematic enumeration method, okay?
00:44:30Five minutes, thank you.
00:44:41I see some fruits right there.
00:44:43Let me get it.
00:44:56Okay.
00:49:47Okay.
00:49:48Let's get on to the new iPod and then we'll have more space and kind of formulate this
00:50:02algorithm, okay?
00:50:07ZM approach kind of outdated so we can erase this yeah this approach it didn't
00:50:16quite work okay but I think it's safe to erase it okay
00:50:23don't record it anyway so you guys very nicely
00:50:43yes quite like whiteboard
00:50:53you
00:51:06yeah
00:51:15you good enough right
00:51:18good
00:51:25wash my hands
00:51:43yeah
00:51:46okay
00:51:51okay
00:51:55Cheers
00:51:58you
00:52:10so let's use the example that we did not tonight but last time couple days ago
00:52:2823 and 17
00:52:3223 and 16
00:52:51well
00:52:55let's do just new example okay about
00:53:13ah such a big project let's do just 23 and 16 okay
00:53:25Cheers
00:53:45how about this 22 and 16 yeah when GCD is 2
00:53:5422 and 16
00:53:59okay so 22 is equal to 16 plus 6 so 6 times X is equal to
00:54:2316 times K plus minus GCD 2 okay now
00:54:36next
00:54:4516 times K
00:54:54you
00:55:06rule
00:55:09six
00:55:13okay
00:55:16K2 argument 16 base the remnant we just call it C the difference okay because
00:55:29it's difference let's call it D
00:55:34because the difference between argument and the base okay so so okay
00:55:46you
00:55:48now six this should be
00:55:55you
00:56:05to or minus two and minus two is same as four row six okay
00:56:18and 16 row six is four okay so we reduce that the 4k
00:56:30row six is either two or four the smaller the better
00:56:38in this case yeah K is equal to one to make it four okay
00:56:45now from there K is one
00:56:50okay so 16 plus minus 2 becoming multiples 6 16 minus 2 14 that's not it
00:57:0116 plus 2 that's it okay so we adopt plus 2 and then X is 3
00:57:09okay
00:57:12so 22 times 3 plus and we adopt plus that's plus 2 that's why it's plus 3
00:57:21okay okay this is a long algorithm okay that's why most likely nobody found
00:57:28this as far as I know okay but it's possible somebody has discovered this
00:57:34before we did I don't know to be honest I don't care
00:57:39let's just have a fun okay yeah cheers
00:58:01and the right value coefficient how do we calculate that
00:58:09you
00:58:14okay 22 times 3
00:58:21we are going back and forth left and right left and right okay so that's like
00:58:2566 right okay now the because this is positive right
00:58:34you should add 2 okay so 68 divided by 16. 4 okay
00:58:49there we go
00:58:52you can't do yeah we are good Wow it is a lot of work okay this is not a
00:59:07very difficult algorithm but it's not very high easy either it's like
00:59:10intermediate difficulty okay what you found it cheers
00:59:23we also we found algorithm to find the principal value coefficient pair given
00:59:31that we know the GCD already okay that's fine for now
00:59:40yeah
00:59:46yeah cheers
00:59:52and we also found algorithm given one principal best coefficient yeah we can
00:59:59calculate infinitely many best coefficient from there okay
01:00:04very good
01:00:08yeah so two different algorithms okay
01:00:13our next step well now we know how to calculate best coefficient given we know
01:00:19the GCD we enumerate them okay for the principal best coefficients
01:00:27systematically and then just try to find some pattern there so that we can
01:00:33calculate best coefficients without knowing GCD so that's our next project
01:00:40sub project okay this is a big project okay so yeah just divide and conquer one step at a time
01:00:47time check
01:00:54okay it's been more than one hour
01:01:05let's take five minutes break okay and then let's try to come up with a formula
01:01:11for this algorithm
01:01:16if you want to do it go for it okay yeah five minutes break
01:01:20yeah very good progress today awesome
01:01:27good Monday today yeah
01:01:34there we go five minutes thank you nice very nice
01:01:46you
01:02:16you
01:02:46you
01:03:16you
01:03:38you
01:03:46so I have seen other web pages that study the best coefficients but not as
01:03:54extensive as this okay so other mathematicians may have thought best
01:04:01coefficient world world is like a small island what we discovered is that it's a
01:04:07big continent it's not a small island no this is a humongous continent yeah
01:04:14cheers yeah
01:04:22hmm this is tip of iceberg
01:04:29okay
01:04:34you know let's digitize this okay and then we did a lot
01:04:41look at this during the digitization process okay and then share with you
01:04:46okay okay see you soon or see you tomorrow thank you
01:04:53what's important yeah good rest yeah after work I lie down and for like 20
01:05:01minutes 10 minutes if I'm really tired I take a nap or just lie down rest after
01:05:08work to reset okay resting is so important okay yeah I don't know how I
01:05:15of course I ran outside okay so exercise rest work study and good rest and play
01:05:25good hobbies okay socialization okay see you later thank you yeah very cool