import java.util.

Scanner;

/**
* Java program to calculate and print Fibonacci number using both recursion and
Iteration.
* Fibonacci number is sum of previous two Fibonacci numbers fn= fn-1+ fn-2
* first 10 Fibonacci numbers are 1, 1, 2, 3, 5, 8, 13, 21, 34, 55
* @author
*/
public class FibonacciCalculator {

public static void main(String args[]) {

//input to print Fibonacci series upto how many numbers

System.out.println("Enter number upto which Fibonacci series to print: ");
int number = new Scanner(System.in).nextInt();

System.out.println("Fibonacci series upto " + number +" numbers : ");

//printing Fibonacci series upto number
for(int i=1; i<=number; i++){
System.out.print(fibonacci2(i) +" ");
}

/*
* Java program for Fibonacci number using recursion.
* This program uses tail recursion to calculate Fibonacci number for a given
number
* @return Fibonacci number
*/
public static int fibonacci(int number){
if(number == 1 || number == 2){
return 1;
}

return fibonacci(number-1) + fibonacci(number -2); //tail recursion

}

/*
* Java program to calculate Fibonacci number using loop or Iteration.
* @return Fibonacci number
*/
public static int fibonacci2(int number){
if(number == 1 || number == 2){
return 1;
}
int fibo1=1, fibo2=1, fibonacci=1;
for(int i= 3; i<= number; i++){
fibonacci = fibo1 + fibo2; //Fibonacci number is sum of previous two
Fibonacci number
fibo1 = fibo2;
fibo2 = fibonacci;
 }
return fibonacci; //Fibonacci number

Output:
Enter number upto which Fibonacci series to print:
12
Fibonacci series upto 12 numbers :
1 1 2 3 5 8 13 21 34 55 89 144

import java.util.Scanner;

/**
* Simple Java program to reverse a number in Java using loop and operator
* This program also shows example of using division operator(/) and Remainder
Operator(%)
*/
public class ReverseNumberExample {

public static void main(String args[]) {

//input number to reverse
System.out.println("Please enter number to be reversed using Java program: ");
int number = new Scanner(System.in).nextInt();

int reverse = reverse(number);

System.out.println("Reverse of number: " + number + " is " +
reverse(number));

/*
* reverse a number in Java using iteration
* @return reverse of number
*/
public static int reverse(int number){
int reverse = 0;
int remainder = 0;
do{
remainder = number%10;
reverse = reverse*10 + remainder;
number = number/10;

}while(number > 0);

return reverse;
}

Output:
Please enter number to be reversed using Java program:
1234
Reverse of number: 1234 is 4321
import java.util.Scanner;

/**
* Simple Java Program to check or find if a number is Armstrong number or not.
* An Armstrong number of three digit is a number whose sum of cubes of its digit is
equal
* to its number. For example 153 is an Armstrong number of 3 digit because
1^3+5^3+3^3 or 1+125+27=153
* @author Javin
*/
public class ArmstrongTest{

public static void main(String args[]) {

//input number to check if its Armstrong number

System.out.println("Please enter a 3 digit number to find if its an Armstrong
number:");
int number = new Scanner(System.in).nextInt();

//printing result
if(isArmStrong(number)){
System.out.println("Number : " + number + " is an Armstrong number");
}else{
System.out.println("Number : " + number + " is not an Armstrong number");
}

/*
* @return true if number is Armstrong number or return false
*/
private static boolean isArmStrong(int number) {
int result = 0;
int orig = number;
while(number != 0){
int remainder = number%10;
result = result + remainder*remainder*remainder;
number = number/10;
}
//number is Armstrong return true
if(orig == result){
return true;
}

return false;
}

Output:
Please enter a 3 digit number to find if its an Armstrong number:
153
Number : 153 is an Armstrong number
import java.util.Scanner;

/**
* Simple Java program to print prime numbers from 1 to 100 or any number.
* A prime number is a number which is greater than 1 and divisible
* by either 1 or itself.
*/
public class PrimeNumberExample {

public static void main(String args[]) {

//get input till which prime number to be printed

System.out.println("Enter the number till which prime number to be printed: ");
int limit = new Scanner(System.in).nextInt();

//printing primer numbers till the limit ( 1 to 100)

System.out.println("Printing prime number from 1 to " + limit);
for(int number = 2; number<=limit; number++){
//print prime numbers only
if(isPrime(number)){
System.out.println(number);
}
}

/*
* Prime number is not divisible by any number other than 1 and itself
* @return true if number is prime
*/
public static boolean isPrime(int number){
for(int i=2; i<number; i++){
if(number%i == 0){
return false; //number is divisible so its not prime
}
}
return true; //number is prime now
}
}

Output:
Enter the number till which prime number to be printed:
20
Printing prime number from 1 to 20
2
3
5
7
11
13
17
19

import java.util.Scanner;
/**
* Simple Java program to print prime numbers from 1 to 100 or any number.
* A prime number is a number which is greater than 1 and divisible
* by either 1 or itself.
*/
public class PrimeNumberExample {

public static void main(String args[]) {

//get input till which prime number to be printed

System.out.println("Enter the number till which prime number to be printed: ");
int limit = new Scanner(System.in).nextInt();

//printing primer numbers till the limit ( 1 to 100)

System.out.println("Printing prime number from 1 to " + limit);
for(int number = 2; number<=limit; number++){
//print prime numbers only
if(isPrime(number)){
System.out.println(number);
}
}

/*
* Prime number is not divisible by any number other than 1 and itself
* @return true if number is prime
*/
public static boolean isPrime(int number){
for(int i=2; i<number; i++){
if(number%i == 0){
return false; //number is divisible so its not prime
}
}
return true; //number is prime now
}
}

Output:
Enter the number till which prime number to be printed:
20
Printing prime number from 1 to 20
2
3
5
7
11
13
17
19