public class UniquePrimeFinder {
// Function to check if a number is prime
public static boolean isPrime(int n) {
if (n < 2) return false;
if (n % 2 == 0) return n == 2;
int limit = (int) Math.sqrt(n);
for (int i = 3; i <= limit; i += 2) {
if (n % i == 0) return false;
}
return true;
}
// Function to check if all digits are unique
public static boolean hasUniqueDigits(int n) {
boolean[] seen = new boolean[10]; // track digits 0–9
while (n > 0) {
int d = n % 10;
if (seen[d]) return false; // duplicate found
seen[d] = true;
n /= 10;
}
return true;
}
public static void main(String[] args) {
for (int num = 1000; num <= 9999; num++) {
if (isPrime(num) && hasUniqueDigits(num)) {
System.out.println("First 4-digit prime with all unique digits: " + num);
return; // stop after finding the first one
}
}
System.out.println("No such number found.");
}
}
/*
run:
First 4-digit prime with all unique digits: 1039
*/
