1.
Sum using Add()
import [Link];
public class SumProgram {
public static int Add(int a, int b) {
return a + b;
}
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter two numbers: ");
int a = [Link](), b = [Link]();
[Link]("Sum: " + Add(a, b));
}
}
2. Factorial using Fact()
public class FactorialProgram {
public static int Fact(int n) {
int fact = 1;
for (int i = 2; i <= n; i++) fact *= i;
return fact;
}
public static void main(String[] args) {
[Link] sc = new [Link]([Link]);
[Link]("Enter a number: ");
int n = [Link]();
[Link]("Factorial: " + Fact(n));
}
}
3. Reverse using Rev()
public class ReverseProgram {
public static int Rev(int n) {
int rev = 0;
while (n > 0) {
rev = rev * 10 + n % 10;
n /= 10;
}
return rev;
}
public static void main(String[] args) {
[Link] sc = new [Link]([Link]);
[Link]("Enter a number: ");
int n = [Link]();
[Link]("Reverse: " + Rev(n));
}
}
4. LCM using LCM()
public class LCMProgram {
public static int LCM(int a, int b) {
int max = [Link](a, b);
while (true) {
if (max % a == 0 && max % b == 0) return max;
max++;
}
}
public static void main(String[] args) {
[Link] sc = new [Link]([Link]);
[Link]("Enter two numbers: ");
int a = [Link](), b = [Link]();
[Link]("LCM: " + LCM(a, b));
}
}
5. HCF using HCF()
public class HCFProgram {
public static int HCF(int a, int b) {
while (b != 0) {
int t = b;
b = a % b;
a = t;
}
return a;
}
public static void main(String[] args) {
[Link] sc = new [Link]([Link]);
[Link]("Enter two numbers: ");
int a = [Link](), b = [Link]();
[Link]("HCF: " + HCF(a, b));
}
}
6. Prime Check using Isprime()
public class PrimeCheck {
public static boolean Isprime(int n) {
if (n <= 1) return false;
for (int i = 2; i <= [Link](n); i++)
if (n % i == 0) return false;
return true;
}
public static void main(String[] args) {
[Link] sc = new [Link]([Link]);
[Link]("Enter a number: ");
int n = [Link]();
[Link](Isprime(n) ? "Prime" : "Not Prime");
}
}
7. Twin Prime Check using Isprime()
public class TwinPrimeCheck {
public static boolean Isprime(int n) {
if (n <= 1) return false;
for (int i = 2; i <= [Link](n); i++)
if (n % i == 0) return false;
return true;
}
public static void main(String[] args) {
[Link] sc = new [Link]([Link]);
[Link]("Enter two numbers: ");
int a = [Link](), b = [Link]();
if (Isprime(a) && Isprime(b) && [Link](a - b) == 2)
[Link]("Twin Primes");
else
[Link]("Not Twin Primes");
}
}
8. Twisted Prime Check using Isprime() and Rev()
public class TwistedPrimeCheck {
public static boolean Isprime(int n) {
if (n <= 1) return false;
for (int i = 2; i <= [Link](n); i++)
if (n % i == 0) return false;
return true;
}
public static int Rev(int n) {
int rev = 0;
while (n > 0) {
rev = rev * 10 + n % 10;
n /= 10;
}
return rev;
}
public static void main(String[] args) {
[Link] sc = new [Link]([Link]);
[Link]("Enter a number: ");
int n = [Link]();
if (Isprime(n) && Isprime(Rev(n)))
[Link]("Twisted Prime");
else
[Link]("Not Twisted Prime");
}
}
9. Pattern1()
public class Pattern1 {
public static void Pattern1() {
for (int i = 0; i < 5; i++) {
for (int j = 1; j <= 5; j++)
[Link]((j + i - 1) % 5 + 1 + " ");
[Link]();
}
}
public static void main(String[] args) {
Pattern1();
}
}
10. Pattern2()
public class Pattern2 {
public static void Pattern2() {
for (int i = 0; i < 5; i++) {
for (int s = 0; s < i; s++) [Link]("\t");
for (int j = 1; j <= 5 - i; j++) [Link](j + " ");
for (int j = 0; j < i; j++) [Link]((5 - i) + " ");
[Link]();
}
}
public static void main(String[] args) {
Pattern2();
}
}
