Skip to content

Palindromic Primes #142

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Feb 2, 2018
Merged

Palindromic Primes #142

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
41 changes: 41 additions & 0 deletions Misc/PalindromicPrime.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,41 @@
import java.util.Scanner;
public class PalindromePrime {

public static void main(String[] args) { // Main funtion
Scanner in = new Scanner(System.in);
System.out.println("Enter the quantity of First Palindromic Primes you want");
int n = in.nextInt(); // Input of how mant first pallindromic prime we want
funtioning(n); // calling funtion - functioning
}

public static boolean prime(int num) { // checking if number is prime or not
for (int divisor = 2; divisor <= num / 2; divisor++) {
if (num % divisor == 0) {
return false; // false if not prime
}
}
return true; // True if prime
}

public static int reverse(int n){ // Returns the reverse of the number
int reverse = 0;
while(n!=0){
reverse = reverse * 10;
reverse = reverse + n%10;
n = n/10;
}
return reverse;
}

public static void funtioning(int y){
int count =0;
int num = 2;
while(count < y){
if(prime(num) && num == reverse(num)){ // number is prime and it's reverse is same
count++; // counts check when to terminate while loop
System.out.print(num + "\n"); // Print the Palindromic Prime
}
num++; // inrease iterator value by one
}
}
};