Write the algorithm and draw the flowchart to find Sum of N Prime number?

Answer 1

Shrek and Donkey

Answer 2

Ah, finding the sum of N prime numbers is a lovely challenge! You can create an algorithm by first defining a function to check if a number is prime, then loop through numbers starting from 2 and add the prime numbers to a running sum until you reach N prime numbers. For the flowchart, you can start with a start/end symbol, then use decision symbols to check if a number is prime, loop symbols to iterate through numbers, and a process symbol to calculate the sum. Remember to add symbols for input and output as well. Happy algorithm painting!

Answer 3

To find the sum of the first N prime numbers, you can use the following algorithm:

1. Initialize variables sum = 0, count = 0, num = 2.
2. While count < N: a. Check if num is a Prime number. b. If num is prime, add it to sum and increment count by 1. c. Increment num by 1.
3. Once count reaches N, output the sum of the N prime numbers.

Drawing a flowchart for this algorithm would involve starting with the initialization of variables, followed by a loop to check and sum prime numbers until the count reaches N, and finally outputting the sum. Each step would be connected by arrows indicating the flow of the algorithm.