
a. write a program to find squares and cubes of 1st 10 integers
b. write a program to to calculate factorial of a no,
c. write a program to print Fibonacci series
d. write a program to check whether entered no is prime or not
e. write a program to print given pattern
*
* * *
* * * * *
* * *
*

e. write a program to print given pattern * * * * * * * * * * * * *

1)
class SquaresAndCubes
{
public static void main(String[] args)
{
System.out.println("No Square Cube");
for(int i=1;i<=10;i++){
int sq=i*i;
int cu=i*i*i;
System.out.println(i+"\t "+sq+"\t "+cu);
}
}
}

2)
import java.util.*;
class Factorial{
public static void main(String[] args)
{
Scanner input=new Scanner(System.in);
System.out.print("Enter value of m: ");
int m=input.nextInt();
long num=m;
for(int i=m;i>1;i--){
num=num*(i-1);
}
System.out.println(num);
}
}

3)
import java.util.*;
public class Fibonacci{
public static void main(String[] args) throws Exception {
Scanner input=new Scanner(System.in);
System.out.print("Enter value of n: ");
int sum=0;
int num = input.nextInt();
int f1=0,f2=0,f3=1;
for(int i=1;i<=num;i++){
System.out.println(f3);
sum+=f3;
f1=f2;
f2=f3;
f3=f1+f2;
}
System.out.println("Sum of Fibonacci Series: "+sum);
}
}

4)
import java.util.*;
class CheckPrimeNumber
{
static boolean isPrime(int number){
boolean isPrime=false;
int i=(int) Math.ceil(Math.sqrt(number));
while (i>1){
if((number!=i) && (number%i==0)){
isPrime=false;
break;
}
else if (!isPrime)
isPrime=true;
--i;
}
return isPrime;
}
public static void main(String[] args)
{
Scanner input=new Scanner(System.in);
System.out.println("Enter Number:");
int num=input.nextInt();
if(isPrime(num)){
System.out.println("Number is Prime!");
}
else{
System.out.println("Number is not prime!");
}
}
}

5)
public class PatternExample {
public static void main(String[] args) {
int n = 2;
for (int i = -n; i <= n; i++) {
for (int j = -n; j <= n; j++) {
if (Math.abs(i) + Math.abs(j) <= n){
System.out.print("* ");
}
else{
System.out.print(" ");
}
}
System.out.println();
}
}
}