Binary Exponentiation

How to quickly calculate a¹⁰⁰⁰⁰⁰⁰⁰⁰? Binary exponentiation can do it!
Not only that, but the binary exponentiation algorithm has many other applications, such as computing modular exponentiation in RSA encryption, computing Fibonacci numbers, repeating a linear transformation n times, etc.
Acknowledge: This video is made using the manim math engine: github.com/3b1b...

[@draido-dev]

i can imagine how complex the manim code could be to make something like this, it's just that you've chosen a less-known topic at it's name without clickbait, morocco ioi team is using this as a reference, keep it up!

[@MahdiFalahy-w5r]

TH-cam has truly committed a war crime towards your channel.

[@atharvnadkarni2353]

Bro just keep going! You're making amazing videos. It's just a matter of time you're going to be a star. Plz don't stop...

[@Bolo74894]

Man I don't know why you have 485 subs you deserve atleast an 300 k

[@moneyshorts3]

AMAZING VIDEO

[@michaelxaviercanonizado7931]

great video! Finally found an answer as to how I can evaluate exponents fast for my RSA program. Thank you!

[@Mr_Ioannis]

Ive litterly seen way more popular videos about this topic, but this one actually helps me so much! Nice video, and nice editing

[@СергійМоскаленко-у8ы]

Well, I got interested in the question in the last part of the video, so i tried to solve it using c++:
(spoilers)
.
.
.
.
.
.
as a result for n=100000 my program returned this:
4 3 5 6 2 1
CODE:
#include
using namespace std;
int len=6; //number of elements in permutation
int * multPerm(int *a,int *b) //transformation by permutation "a" of the sequence "b"
{
int *result=new int[len];
for(int i=0;i>=1;
}
for(int i=0;i

[@alinvarzaru529]

This channel is such a gem! Please consider doing some more videos, don’t give up! These are great, wow can’t believe I’ve found it

[@simardeepsinghmudhar7065]

God damn, great video, Thanks for this !!

[@demerion]

Great video, keep going! :)

[@СергійМоскаленко-у8ы]

Impressive👍

[@PMA_ReginaldBoscoG]

Does using Chinese Remainder Theorem in binary exponentiation optimize the algorithm?
Need your answer.
If we represent the permutations of k elements as a permutation matrix of order k and use the matrix multiplication algorithm you devised, I think we will get the required result.

[@benmezianeyacine5955]

Finally I found someone explaining it ! Arigato Gozaimasuu !

[@corexopro4964]

HEY bro tell me oni-chan or Im going to use O(n!) (?