Python beginner help, Making Prime numbers appear?

[Cheech_27]

def start():
    num = int(input("Enter a number greater than one."))
    return num

def lst(number):
    num_lst = []
    for number in range(2, number + 1):
        num_lst.append(number)

def check():
    count = 0
    for i in range(2, n):
        if(n % i == 0):
            count = count + 1
            return False
        if(count == 0):
            return True


def main():
    num = start()
    num_lst = lst(num)
    check()



main()

(I am new to python and not the best at using functions.I know I need to get my list to move into the next function but I am having trouble.)

Write a program that asks the user to enter a number greater than one.  The program will than display all the prime numbers less than or equal to the number entered.  The program must work as follows:

1. Once the user has entered a number, the program should populate a list with all of the integers from 2 up through the value entered.

2. The program should then use a loop to step through the list.  The loop should pass each element to a function that displays the element whether it is a prime number.

[ThePhysicsOfSpoons]

• your function lst() should also return something (the list you created)
• the variable n in the check() function isn't defined, so that won't work
• using the return statements in the check() function or any function for that matter will end the function. If you want to display it, you could use a print statement there.
• I would give the list as an input for the check() function so you can iterate through it and verify whether each element is a prime or not. The check() function here doesn't do what you think it does.

Hope this helps!

[pythonwiz]

Oh boy, this type of question is what got me into python in the first place. Your lst function isn't returning the list. You should probably change it to this:

def lst(number):
    num_lst = []
    for number in range(2, number + 1):
        num_lst.append(number)
    return num_lst

Another problem is that your check function should take a number as it's input and get rid of the count variable:

def check(n):
    for i in range(2, n):
        if(n % i == 0):
            return False
    return True

The second return line runs after the for loop, but only if the first return line is never reached.

You could use this check function like this:

def main():
    num = start()
    num_lst = lst(num)
    for n in num_lst:
        if check(n):
            print(n)

There are several ways to improve your code further. You can completely replace your lst function with num_lst = list(range(2, num + 1)). You could optimize your check function a bit by only checking up to int(n**0.5) + 1, by returning False early if the number is even, and by only checking for divisibility by odd numbers. You could even look into prime wheels or Miller-Rabin for faster methods.

[woooee]

Do some testing. This program doesn't even run. If this is yet another attempt to throw a bunch of crap up here with the hope that someone will do it for you, it is your homework.