A Paradox!!!

Let n , k > 1 n,k>1 be a positive integer. Find the largest number M M and also the type of n n such that n 1 n + 2 n + 3 n + . . . n k n \mid 1^n+2^n+3^n+...n^k whenever n < M n<M . Let S = 1 n + 2 n + 3 n + . . . n n S=1^n+2^n+3^n+...n^n

No such restriction on n but M n n M \leq n^n No restriction on M M or n n . M = 2 3 2 018 + 1 7 2 019 M= 23^2018+17^2019 ,n is always such that n M 1 m o d M n n^M \equiv 1 \mod M^n M = 1 7 2 018 + 2 3 2 019 M=17^2018+23^2019 , type of n n : n 0 m o d 4 n \equiv 0 \mod 4 and 0 m o d 8 0 \mod 8 No such restriction on M but no prime p > k . n 3 2 p > k.n^{\frac{3}{2}} can ever divide S for n>M

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...