Skip to playerSkip to main contentSkip to footer
Huhnkie Lee
  • 3 days ago
taking a break from mathematics

Category

😹
Fun
Transcript
00:00Hello friends, yeah, welcome to Humanology episode 2254.1.
00:10Yeah, let's go with InSangamLive, okay?
00:13So I'm kind of tired a little bit, hungry a little bit,
00:16but I think we can do maybe just a short while.
00:19Sure?
00:21Yeah, we can do that.
00:24Uh-huh.
00:30Because socialization is important, you know, yeah, social activity, so, uh, yeah.
00:40Okay.
00:46And that.
00:51Uh-huh.
00:55Ah.
01:00I think my hair looks as fine as it is, okay?
01:20Yeah.
01:22Sure.
01:23Yeah, let's do this, okay?
01:37Sure.
01:42More water?
01:43Okay.
01:43Okay.
02:01Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:02Okay.
02:04Okay.
02:06Okay.
02:06Okay.
02:06Okay.
02:08Okay.
02:08Okay.
02:10Okay.
02:10Okay.
02:10Okay.
02:11Okay.
02:12Okay.
02:13Hello friends, welcome to Humanology episode
02:43225.4.1 in ceremony. Welcome. Good. Happy Monday evening. Yeah. Good evening. Welcome. Cheers.
03:05Yeah, good evening. And let me show you that
03:11constant time formulas for Bezu coefficients and also co-primality test. Okay. Yeah.
03:27That's that.
03:29Yeah, I mean, we kind of understand the concept behind it, but when it comes to formal proof,
03:39we'll do that later. Okay. Because we are more important business to attend, which is like,
03:45to find constant time formula for greatest common divisor. Okay. So after we find that, then we'll
03:53go ahead and do the formal proof. Okay. Yeah. Yeah. Cheers.
04:01Thank you. Yeah. Yeah. Thank you, friends, mighty proud future leaders,
04:13major arts, education, career development. Yeah.
04:23Okay.
04:25Good times. Yeah.
04:39Now, let's take five minutes break, please. Thank you. Welcome. Five minutes break. Thank you.
04:49Happy Monday evening. Okay. Fantastic.
04:51Okay.
04:53All right. Thanks for listening.
04:55Okay.
04:59Happy Monday evening.
05:01Hey.
05:03Fantastic.
05:04Okay.
05:06Mm-hmm.
05:07Okay.
05:08Okay.
05:10Okay.
05:12Okay.
05:14Okay.
05:15Okay.
05:16Okay.
05:17Hey.
05:18Okay.
09:19Thank you for being so amazing.
09:20You're fantastic.
09:22And thank you for your advice.
09:25And my friends, you're fantastic.
09:29I have to let you go.
09:36That's so easy, not prepared, okay?
09:39Okay?
09:41Yeah, you have to do that, so you cannot do that.
09:51Okay?
09:51Yeah.
09:52All right.
09:54So, yeah.
09:55Yeah, so, yeah, so basically, yeah, like my hair was kind of puffy like this, okay?
10:05Okay.
10:05Yeah, that's how I'll do it.
10:07Okay?
10:07Yes.
10:08Cheers. Okay. Yeah. And let's see. So, this mathematical venue, right?
10:27It's been going very well. We found constant time formula, which is better than the algorithm.
10:43Okay. Constant time formula for basic coefficients and then co-primality tests. Okay. So, next level
10:53project, constant time formula for greatest common divisor. Okay. So, currently it's like logarithmic
11:02time based on like Euclidean algorithm. That's been there for more than 2000 years. Okay. So,
11:11and, but we are ambitious here. So, yeah. We believe it exists and believe we can find it. Okay. Yeah.
11:22Cheers. Yeah.
11:28Yeah. So,
11:40yeah. I worked out some examples for,
11:46I have some hypothesis about it. What's the hypothesis? It's this. Okay.
11:51We calculate alpha and beta values. This is the basic coefficients for the two numbers that are not
11:58co-primes to each other. Okay. And at least one of those two basic coefficients become fractions. Okay.
12:07And then from alpha and beta, we extract the denominators and then divide. Okay. From the above
12:17five examples that I have so far, that division is the same as the greatest common divisor. Okay. Yeah.
12:28So, this working hypothesis, but to extract the denominator of a fraction, well, that itself involves some
12:39greatest common divisor, right? So, it's a little bit incomplete at least. Okay. So,
12:52but we work on that. Okay. So,
12:56because we are getting close. We made great progress.
13:06Constant time formula algorithm for basic coefficients and co-primality,
13:12those two formulas are brand new. Okay. Nobody, nobody other than us know about this. We discovered it. Okay. Yeah.
13:23For the first time in human history. Okay. So, it's something, uh,
13:27great achievement, great discovery there. Okay. But we want to go one step further.
13:33So, cheers. Yeah. And I believe it's possible.
13:51I'm a believer. When I do mathematics, I'm very religious.
13:56And like our friends said, advised us, like, uh, uh, from all around the world, yeah, we receive energy from
14:19people. We get motivation from friends. Yeah. Very true. Yeah. Oh, yeah.
14:29Also, yeah, religion. Very important. Yeah.
14:35Oh, yeah. Yeah. Hope, faith, belief. Yeah. Religious concepts there. She's very good. Okay.
14:49Yeah.
14:59Then, estimated, estimated time of arrival, ETA, for a constant time formula or algorithm for greatest common divisor.
15:13Uh, I would say maybe a month or less. Could be more. Okay.
15:20Yeah.
15:26Is it possible?
15:28Does it exist?
15:30Content time formula or algorithm for greatest common divisor.
15:34Uh, I hope it does exist.
15:39If it exists, we will find it.
15:43Cheers.
15:47Because at this point, I don't even know whether it exists or not.
15:50But the thing is this.
15:55Co-primality test.
16:00Until now, everybody thought that, uh,
16:04it has to be just logarithmic algorithm. That's the Euclidean algorithm. Okay.
16:08The constant time algorithm does not exist. That's what people thought.
16:13I proved them wrong.
16:15Because we found constant time formula algorithm. Okay.
16:21Yeah.
16:22So that's very encouraging news.
16:24Let's not stop here. Let's go one step further. Let's find constant time algorithm or formula for greatest common divisor.
16:35Okay.
16:37Okay.
16:38Yeah.
16:39Which would be more significant discovery.
16:43Okay.
16:43Yeah.
16:48But if we find that, that means we are defeating all the mathematicians that have existed for the past 2000 years and more.
16:58Okay.
17:00We prove ourselves to be better than they are.
17:02They have been.
17:03How many mathematicians have existed in the world the past 2000 years?
17:10A million, maybe?
17:14Yeah.
17:14Welcome.
17:14Good evening.
17:15Happy.
17:19Monday evening.
17:20Yeah.
17:22Yeah.
17:22Future leaders.
17:23Very, uh, genius.
17:26Very smart people.
17:26Yeah.
17:28Okay.
17:29Now, let's take five minutes break.
17:30Okay.
17:30Yeah.
17:31Vocalist.
17:32Okay.
17:32Yeah.
17:33Mighty proud future leaders.
17:35Martial arts.
17:36Education and current development.
17:37Okay.
17:38Five minutes.
17:40Oh, yeah.
17:42Welcome to Human Allergy School.
17:54Bye.
17:56Doug.
17:58Bye.
18:18Hi.
18:19Bye.
19:50Brightness adjustment.
19:53Okay.
19:55Yeah.
20:02So the Bezu coefficient constant time formula, I programmed it in JavaScript using Notepad.
20:10and it's like all of JavaScript okay so yeah so if you have a computer yeah you
20:20can just use program in JavaScript okay so save the notepad text document as an
20:27HTML document like a web page okay and you can run it with the browser
20:33yeah so then what's the game plan to find the constant time formula or algorithm for
20:48greatest common divisor working on more examples and find some patterns okay so
20:56our friends recommended me this wonderful movie pie it's about the
21:03mathematician in Manhattan New York yeah I I did buy that movie in Amazon Prime
21:08it was it cost me like $14 okay so but it was wow okay I I watched about a half of
21:16that movie okay so okay yeah there are some parts in the movie that I did not
21:21like okay but there are some parts I liked it quite inspiring okay yeah
21:29pattern sure yeah just walk out some examples and find some pattern and then
21:37after that we can formulate a formula and then after that prove it right oh yeah
21:49cheers so in the movie hi uh the gentleman there are kind of working on the like stock market
22:04fluctuation price yeah a lot of mathematicians computer scientists physicists go to Wall Street and then I'll work with the traders
22:15Georgia Georgia just let me business yeah welcome good evening yeah my proud future
22:28leaders mm-hmm yeah happy Monday evening yeah cheers
22:40good evening welcome uh when I was in Cornell doing PhD in computer science okay uh uh uh the uh
22:58uh recorders yeah welcome uh from Maryland is a investment bank uh they did uh come invite us uh
23:09uh to recorders like computer science PhDs okay yeah so some of my friends I actually got
23:16job there okay that that's great anything Wall Street sure sure it's legit financial analysts okay
23:26because we are good with numbers okay yeah that helps yeah okay yeah nice yeah cheers
23:39yeah yeah
23:44yeah yeah so well I ended up dropping out of PhD in computer science but later I became a lawyer but uh my friends in computer science PhD program some of them became professors some others
23:56uh uh got a job in like Microsoft uh got a job in like Microsoft uh some others got uh got some jobs in uh
24:16uh Wall Street financial analysts okay yeah that's great nice yeah
24:25uh uh yeah
24:29um
24:30uh
24:30uh
24:32uh
24:41yeah
24:41uh
24:42Yeah, and, and, but quite serious about it, yeah, seriously, yeah.
25:12So, after we find, hypothetically, after we find the, like, constant time formula algorithm
25:28for greatest common divisor, I may get become famous, okay, and that would probably help
25:39my U.S. presidential campaign, because I'm also running for U.S. president, cheers, yeah,
25:53I'm using and fantasizing, yeah, okay, now let's say five minutes break, okay, yeah, vocal rest,
25:58yeah, five minutes break, mighty proud future leaders, fantastic, five minutes, thank you.
26:16Okay.
26:28Okay.
29:34Oh, here may come back a bit.
29:38Yeah.
29:40So in number theory, this was called Lame's theorem.
29:46This says like in Euclidean algorithm, okay, the worst case happens when the two input numbers are two adjacent numbers in Fibonacci sequence, okay?
30:06Yeah.
30:07Yeah.
30:08Yeah, basically the number of row operations, remainder operations, division happens the number of digits in base 10 number of the smaller number of the two.
30:27Okay, so yeah, that's a good result.
30:32I appreciate that.
30:34Yeah.
30:35Yeah.
30:36Yeah.
30:37Yeah.
30:38Yeah.
30:39Yeah.
30:40Yeah.
30:41Yeah.
30:42Yeah.
30:43Yeah.
30:44it's old school okay so 1845 or something like that okay so yeah somewhere there so and then
30:55but the thing is this we discovered a couple days ago by now okay this constant time from
31:07formula for co-primality tests and we know the two adjacent numbers in Fibonacci sequence they are
31:18co-primes okay and to find greatest common divisor of the two adjacent Fibonacci numbers
31:27we know it's one because they are co-primes okay and we can test that constant time
31:36so we don't need Euclidean algorithm for that so we have better results okay yeah cheers welcome
31:45yeah okay okay oh Japan nice yeah have a great time also be safe okay yeah no martial arts okay yeah
31:57cheers yeah mighty proud future leaders yeah yeah Japanese language very interesting right yeah
32:10like katakana hiragana right yeah I know some okay yeah it's nice yeah I've been to Japan twice it's
32:17very nice yeah very nice yeah oh yeah yeah cheers yeah great language Japanese oh yeah yeah nice
32:29okay okay oh yeah great people okay yeah yeah have a good time be safe practice martial arts exercise yeah oh yeah
32:56yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah yeah
33:26Good times, yeah, very cool, yeah, good times, let me grab Anadol Pajkabado,
33:54this is like a crowberry, okay, yeah, with this accumulation of all these vodka bottles and then I'm using them, okay, so,
34:24for this use of all these vodka bottles and that's all I'm using.
34:31because the vodka bottles need, but I don't have the vodka bottles, then I use it.
34:34I'm using this.
34:36I don't know if you have a soda bottle that can be used to it, but I don't want to do this.
34:40So, for adjacent Fibonacci numbers, where the Euclidean algorithm is the worst case scenario,
34:59the longest, the largest number of operations, we don't even need to go through that anymore
35:10because we have constant time formula for co-primality test, and we know two adjacent Fibonacci numbers are co-primes, okay?
35:22We have constant time algorithm for that, okay?
35:24Yeah, welcome, good evening, cheers.
35:26Yeah.
35:32Yeah.
35:35Yeah, future leaders, my proud.
35:38Yeah.
35:40Oh, yeah.
35:42Thank you for joining us, welcome, yeah.
35:46Great people, yeah.
35:49Yeah, my proud, fantastic future leaders, yeah.
35:53Very proud of you, yeah.
35:54You're great, you're amazing, yeah.
35:58Yeah.
36:01Yeah.
36:05Hey.
36:07I'm happy to see you.
36:20Yeah.
36:21Cheers.
36:22So, let's take five minutes, okay?
36:36Okay, vocal rest, necessary, okay?
36:38Yeah, okay.
36:39Time check in telemotion.
36:42Uh, it's been less than one hour, okay, good, good, good.
36:58Uh, it's been less than one hour, okay, good, good, good.
37:01Yeah, bye, Miss Frank, please.
37:05Mighty proud.
37:06You, Charlie George, fantastic.
37:07You, Charlie George, fantastic.
40:40Okay.
40:41Welcome.
40:42Good evening.
40:43Thank you for joining us.
40:46Yeah.
40:47Welcome, welcome.
40:49Yeah.
40:50So, if you want to talk about something else other than mathematics, yeah, let me know.
40:57Okay?
40:58Because otherwise I'll just talk about mathematics.
41:00Okay?
41:01Because that's what I'm working on these days.
41:03Okay.
41:04Okay.
41:05Okay.
41:06It's up to you.
41:07Okay?
41:08Yeah.
41:09Cheers.
41:10Welcome.
41:11Yeah.
41:12What would you like to talk about?
41:13It could be mathematics or it could be something else.
41:14It's up to you.
41:15Okay.
41:16So, yeah.
41:17Yeah.
41:18Okay.
41:19Okay.
41:20Yeah.
41:21Okay.
41:22Okay.
41:23Okay.
41:24Yeah.
41:25Okay.
41:26Okay.
41:27Okay.
41:28Yeah.
41:29Mathematics.
41:30Sure.
41:31Sure.
41:32Let me show you.
41:33Okay.
41:34So, we found a constant time formula for basic coefficients and also co-primality test.
41:43Okay.
41:44Okay.
41:45Yeah.
41:46Uh.
41:47Yeah.
41:48Do all the math.
41:51Right.
41:52Yeah.
41:53Oh, yeah.
41:54So, there was that.
41:58Yeah.
41:59So.
42:00Hmm.
42:01Yeah.
42:02Yeah.
42:03Uh-huh.
42:04Yeah.
42:05Uh-huh.
42:06Yeah.
42:07Uh-huh.
42:09Yeah.
42:10Uh-huh.
42:11Cheers.
42:12Yeah.
42:13Oh, yeah.
42:14So, like, uh, when it comes to that, it's like, yeah, to find, like, greatest common divisor,
42:39right, uh, if this number, smaller number divides the larger number, then that number
42:46is greatest common divisor.
42:48Okay.
42:49Yeah.
42:50There's constant time algorithm.
42:51And if this number is co-prime with the bigger number, then it's greatest common divisor
42:57is one.
42:58Then we call gamma.
42:59Okay.
43:00Yeah.
43:01But there are intermediate cases.
43:03The current number, smaller number, that is neither divides a bigger number, nor co-prime
43:10with the bigger number.
43:11Uh, that's the tricky case.
43:14And, uh, we do not have counter-time algorithm for that yet.
43:20Yeah.
43:21Yeah.
43:22So, that's where we are at in this project.
43:27Yeah.
43:28Yeah.
43:29Yeah.
43:30Cheers.
43:31Yeah.
43:32So, if the smaller number is a divisor of the bigger number, yeah, constant time algorithm,
43:52okay?
43:53If smaller numbers co-prime with bigger number, constant time algorithm for that, yes.
43:58Yes.
43:59But if it's in between, okay?
44:01Uh, we do not have constant time algorithm for that one yet.
44:05Okay.
44:06Uh, that's what we want to find next.
44:10Okay.
44:11Yeah.
44:12Step one, step two, step three.
44:14So, yeah.
44:18Yeah.
44:21Mm-hmm.
44:26Yeah.
44:27Uh, but if you find it, yeah, it's like some kind of award material, but not Fields Medal
44:38in mathematics because, uh, I'm 46.
44:41Okay.
44:42Fields Medal in mathematics, uh, they have age limit.
44:45Something under 30 or something.
44:47I'm 46.
44:48Okay.
44:49So, but yeah, but whatever.
44:52Yeah.
44:53Yeah.
44:54Yeah.
44:55Yeah.
44:56I don't need any medal recognition, appreciation, but I just want to find it.
45:10Constant time formula or algorithm for greatest common divisor.
45:18I just want to find it.
45:20Okay.
45:21After I find it, I write it down, prove it, publish it.
45:25They'll be there.
45:26Okay.
45:27And, uh, I was just happy to find it.
45:28Okay.
45:29To be honest.
45:30Yeah.
45:31It's not necessarily that I become famous or anything.
45:34Yeah.
45:35I just want to find it.
45:36Cheers.
45:37Cheers.
45:38Yeah.
45:39Yeah.
45:40Improve it.
45:41Yeah.
45:42Sure.
45:43Yeah.
45:44Improve it.
45:45Yeah.
45:46Sure.
45:47Yeah.
45:48Yeah.
45:49Yeah.
45:50To me, mathematics is like personal joy.
45:52Yeah.
45:53To me, mathematics is like personal joy, right?
45:55Yeah.
45:56Yeah.
45:57Probably not happy.
46:02Yeah.
46:12Yeah.
46:17Yeah.
46:24Yeah.
46:31Hmm.
46:47You
46:55Okay
47:03How about this I think enough time has passed. Okay, so yeah
47:07Yeah, daily motion friends. Yeah, I'll see you tomorrow. Okay. Yeah, let's because in the Instagram live
47:13We watch some YouTube videos together. Okay, so movie clips and whatnot. Okay, so in big screen TV. Okay. Okay. Yeah
47:22See you tomorrow. Okay, my professional leaders. Okay. Yeah, thank you
47:26Okay, thank you. We continue mathematics tomorrow. Okay. Thank you. Yeah