Is there a way to find the answervalue of $1^n+ 2^n +\cdots + m^n$ modulo $x$?

Fixed latex

Source Link

edit approved Nov 17, 2012 at 14:45

Stefan Hansen

25.7k
7
59
93

Is there a way to find the answer of 1^n+$1^n+ 2^n ... m^n+\cdots + m^n$ modulo x$x$

I am writing a program in which I want to make changes to make it more efficient.

whatWhat the program does is it takes three inputs m n$m$, $n$ and x$x$ and I have to find the value of the following equation: (1^n+ 2^n ... m^n )modulo x$$ 1^n+ 2^n+\cdots + m^n \mod{x} $$

Is there a better way than calculating the whole value and then solving for answer? Because if n$n$ and m$m$ are large it takes a lot of computation time which I am trying to avoid.

Source Link

asked Nov 17, 2012 at 14:34

abhishek srivastava

43
2

Loading

Stack Exchange Network

Return to Question

Is there a way to find the answervalue of $1^n+ 2^n +\cdots + m^n$ modulo $x$?

Is there a way to find the answer of 1^n+$1^n+ 2^n ... m^n+\cdots + m^n$ modulo x$x$

Is there a way to find the answer of 1^n+ 2^n ... m^n modulo x

Is there a way to find the answer of $1^n+ 2^n +\cdots + m^n$ modulo $x$