---
title: "Discussion on \"Prime Numbers using Sieve of Eratosthenes in Python\" | Hashnode"
description: "Discussion on \"Prime Numbers using Sieve of Eratosthenes in Python\". A prime number, as we know, is a natural number that has exactly two distinct natural number divisors: the number 1 and itself.\nWe often get questions like the one given below:\n\nGiven a number n, print all primes smaller than or equal to n. — e.g. If..."
url: "https://hashnode.com/posts/prime-numbers-using-sieve-of-eratosthenes-in-python/63446881f943840715bd249e"
---

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

Discussion

# [Prime Numbers using Sieve of Eratosthenes in Python](https://blog.ashutoshkrris.in/prime-numbers-using-sieve-of-eratosthenes-in-python?utm_source=hashnode&utm_medium=feed)

A prime number, as we know, is a natural number that has exactly two distinct natural number divisors: the number 1 and itself. We often get questions like the one given below: Given a number n, print all primes smaller than or equal to n. — e.g. If...

Oct 10, 2022 · 2 min read · blog.ashutoshkrris.in  
Updated Feb 3, 2023  
Read the article

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

## Written by

[Ashutosh Krishna](https://hashnode.com/@ashutoshkrris)

@ashutoshkrris · Bengaluru, India

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

Building reliable software with Java, Spring Boot, Python, and the web

Software Engineer at OpenText passionate about building scalable web applications and backend systems. I work mainly with Java, Spring Boot, Python, and modern web technologies. I enjoy creating things for the internet, exploring new tech, and sharing what I learn along the way.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.