Write a program to print out the first n primes.
Sigiloso
Can you explain your logic? I tried your program in C++, and it even prints 21 and 27 as prime numbers. This is my code, where fmod is a function that calculated the modulus result of 2 decimals (double). int main(){ int n; cin>>n; if(n==0){ return 0; } if(n>=1){ cout1){ if(fmod(x,sqrt(x))!=0){ cout<