modular exponentiation would give the last few digits... (btw this is a problem from spoj :P)
Anil On Thu, Mar 4, 2010 at 1:59 PM, vivek bijlwan <[email protected]> wrote: > we can use modular exponentiation to start with. > > > On Tue, Mar 2, 2010 at 9:38 PM, rajesh patidar <[email protected]>wrote: > >> i wanna to know how to find the kirst k digit of n^n >> n can wary from 0<n<10^9 >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]<algogeeks%[email protected]> >> . >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
