Draw a flow chart for printing 'n' prime numbers?

Answer 1

11

Answer 2

The flow goes something like this for an input number N.

If N < 2, exit NOT PRIME.

If N < 4, exit PRIME.

If (N%2) = 0, or (N%3) = 0, exit NOT PRIME.

If N < 25, exit PRIME.

Set D = 5, E = 2 and M = trunc(sqrt(N))

Repeat:

if (N%D) = 0, exit NOT PRIME.

D = D+E, E = 6-E

If D > M, exit PRIME, else go to Repeat.

Answer 3

You don't write flowcharts, you draw them. Being a text-based forum we cannot show images here, however the related links section contains a link to a flowchart for the creation of the Fibonacci sequence.

Answer 4

Option of drawing a flowchart is not available here. But I can give you the program -

#include<iostream.h>

#include<conio.h>

int main()

{

clrscr();

for(int i=1;i<101;i++)

{

if (i%2!=0)

cout<<i<<endl;

}

return 0;

}

Answer 5

Not possible, because there is no such thing as 'biggest even number'

Answer 6

print 3715891200what is this

Answer 7

pls ans this

Answer 8

step 1:

print "2 4 6 8 10"