Skip to main content

Play febnocci and factorial on BigNumbers ...

BigNumberOperations.java
---------------------------------------------

package com.blogspot.developerssbrain;

import java.math.BigDecimal;

public class BigNumberOperations {

    static BigDecimal factorial(int n){
        BigDecimal fact=new BigDecimal("1");
        while(n>0){
            fact=fact.multiply(new BigDecimal(n));
            n--;
        }
        return fact;
    }
   
    static BigDecimal febnocci(int n){
        BigDecimal i=new BigDecimal("1");
        BigDecimal j=new BigDecimal("1");
        while(n-2>0){
            j=j.add(i);
            i=j.subtract(i);
            n--;
        }
        return j;
    }
   
    public static void main(String[] args) {
        //Factorial of 5
        System.out.println("Factorial of 5");
        System.out.println(factorial(5));
        System.out.println();
       
        //Factorial of 300
        System.out.println("Factorial of 300!!!");
        System.out.println(factorial(300));   
        System.out.println();
       
        //10th febnocci number
        System.out.println("10th febnocci number");
        System.out.println(febnocci(10));
        System.out.println();
       
        //Febnocci of 400
        System.out.println("1000th febnocci number");
        System.out.println(febnocci(1000));
        System.out.println();
    }

}

Output:
----------------------------
Factorial of 5
120

Factorial of 300!!!
306057512216440636035370461297268629388588804173576999416776741259476533176716867465515291422477573349939147888701726368864263907759003154226842927906974559841225476930271954604008012215776252176854255965356903506788725264321896264299365204576448830388909753943489625436053225980776521270822437639449120128678675368305712293681943649956460498166450227716500185176546469340112226034729724066333258583506870150169794168850353752137554910289126407157154830282284937952636580145235233156936482233436799254594095276820608062232812387383880817049600000000000000000000000000000000000000000000000000000000000000000000000000

10th febnocci number
55

1000th febnocci number
43466557686937456435688527675040625802564660517371780402481729089536555417949051890403879840079255169295922593080322634775209689623239873322471161642996440906533187938298969649928516003704476137795166849228875





Comments

Post a Comment

Popular posts from this blog

Java Interface

Problem Statement A Java interface can only contain method signatures and fields. Interface can be used to achieve polymorphism. In this problem you will practice your knowledge on interfaces. You are given an interface   AdvancedArithmetic   which contains a method signature   public abstract int divisorSum(int n) . You need to write a class called MyCalculator which implements the interface. divisorSum   function just takes an integer as input and return the sum of all its divisors. For example divisors of 6 are 1,2,3 and 6, so   divisorSum   should return 12. Value of n will be at most 1000. Read the partially completed code in the editor and complete it. You just need to write the MyCalculator class only.   Your class shouldn't be public. Sample Input 6 Sample Output I implemented: AdvancedArithmetic 12 Explanation Divisors of 6 are 1,2,3 and 6. 1+2+3+6=12. import java.util.*; interface AdvancedArithmetic{   public abstract int divisorSum(int n

Problem: Java Exception Handling

Problem Statement Create a class myCalculator which consists of a single method power(int,int). This method takes two integers,   n   and   p , as parameters and finds   n p . If either   n   or   p   is negative, then the method must throw an exception which says "n and p should be non-negative". Please read the partially completed code in the editor and complete it. Your code mustn't be public. No need to worry about constraints, there won't be any overflow if your code is correct. Sample Input 3 5 2 4 -1 -2 -1 3 Sample Output 243 16 java.lang.Exception: n and p should be non-negative java.lang.Exception: n and p should be non-negative import  java.util.*; class myCalculator{     int power(int n,int p) throws java.lang.Exception{         int power=1;         while(p>0){             power=power*(n);             p--;         }                 if(n==0) power=0;                if(n<0 | p<0){       

Google Cloud Shell | Delete instance