---
title: "Discussion on \"Project Euler Problem#21\" | Hashnode"
description: "Discussion on \"Project Euler Problem#21\". #python program to sum of all the amicable numbers under 10000\ndef sum_divisor(num):\n    list1=[]\n    for i in range (1,num):\n        if num%i==0:\n            list1.append(i)\n    sum=0\n    for i in list1:\n        sum+=i\n    return sum\nsum=0\nfor i in ..."
url: "https://hashnode.com/posts/project-euler-problem21/646cf63e25b1b8c8dcb69f8e"
---

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

Discussion

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

May 23, 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.
