prime number
def is_prime(n):
if(n<0):
print("n is not a nature number!")
return False
for i in range(1,ceil(n/2)+1):
if (i != n and i != 1 and n%i == 0):
return False
return True
print(is_prime(int(input("number>>"))))prime number
def is_prime(n):
if(n<0):
print("n is not a nature number!")
return False
for i in range(1,ceil(n/2)+1):
if (i != n and i != 1 and n%i == 0):
return False
return True
print(is_prime(int(input("number>>"))))prime numbers
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,
43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97 ...first prime numbers less than
#include<bits/stdc++.h>
using namespace std;
bool Is_Prime(long long x){
if(x%2==0)return false;
for(int i=3;i*i<=x;i+=2)
if(x%i==0)return false;
return true;
}
int main(){
//primes less than n
int n;
cin>>n;
int primes=0,i=1;
while(primes++<n){
while(!Is_Prime(++i));
cout<<i<<" ";
}
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
