exercise 6

src/main/java/Task2/IsPrimeNumber610.java

 package Task2;
 
 
-public class IsPrimeNumber {
+public class IsPrimeNumber610 {
     public static void main(String[] args) {
         int count = 0;
         for (int i = 2; i < 10000; i++) {

src/main/java/Task2/Palindrome63.java

@@ -2,28 +2,32 @@ package Task2;
 
 import java.util.Scanner;
 
-public class Palindrome {
+public class Palindrome63 {
 
-    public static void main(String[] args) {
-        try (Scanner scanner = new Scanner(System.in)) {
-            System.out.print("Enter an integer: ");
-            int number = scanner.nextInt();
-            System.out.println(isPalindrome(number) ? "Palindrome" : "Not a palindrome");
+    public static int reverse(int number) {
+        int reversed = 0;
+        while (number != 0) {
+            int digit = number % 10;
+            reversed = reversed * 10 + digit;
+            number /= 10;
         }
+        return reversed;
     }
 
     public static boolean isPalindrome(int number) {
-        return number == reverse(number); // Use iterative reverse for simplicity
+        return number == reverse(number);
     }
 
-    // Iterative reverse function for clarity
-    public static int reverse(int number) {
-        int reversed = 0;
-        while (number != 0) {
-            reversed = reversed * 10 + number % 10;
-            number /= 10;
+    public static void main(String[] args) {
+        Scanner scanner = new Scanner(System.in);
+        System.out.print("Enter an integer: ");
+        int number = scanner.nextInt();
+
+        if (isPalindrome(number)) {
+            System.out.println(number + " is a palindrome.");
+        } else {
+            System.out.println(number + " is not a palindrome.");
         }
-        return reversed;
     }
 }
 

src/main/java/Task2/PalindromePrimes626.java

 package Task2;
 
-public class PalindromePrimes {
+public class PalindromePrimes626 {
 
     public static void main(String[] args) {
         int targetCount = 100;
         int numbersPerLine = 10;
         int count = 0;
 
-        for (int num = 2; count < targetCount; num++) {  // Combine main logic for brevity
+        for (int num = 2; count < targetCount; num++) {
             if (isPalindromicPrime(num)) {
                 System.out.print(num + " ");
                 count++;
@@ -23,7 +23,7 @@ public class PalindromePrimes {
     }
 
     public static boolean isPrime(int num) {
-        if (num <= 1) { // Handle invalid cases upfront
+        if (num <= 1) {
             return false;
         }
         for (int i = 2; i * i <= num; i++) { // Only check up to the square root

src/main/java/Task2/PasswordChecker618.java

@@ -2,7 +2,7 @@ package Task2;
 
 import java.util.Scanner;
 
-public class PasswordChecker {
+public class PasswordChecker618 {
 
     public static void main(String[] args) {
         Scanner scanner = new Scanner(System.in);

src/main/java/Task2/PatternDisplay66.java

 package Task2;
 
-public class PatternDisplay {
+public class PatternDisplay66 {
     public static void main(String[] args) {
         displayPattern(5);
     }

src/main/java/Task2/RandomMatrix617.java

 package Task2;
 
 import java.util.Scanner;
+import java.util.concurrent.ThreadLocalRandom;
 
-public class RandomMatrix {
+public class RandomMatrix617 {
+
+    public static void printMatrix(int n) {
+        for (int i = 0; i < n; i++)  { //use for row
+            for (int j = 0; j < n; j++) { // use for column
+                // Use ThreadLocalRandom for better performance
+                System.out.print(ThreadLocalRandom.current().nextInt(3)); // Print 0 or 1 randomly
+                System.out.print(" "); // Add a space between elements
+            }
+            System.out.println(); // Move to the next line after each row
+        }
+    }
 
     public static void main(String[] args) {
         Scanner scanner = new Scanner(System.in);
-        System.out.print("Enter number: ");
+        System.out.print("Enter n: ");
         int n = scanner.nextInt();
 
-        for (int i = 0; i < n; i++) {  // Combine logic for brevity
-            for (int j = 0; j < n; j++) {
-                System.out.print((int) (Math.random() * 2) + " ");
-            }
-            System.out.println();
-        }
+        printMatrix(n);
     }
 }

src/main/java/Task2/ReverseInteger64.java

@@ -2,23 +2,25 @@ package Task2;
 
 import java.util.Scanner;
 
-public class ReverseInteger {
+public class ReverseInteger64 {
 
-    public static void main(String[] args) {
-        try (Scanner scanner = new Scanner(System.in)) { // Use try-with-resources for cleaner resource management
-            System.out.print("Enter an integer: ");
-            int number = scanner.nextInt();
+    public static void reverse(int number) {
+        if (number < 10) { // Base case for single-digit numbers
+            System.out.print(number);
 
-            System.out.print("The reversed integer is: ");
-            reverse(number); // Use iterative reverse for clarity
+        } else {
+            System.out.print(number % 10); // Print the last digit
+            reverse(number / 10); // Recursive call for remaining digits
         }
     }
-    public static void reverse(int number) {
-        int reversed = 0;
-        while (number != 0) {
-            reversed = reversed * 10 + number % 10;  // Build the reversed number digit by digit
-            number /= 10;                             // Remove the last digit from the original number
-        }
-        System.out.println(reversed);
+
+    public static void main(String[] args) {
+        Scanner scanner = new Scanner(System.in);
+        System.out.print("Enter an integer: ");
+        int number = scanner.nextInt();
+
+        System.out.print("Reversed: ");
+        reverse(number);
+        System.out.println();
     }
 }

src/main/java/Task2/SeriesComputation613.java

 package Task2;
 
-public class SeriesComputation {
+public class SeriesComputation613 {
     public static void main(String[] args) {
         System.out.println("i\tm(i)");
         System.out.println("----------");

src/main/java/Task2/SortedNumbers65.java

@@ -2,7 +2,7 @@ package Task2;
 
 import java.util.Scanner;
 
-public class SortedNumbers {
+public class SortedNumbers65 {
     public static void main(String[] args) {
         Scanner scanner = new Scanner(System.in);
 

src/main/java/Task2/pentagonal61.java

 package Task2;
 
-public class pentagonal {
+public class pentagonal61 {
 
     public static void main(String[] args) {
         int count = 0;
@@ -9,13 +9,14 @@ public class pentagonal {
             System.out.printf("%7d", getPentagonalNumber(i));
             count++;
 
-            if (count % 10 == 0) {
+            if(count%10==0)
+            {
                 System.out.println();
-                count = 0;
             }
         }
     }
-    public static int getPentagonalNumber(int n) {
-        return n * (3 * n - 1) / 2;
-    }
+   public  static  int getPentagonalNumber(int n)
+   {
+       return  n * (3 * n - 1) / 2;
+   }
 }