Question

In Java

Implement a program that reads two integers (n and k). The program must output the binomial coefficient as follows: Inn! (k)k!(n. - (n k > 0) (1) Also, print every coefficient that is before binomial coefficient for given k; Example: Insert n: 5 Insert k: 3 Result: 10 Coefficient-array: 1 5 10 10

Answer 1

import java.util.Scanner;
public class factorial {

//declaration of function fact()
//used to find the factorial of the given number
public static long fact(int n)
   {
       //factorial of 1 and 0 is equal to 1
       //if value is less than equal to 1 return 1
       if(n <= 1)
       return 1;
       else
       //recursive function fact() to find factorial
       //This recuraion repeats upto n become 1
       //when value become 1 then it starts return the value and returned values is multiplied with value in variable n.finally after all iteration it return the final result to called function.
       return n * fact(n - 1);
      
   }
   //main starts here
public static void main(String[] args) {
  
   //Scanner class used to get the input from user
   Scanner s = new Scanner(System.in);
   System.out.print("Enter n value: ");
   //Enter the value of n
   int n = s.nextInt();
   System.out.print("Enter k value: ");
   //Enter the value of k
   int k = s.nextInt();
  
   long result;
   //calling the function fact()
   // binomial coefficient = n!/(k!(n-k)!)
   result = fact(n)/(fact(k)*fact(n-k));
   //Displays the result for binomial coefficient
   System.out.println("Result: "+result);
   System.out.print("Coefficient-array:");
   //Displays the result for everu coefficient that is before bionimal coefficient for given k
   for(int i = 0; i<= k;i++)
   {
      result = fact(n)/(fact(i)*fact(n-i));
      System.out.print(" "+result);
   }
}
}

import java.util.Scanner; public class factorial { //declaration of function facto //used to find the factorial of the given number public static long fact(int n) -N mono 00 oC-omino //factorial of 1 and 0 is equal to 1 //if value is less than equal to 1 return 1 if(n <= 1) return 1; else //recursive function facto to find factoria //This recuraion repeats upto n become 1 //when value become 1 then it starts return the value and returned values is multiplied with value in variable n. finally after all iteration it return the final result to called function. return n * fact(n - 1); 17 18 //main starts here public static void main(String[] args) { 23 I/Scanner class used to get the input from user Scanner s = new Scanner(System.in); System.out.print("Enter n value: "); //Enter the value of n int n = s.nextInt(); System.out.print("Enter k value: "); //Enter the value of k int k = s.nextInt();. 27 28 32 long result;

the value and returned values is multiplied with value in variable n. finally after all iteration it return the final result to called function. return n * fact(n - 1); 17 18 //main starts here public static void main(String[] args) { I/Scanner class used to get the input from user Scanner s = new Scanner(System.in); System.out.print("Enter n value: "); //Enter the value of n int n = s.nextInt();. System.out.print("Enter k value: "); //Enter the value of k int k = s.nextInt(); 31 39 long result; //calling the function facto // binomial coefficient = n!/(k!(n-k)!) result = fact(n)/(fact(k)*fact(n-k)); //Displays the result for binomial coefficient System.out.println("Result: "+result); System.out.print("Coefficient-array:"); 1/Displays the result for everu coefficient that is before bionimal coefficient for given k for (int i = 0; i<= k; i++) { result = fact(n)/(fact(i)*fact(n-i); System.out.print(" "+result); } } } 41 44. 45 46

Enter n value: 5 Enter k value: 3 Result: 10 Coefficient-array: 15 10 10

Enter n value: 10 Enter k value: 4 Result: 210 Coefficient-array: 1 10 45 120 210