class Numbers {
int data;
Numbers(int n) {
data = n;
}
Boolean prime() {
for (int i = 2; i < data / 2;
i++)
if (data % i ==
0)
return false;
return true;
}
int factorial(int n) {
if (n == 0)
return 1;
else
return n *
factorial(n - 1);
}
int fibonacci(int n) {
if (n == 0)
return 0;
else if (n == 1)
return 1;
else
return
fibonacci(n - 1) + fibonacci(n - 2);
}
int getNum() {
return data;
}
void setNum(int n) {
data = n;
}
}
import java.util.Scanner;
public class NumberMachine {
public static void main(String[] args) {
System.out.println("Enter your
favourate Number :");
Scanner in = new
Scanner(System.in);
int num = in.nextInt();
Numbers obj = new
Numbers(num);
if (obj.prime())
System.out.println("It's prime!!");
else
System.out.println("It's not prime!!");
System.out.println("Enter another
Number for calculating factorial :");
num = in.nextInt();
if (num<0)
System.out.println("ERROR: Negative Number entered by
user!!");
else
System.out.println("Factorial is : " +obj.factorial(num));
System.out.println("Enter another
Number for calculating fibonacci :");
num = in.nextInt();
if (num<0)
System.out.println("ERROR: Negative Number entered by
user!!");
else
System.out.println("Ribonacci is : " +obj.fibonacci(num));
System.out.println("Enter another
Number to reset your favourate number :");
num = in.nextInt();
obj.setNum(num);
System.out.println("Your favourate
number is now : "+obj.getNum());
}
}
No comments:
Post a Comment