Hello friends, Welcome to your **Techgsr.co** blog. And today in this article we will learn about **how to write find the prime numbers from 2 to 100 by using nested for loop**.So let’s go to our topic

**main.cpp**

#include <iostream> using namespace std; int main () { int i, j; for(i=2; i<100; i++) { for(j=2; j <= (i/j); j++) if(!(i%j)) break; // if factor found, not prime if(j > (i/j)) cout << i << ” is prime\n”; } return 0; }

**Output** :

2 is prime

3 is prime

5 is prime

7 is prime

11 is prime

13 is prime

17 is prime

19 is prime

23 is prime

29 is prime

31 is prime

37 is prime

41 is prime

43 is prime

47 is prime

53 is prime

59 is prime

61 is prime

67 is prime

71 is prime

73 is prime

79 is prime

83 is prime

89 is prime

97 is prime

**Related Post:-**

So I hope that you learn about the this program And if you have any more queries about** progrmming ,web Devlopment** **,tech,computer** relegated then feel free to discuss your problem in the comment section.Thank you so much and come back for more updates about** Techgsr.co .**