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
2020-11-05 12:06:59 +01:00
2020-10-21 12:46:14 +02:00
2020-10-24 16:07:27 +02:00
2020-10-30 23:10:44 +01:00
2020-10-29 08:43:34 +08:00
2020-11-01 15:38:11 +08:00
2020-10-27 12:05:37 +08:00
2019-11-17 19:37:58 +01:00
2020-04-13 02:17:29 +02:00
2020-10-12 14:10:42 +05:30
2020-10-24 16:07:27 +02:00

The Algorithms - Python

Gitpod Ready-to-Code Gitter chat  Build Status  LGTM  contributions welcome  Donate    pre-commit code style: black

All algorithms implemented in Python (for education)

These implementations are for learning purposes only. Therefore they may be less efficient than the implementations in the Python standard library.

Contribution Guidelines

Read our Contribution Guidelines before you contribute.

Community Channel

We're on Gitter! Please join us.

List of Algorithms

See our directory.

Languages
Python 99.9%
Shell 0.1%