First 50 Prime Numbers

EasyPython

Problem

Write code to print the first 50 prime numbers.

Implement first_50_primes() with no arguments. It must return the first 50 prime numbers in ascending order; the caller may print the returned list. Treat numbers below 2 as non-prime and test divisors only through the candidate's square root.

Constraints

The function takes no arguments.
Return exactly 50 integers.
Return values in strictly increasing order.
Every returned value must be prime.

Function Signature

def first_50_primes():

CodePython 3

You need to log in / sign up to run or submit.Ln 2

Run your code to see test output here.