1. Prime Numbers

Python
1

Function that returns a list of all prime numbers up to a given number. A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. For example, 2, 3, 5, 7, and 11 are prime numbers.

image

(as a beginner in Python, Mr. Mosh tutorials is very helpful and easy to understand. Thank You!)

1 Like
2

As beginner to understand the prime numbers code

def prime_numbers(num):
    lists = []
    for n in range(1, num+1):
        if n<=1:
            continue
        is_prime = True
        for i in range(2, int(n/2)+1):
            if n % i == 0:
                is_prime = False
                break
        if is_prime:
            lists.append(n)
    return lists
1 Like
3

Another way to return the prime numbers:

def list_primes(n):
    primes = []
    for i in range(2,n+1):
        count = 1
        for j in range(2, i+1):
            if i % j == 0:
                count += 1
        if count == 2:
            primes.append(i)
    return primes
1 Like
4

Here is my answer to “Prime Numbers”:

def divisible(divider, testing_set):
    result_set = []
    for a in testing_set:
        if a <= divider:
            result_set.append(a)
        elif a % divider != 0:
            result_set.append(a)
    return result_set


n = int(input('Enter the number: '))
numbers = list(range(2, n + 1))
k = 0
while k < len(numbers):
    x = numbers[k]
    if x*x > n:
        break
    else:
        numbers = divisible(x, numbers)
        k += 1
print(f"The prime numbers found: ", numbers)