mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-10-07 06:09:28 +00:00
Code Issues Packages Projects Releases Wiki Activity
2,699 Commits 7 Branches 0 Tags 418 MiB
a25c53e8b0
Commit Graph

3 Commits

Author SHA1 Message Date
Christian Clauss
b75a7c77f8
pre-commit autoupdate: pyupgrade v2.34.0 -> v2.37.0 (#6245) 
* pre-commit autoupdate: pyupgrade v2.34.0 -> v2.37.0

* pre-commit run --all-files
 2022-07-11 10:19:52 +02:00
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