Answers for "primes"

primes

prime(7); //Prima
function prime(input){
    let oneAndMe = 0;
    for (let i=0; i<= input; i++){
        if (input % i==0){
            oneAndMe++;
        }
    }

    if(oneAndMe == 2) {
        console.log(input + " Prima");
    }else{ console.log("Its not"); }

}

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<<" ";
	}
}

prime

This platform is addictive as hell. Stay away if you wanna be productive

prime

Sieve of Eratosthenes Shows whether index is prime or     not. Helps to find the prime numbers     smaller than the given number    .XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX