Number theory course : youtube CodeNCode(2 Aug 2020 : Practice Problem added)

in fermat’s primality test :-
in this int a = 2 + rand() % (n - 3);
how doing modulo with (n-3) resulting a in range [2,n-2]?

Hey Waqar! I have a doubt from L15: Binomial coeff. using Modulo Inverse.
The return type of power in that program is ‘int’, however in the code of the function we are converting res to long long by multiplying it by 1LL. So why does the compiler not give any error? Thanks in advance.

Please make video on Chinese
remainder Theorem .

In lecture 17 you mentioned that the number of prime factors of a number will be <= Log(N)
Please explain that