I suppose the remaining videos in the playlist are marked private because they will be made public at a later time (like a release schedule)? Just letting you know that the playlist does show them, but they are marked as private and no details about them are visible (just their presence in the list). Cheers! Thanks for the lecture. I learned method 4 from it, which I had not heard of before!
The beatifully sober video style is ideal from a cognitive point of view: as an effect it is very easy to follow and concentrate on the (amazing) content...
The question is right: the time taken is linear in a since as you can see it written there, time is ~ a steps, but because computational time is usually given as a function of # digits (which is indeed of order log(a)), it's an exponential function
"Computational problems associated with Racah algebra" by J. Stein Vol 1, Issue 3, Feb 1967, pp 397-405, Journal of Computational Physics Should have done my homework before asking! 🙂
Richard always brings an interesting perspective to even the most well-trodden subject.
His explanation of why "1" is not a prime was excellent.
Thank you so much for your content, you have an incredibily captivating way of presenting things
Well explained. It's also nice to see how Euclid did it. Just a note that I think you may have got a and b reversed at 9:00.
I suppose the remaining videos in the playlist are marked private because they will be made public at a later time (like a release schedule)? Just letting you know that the playlist does show them, but they are marked as private and no details about them are visible (just their presence in the list). Cheers! Thanks for the lecture. I learned method 4 from it, which I had not heard of before!
The beatifully sober video style is ideal
from a cognitive point of view: as an effect
it is very easy to follow and concentrate on the (amazing) content...
5:32
Wouldn't it be linear instead since #digits of a is roughly log(a), so k^log(a) would be proportional to the input a?
The size of the input is proportional to # digits of a, not a. It's defined as the number of bits when you write a in binary.
The question is right: the time taken is linear in a since as you can see it written there, time is ~ a steps, but because computational time is usually given as a function of # digits (which is indeed of order log(a)), it's an exponential function
Method 4 is really neat! Any source who used it first? Thank you professor Borcherds!
"Computational problems associated with Racah algebra" by J. Stein
Vol 1, Issue 3, Feb 1967, pp 397-405, Journal of Computational Physics
Should have done my homework before asking! 🙂
That was very cool.
Thank you.
Those of us from the UK with sufficient chronological endurance were taught long division of pounds, shillings and pence. And that was really hard.
nice lecture.
Method 4 begs for some properties of the gcd to precede this lesson.
yeee
ye