Create a program that generates prime numbers between two integer boundareis

You first have to think about the properties of a prime number, the key characteristic is that prime numbers can only be divided by itself and 1, so If we prove that any other number can divide the number, then it is not prime.We have to then think about how many iterations we need (how we can use for loops to return the numbers that we need). We need a loop that returns every number between our two boundaries, and then we must check every number from 2, to the current number we are checking. % is a operator that returns the remainder, if the output is not 1, the number is not prime.the key in this task is making the method work for all numbers, by checking every number is greater than 1, we can start the method, otherwise we ignore it. This prevents an incorrect range to be used later.finally indentation is key, if we do not print our prime number after our division checks, then we will output a number everytime it passes a test.class Prime:   def method(self, lower, upper):       for num in range(lower, upper + 1):           if num > 1:               for i in range(2, num):                   if(num % i) == 0:                        break               else:                   print(num)

BN
Answered by Ben N. Python tutor

1024 Views

See similar Python Mentoring tutors

Related Python Mentoring answers

All answers ▸

Why would I use dictionaries instead of a list?


Write a function that checks whether a number is prime or not.


Explain how python programs are structured and give an example of how methods are initiated


How do I use for loops in Python?


We're here to help

contact us iconContact ustelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

© MyTutorWeb Ltd 2013–2025

Terms & Conditions|Privacy Policy
Cookie Preferences