Prime Numbers Output | Dataford Interview Questions

Log all prime numbers up to 1000.

Implement log_primes_up_to(n), where n is an inclusive upper bound. For testability, return the primes in ascending order instead of printing them; calling the function with n = 1000 satisfies the original task.

Input: An integer n.

Output: A list containing every prime number from 2 through n.

Constraints

0 <= n <= 1000
The upper bound is inclusive
The returned list must be sorted in ascending order

Function Signature

def log_primes_up_to(n):

Your question is Prime Numbers Output. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem