Skip to content

Add solution for the euler project problem 138 #12701

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Empty file.
63 changes: 63 additions & 0 deletions project_euler/problem_138/sol1.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,63 @@
"""
Project Euler Problem 138: https://projecteuler.net/problem=138

Special Isosceles Triangles


With change of variables

c = b/2

and requiring that

h = 2c +- 1

the triangle relation

c^2 + h^2 = L^2

can be expressed as

5 c^2 +- 4c + 1 = L^2

or with some rearrangement:

(5c +- 2)^2 = 5L^2 - 1

This to be solved for positive integer c and L, requires that

5L^2 - 1 = m^2

The above equation is negative Pell's equation with n = 5 and can be solved
recursively as outlined in the wikipedia article.
Note, we neglect first solution (m = 2, L = 1), as this leads to b and h
being non-integers.

Reference: https://en.wikipedia.org/wiki/Pell%27s_equation#The_negative_Pell's_equation

"""


def solution(k: int = 12) -> int:
"""
The recursive solution of negative Pell's equation with k + 1 values of L
summed and the first solution being skipped.

>>> solution(2)
322
>>> solution(5)
1866293
"""

m_i = 2
l_i = 1
ans = 0
for _ in range(2, k + 2):
m_i, l_i = 4 * m_i + 5 * m_i + 20 * l_i, 4 * l_i + 5 * l_i + 4 * m_i
ans += l_i

return ans


if __name__ == "__main__":
print(f"{solution() = }")