Add solution for Project Euler problem 123 (#3072)
Name: Prime square remainders Let pn be the nth prime: 2, 3, 5, 7, 11, ..., and let r be the remainder when (pn−1)^n + (pn+1)^n is divided by pn^2. For example, when n = 3, p3 = 5, and 43 + 63 = 280 ≡ 5 mod 25. The least value of n for which the remainder first exceeds 10^9 is 7037. Find the least value of n for which the remainder first exceeds 10^10. Reference: https://projecteuler.net/problem=123 reference: #2695 Co-authored-by: NRavi Kandasamy Sundaram <rkandasamysundaram@luxoft.com>
Showing
project_euler/problem_123/sol1.py
0 → 100644
想要评论请 注册 或 登录