How to Calculate 1+a^1+a^2+...+a^d mod m (using BigMod method)

Revision en5, by iftekhar, 2022-05-26 15:39:35

How can I solve this using bigmod method?

If the series is 1+a+a^2+a^3+a^4+a^5 then this will be equal to (1+a^2+a^4)+a(1+a^2+a^4). How can I apply bigmod here!

BigMod : This is for calculating the mod of a large number like 2^100 or 10^18.

long long bigmod(long long a, long long b, long long m)
{
    if(b==0) return 1;
    if(b%2==1)
    {
        long long p1 = a%m;
        long long p2 = bigmod(a,b-1,m);
        return (p1*p2)%m;
    }
    if(b%2==0)
    {
        long long h = bigmod(a,b/2,m);
        return (h*h)%m;
    }
}
Tags #number theory

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en5 English iftekhar 2022-05-26 15:39:35 2 Tiny change: '\n**BigMod: **\n This ' -> '\n**BigMod :**\n This '
en4 English iftekhar 2022-05-26 15:38:24 53
en3 English iftekhar 2022-05-26 15:35:39 67
en2 English iftekhar 2020-05-20 13:08:21 346
en1 English iftekhar 2020-05-20 12:23:28 232 Initial revision (published)