Python

mathdatech/Python

Fork 0

mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-24 13:31:07 +00:00

Commit Graph

Author	SHA1	Message	Date
Christian Clauss	cecf43d648	Pyupgrade to Python 3.9 (#4718 ) * Pyupgrade to Python 3.9 * updating DIRECTORY.md Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>	2021-09-07 13:37:03 +02:00
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

Author

SHA1

Message

Date

Christian Clauss

cecf43d648

Pyupgrade to Python 3.9 (#4718 )

* Pyupgrade to Python 3.9

* updating DIRECTORY.md

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>

2021-09-07 13:37:03 +02:00

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

2 Commits