Matlab code for PRIME SQUARE REMAINDER

3 次查看（过去 30 天）

Yattin Gaur 2019-11-19

评论： Walter Roberson 2019-11-20

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

David Goodmanson 2019-11-20

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

Walter Roberson 2019-11-20

Done.

在 Help Center 和 File Exchange 中查找有关 Number Theory 的更多信息

Find the treasures in MATLAB Central and discover how the community can help you!

Translated by