4 Commits

Author	SHA1	Message	Date
pre-commit-ci[bot]	bc8df6de31	[pre-commit.ci] pre-commit autoupdate (#11322) ... * [pre-commit.ci] pre-commit autoupdate updates: - [github.com/astral-sh/ruff-pre-commit: v0.2.2 → v0.3.2](https://github.com/astral-sh/ruff-pre-commit/compare/v0.2.2...v0.3.2) - [github.com/pre-commit/mirrors-mypy: v1.8.0 → v1.9.0](https://github.com/pre-commit/mirrors-mypy/compare/v1.8.0...v1.9.0) * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>	2024-03-13 07:52:41 +01:00
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