---
title: "#projecteulerproblem articles | Hashnode"
description: "Explore 24 articles tagged #projecteulerproblem on Hashnode. Tutorials, guides, and how-tos from the community."
url: "https://hashnode.com/tag/projecteulerproblem"
---

Tag

# #projecteulerproblem

24 posts · 1 followers

[Clark Gray](https://hashnode.com/@clarkgray) · [Dec 26, 2023](https://hashnode.com/posts/the-golden-swing/658a1cd07fcbbed8c0a238f9)

### [The Golden Swing](https://clarkdgray.com/the-golden-swing?utm_source=hashnode&utm_medium=feed)

Optimum Loft for Maximum Range of a Golf Ball

10 min read · [clarkdgray.com](https://clarkdgray.com/the-golden-swing?utm_source=hashnode&utm_medium=feed)

[Varjinth subramaniyan](https://hashnode.com/@varjinth) · [Jun 27, 2023](https://hashnode.com/posts/project-euler-problem29/649b2ef1ff2bb39565440b30)

### [Project Euler Problem#29](https://mycodingjourneyy.hashnode.dev/project-euler-problem29?utm_source=hashnode&utm_medium=feed)

#python program to find the no. of distinct terms are in the a power b sequence import unittest def distinct\_power(num): if type(num)!=int or num<2: return None list1=\[\] for a in range(2,num+1): for b in range(2,num+1): ...

1 min read · [mycodingjourneyy.hashnode.dev](https://mycodingjourneyy.hashnode.dev/project-euler-problem29?utm_source=hashnode&utm_medium=feed)

[Varjinth subramaniyan](https://hashnode.com/@varjinth) · [Jun 27, 2023](https://hashnode.com/posts/project-euler-problem30/649b3133c00b49f89d64321f)

### [Project Euler Problem#30](https://mycodingjourneyy.hashnode.dev/project-euler-problem30?utm_source=hashnode&utm_medium=feed)

#python program to sum of all the numbers that can be written as the sum of fifth powers of their digits import unittest def digit\_sum(power): if type(power)!=int or power<2: return None list1=\[\] for i in range(2,1000000): ...

1 min read · [mycodingjourneyy.hashnode.dev](https://mycodingjourneyy.hashnode.dev/project-euler-problem30?utm_source=hashnode&utm_medium=feed)

[Varjinth subramaniyan](https://hashnode.com/@varjinth) · [Jun 27, 2023](https://hashnode.com/posts/project-euler-problem28/649b2b126fb4ffe58bc3be89)

### [Project Euler Problem#28](https://mycodingjourneyy.hashnode.dev/project-euler-problem28?utm_source=hashnode&utm_medium=feed)

#python program to find the sum of diagonals of spiral number grid import unittest def spiral\_dia(num): if type(num)!=int or num<1: return None list1=\[\] for i in range(1,num+1,2): list1.append(i\*i) for i in range(1,nu...

1 min read · [mycodingjourneyy.hashnode.dev](https://mycodingjourneyy.hashnode.dev/project-euler-problem28?utm_source=hashnode&utm_medium=feed)

[Varjinth subramaniyan](https://hashnode.com/@varjinth) · [Jun 26, 2023](https://hashnode.com/posts/project-euler-problem27/6499cb5bd3191dce3580e04f)

### [Project Euler Problem#27](https://mycodingjourneyy.hashnode.dev/project-euler-problem27?utm_source=hashnode&utm_medium=feed)

#python program to find the product of co-efficient in quadratic formula whih give max number of primes def is\_prime(n): if n <= 1 or n % 2 == 0: return False if n == 2: return True for i in range(3, int(n\*\*(0.5) + 1), 2):...

1 min read · [mycodingjourneyy.hashnode.dev](https://mycodingjourneyy.hashnode.dev/project-euler-problem27?utm_source=hashnode&utm_medium=feed)

[Varjinth subramaniyan](https://hashnode.com/@varjinth) · [Jun 17, 2023](https://hashnode.com/posts/project-euler-problem26/648df0d2578b47894c6af871)

### [Project Euler Problem#26](https://mycodingjourneyy.hashnode.dev/project-euler-problem26?utm_source=hashnode&utm_medium=feed)

import unittest def max\_reciprocal\_cycle(num): if type(num)==float: num=int(num) if type(num)!=int or num<1: return None max\_length=0 max\_num=1 for i in range(2,num+1): numerator=10 remainders=...

1 min read · [mycodingjourneyy.hashnode.dev](https://mycodingjourneyy.hashnode.dev/project-euler-problem26?utm_source=hashnode&utm_medium=feed)

[Varjinth subramaniyan](https://hashnode.com/@varjinth) · [Jun 15, 2023](https://hashnode.com/posts/project-euler-problem-25/648b598d9548e761c720e106)

### [Project Euler problem #25](https://mycodingjourneyy.hashnode.dev/project-euler-problem-25?utm_source=hashnode&utm_medium=feed)

#python program with test cases to find the index of 1000 digits fibonacci number import unittest def fib\_index(n): if type(n)!=int: return 'Type error' if n<1 : return None count=2 length=1 a,b=1,1 while lengt...

1 min read · [mycodingjourneyy.hashnode.dev](https://mycodingjourneyy.hashnode.dev/project-euler-problem-25?utm_source=hashnode&utm_medium=feed)

[Varjinth subramaniyan](https://hashnode.com/@varjinth) · [Jun 14, 2023](https://hashnode.com/posts/project-euler-problem24/648a0164e515659ca589fe1a)

### [Project Euler Problem#24](https://mycodingjourneyy.hashnode.dev/project-euler-problem24?utm_source=hashnode&utm_medium=feed)

#python program to find the nth Lexicographic Permutations number from itertools import permutations def permutation(numbers, n): perms\_list = list(permutations(numbers)) nth\_permutation=(perms\_list\[n-1\]) nth\_num='' for i in nth\_perm...

1 min read · [mycodingjourneyy.hashnode.dev](https://mycodingjourneyy.hashnode.dev/project-euler-problem24?utm_source=hashnode&utm_medium=feed)

[Varjinth subramaniyan](https://hashnode.com/@varjinth) · [Jun 4, 2023](https://hashnode.com/posts/project-euler-problem-23/647cd0be1c62644e5db620e8)

### [Project Euler Problem #23](https://mycodingjourneyy.hashnode.dev/project-euler-problem-23?utm_source=hashnode&utm_medium=feed)

#Python program to find the sum of non abundant numbers with test cases import unittest def sum\_divisor(num): if num<0: num\*=-1 divisors\_sum = 1 for i in range(2, int(num\*\*0.5) + 1): if num % i == 0: divisors\_...

1 min read · [mycodingjourneyy.hashnode.dev](https://mycodingjourneyy.hashnode.dev/project-euler-problem-23?utm_source=hashnode&utm_medium=feed)

[Varjinth subramaniyan](https://hashnode.com/@varjinth) · [May 23, 2023](https://hashnode.com/posts/project-euler-problem21/646cf63e25b1b8c8dcb69f8e)

### [Project Euler Problem#21](https://mycodingjourneyy.hashnode.dev/project-euler-problem21?utm_source=hashnode&utm_medium=feed)

#python program to sum of all the amicable numbers under 10000 def sum\_divisor(num): list1=\[\] for i in range (1,num): if num%i==0: list1.append(i) sum=0 for i in list1: sum+=i return sum sum=0 for i in ...

1 min read · [mycodingjourneyy.hashnode.dev](https://mycodingjourneyy.hashnode.dev/project-euler-problem21?utm_source=hashnode&utm_medium=feed)
