---
title: "Discussion on \"Project Euler Problem #23\" | Hashnode"
description: "Discussion on \"Project Euler Problem #23\". #Python program to find the sum of non abundant numbers with test cases\nimport unittest\n\ndef sum_divisor(num):\n    if num<0:\n        num*=-1\n    divisors_sum = 1\n    for i in range(2, int(num**0.5) + 1):\n        if num % i == 0:\n            divisors_..."
url: "https://hashnode.com/posts/project-euler-problem-23/647cd0be1c62644e5db620e8"
---

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

Discussion

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

Jun 4, 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.
