---
title: "Discussion on \"Project Euler Problem#29\" | Hashnode"
description: "Discussion on \"Project Euler Problem#29\". #python program to find the no. of distinct terms are in the a power b sequence\nimport unittest\n\ndef distinct_power(num):\n    if type(num)!=int or num<2:\n        return None\n    list1=[]\n    for a in range(2,num+1):\n        for b in range(2,num+1):\n ..."
url: "https://hashnode.com/posts/project-euler-problem29/649b2ef1ff2bb39565440b30"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [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): ...

Jun 27, 2023 · 1 min read · mycodingjourneyy.hashnode.dev  
Read the article

-   [#100daysofcode](https://hashnode.com/tag/100daysofcode)
-   [#projecteulerproblem](https://hashnode.com/tag/projecteulerproblem)

## Written by

[Varjinth subramaniyan](https://hashnode.com/@varjinth)

@varjinth

  
[View profile](https://hashnode.com/@varjinth)

blogger

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
