mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-30 16:31:08 +00:00
Code Issues Packages Projects Releases Wiki Activity
c39be1d8b8
Python/project_euler/problem_123
History
Ravi Kandasamy Sundaram c8db6a208b
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: Ravi Kandasamy Sundaram <rkandasamysundaram@luxoft.com>
2020-11-06 22:25:02 +05:30
..
__init__.py Add solution for Project Euler problem 123 (#3072) 2020-11-06 22:25:02 +05:30
sol1.py Add solution for Project Euler problem 123 (#3072) 2020-11-06 22:25:02 +05:30