|
| 1 | +```java |
| 2 | +package csd; |
| 3 | + |
| 4 | +class App { |
| 5 | + public static void main(String [] args) |
| 6 | + { |
| 7 | + |
| 8 | + //... |
| 9 | + |
| 10 | + } |
| 11 | +} |
| 12 | + |
| 13 | +class TripletPrimeNumTest{ |
| 14 | + public static void run() |
| 15 | + { |
| 16 | + java.util.Scanner kb = new java.util.Scanner(System.in); |
| 17 | + System.out.println("üç basamaklı TripletPrimeNumbers:"); |
| 18 | + for(int i = 100; i < 1000; i++) { |
| 19 | + if(TripletPrimeNum.isTripletPrime(i)){ |
| 20 | + System.out.printf("%d -- %d%n",i,NumberUtil.getReverse(i)); |
| 21 | + |
| 22 | + } |
| 23 | + |
| 24 | + } |
| 25 | + } |
| 26 | +} |
| 27 | + |
| 28 | +class TripletPrimeNum{ |
| 29 | + public static boolean isTripletPrime(int ival) |
| 30 | + { |
| 31 | + int reverseVal = NumberUtil.getReverse(ival); |
| 32 | + if (reverseVal > ival) |
| 33 | + if (NumberUtil.isPrime(ival) && NumberUtil.isPrime(reverseVal)) |
| 34 | + if (NumberUtil.isPrime(ival % 100) && NumberUtil.isPrime(reverseVal % 100)) |
| 35 | + if (NumberUtil.isPrime(ival / 10) && NumberUtil.isPrime(reverseVal / 10)) |
| 36 | + return true; |
| 37 | + return false; |
| 38 | + } |
| 39 | +} |
| 40 | + |
| 41 | +class XPrimalityTest{ |
| 42 | + public static void run() |
| 43 | + { |
| 44 | + java.util.Scanner kb = new java.util.Scanner(System.in); |
| 45 | + int ival; |
| 46 | + for(;;){ |
| 47 | + System.out.printf("Bir tam sayı giriniz:"); |
| 48 | + ival = Integer.parseInt(kb.nextLine()); |
| 49 | + if(xPrimality.xPrime(ival)) |
| 50 | + System.out.printf("(%d) sayısı Xprime%n",ival); |
| 51 | + else |
| 52 | + System.out.printf("(%d) sayısı Xprime değildir%n",ival); |
| 53 | + System.out.println("Çıkış için negatif bir sayı giriniz"); |
| 54 | + if(ival < 0) |
| 55 | + break; |
| 56 | + |
| 57 | + } |
| 58 | + System.out.println("Çıkış yaptınız...."); |
| 59 | + } |
| 60 | +} |
| 61 | + |
| 62 | +class xPrimality { |
| 63 | + public static boolean xPrime(int ival) |
| 64 | + { |
| 65 | + |
| 66 | + while ( NumberUtil.getDigitsCount(ival) > 2){ |
| 67 | + if (!NumberUtil.isPrime(ival)) |
| 68 | + return false; |
| 69 | + ival = NumberUtil.getDigitsSum(ival); |
| 70 | + } |
| 71 | + |
| 72 | + return NumberUtil.isPrime(ival); |
| 73 | + } |
| 74 | +} |
| 75 | +``` |
0 commit comments