Finding Primes (Basic recursive Question) HELP
In completing the question below I'm not sure how to go about setting up this recursive function. Would it just have to be a series of if states such as is divisible by 2, 3, etc??
1. Write a function that prints out all the prime numbers between 2 and N, where N is one of the parameters.
1. Write a function that prints out all the prime numbers between 2 and N, where N is one of the parameters.
Topic archived. No new replies allowed.