Matlab code for PRIME SQUARE REMAINDER

Let pn be the nth prime: 2, 3, 5, 7, 11, ..., and let r be the remainder when is divided by .

For example, when n = 3, p3 = 5, and = 280 ≡ 5 mod 25.

The least value of n for which the remainder first exceeds is 7037.

Find the least value of n for which the remainder first exceeds .

[Walter Roberson]

You accidentally forgot to ask a question.

http://www.mathworks.com/matlabcentral/answers/6200-tutorial-how-to-ask-a-question-on-answers-and-get-a-fast-answer

[David Goodmanson]

Hi Yattin,

It would be much more understandable if you edited your question so that it said

remainder of [ (p(n)-1)^n + (p(n)+1)^n ] / p(n)^n

or something similar. Is there a number-theoretic significance to this quantity?

[Walter Roberson]

hint: powermod()

[David Goodmanson]

thanks Walter, and could you change it to p_n on the second line?

[Walter Roberson]

Done.