Write a function that calculates the Greatest Common Divisor of 2 numbers.
import java.util.*;
public class Solutions {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int n1 = sc.nextInt();
int n2 = sc.nextInt();
while(n1 != n2) {
if(n1>n2) {
n1 = n1 - n2;
} else {
n2 = n2 - n1;
}
}
System.out.println("GCD is : "+ n2);
}
}
Two numbers are entered by the user, x and n. Write a function to find the value of one number raised to the power of another i.e. x^n.
Take an array of Strings input from the user & find the cumulative (combined) length of all those strings.
Write a program to print Fibonacci series of n terms where n is input by user :
0 1 1 2 3 5 8 13 21 .....
In the Fibonacci series, a number is the sum of the previous 2 numbers that came before it.