Skip to main content

13. Program to calculate for BINOMIAL SERIES and MID TERM

#Program to calculate binomial series and middle term

import math
check=int(input(''' Please choose
1. For middle term
2. For binomial theorem'''))
#This is for finding the factorial for combination
def factorial(number):
    c=1
    if(number==0):
        return 1
    for i in range(number,0,-1):
        c=c*i
    return c

def combination(p,q):
    if(p>=q):
        
        return factorial(p)/(factorial(q)*factorial(p-q))
    else:
        print('you have written n less which is incorrect')
def midtermfind(limit,termid):
    print('Program to find the answer by binomial series ')
    print('series is in the sequence (a+b) to the power n')

    a=int(input('enter a of the formula'))
    b=int(input('enter b of the formula'))
    result=0
    
    comb=combination(int(limit),int(termid))
    result=result+(comb*math.pow(a,(limit-termid))*math.pow(b,termid))
    print('The mid term  is =',int(result))
    
def binomial():
    print('Program to find the answer by binomial series ')
    print('series is in the sequence (a+b) to the power n')

    a=int(input('enter a of the formula'))
    b=int(input('enter b of the formula'))
    n=int(input('enter n of the formula'))
    result=0
    
    for i in range(0,n+1):
        comb=combination(n,i)
        result=result+(comb*math.pow(a,(n-i))*math.pow(b,i))
    print('The result for this is =',int(result))
def midterm():
    n=int(input('enter the power n of the series '))
    if(n%2==0):
        print(n,'is even number and it has only one mid term')
        mid=(n/2+1)
        print('The mid term is',int(mid),'term')
        midcheck=1
    elif(n%2!=0):
        print(n,'is odd number and it has 2 mid term')
        mid=(n+1)/2
        mid2=(n+3)/2
        print('First middle term is',int(mid),'term  and second mid term is',int(mid2),'term')
        midcheck=1
    while(midcheck==1):
        midchoice=int(input('press 1 if you want to know the middle term'))
        if(midchoice==1):
            midtermfind(n,mid)
            midcheck=0
        else:
            print('you have entered wrong key ')
        
#to check the choice 
if(check==1):
    midterm()
if(check==2):
    binomial()

Comments

Popular posts from this blog

Firebase 9.0: A New Era of App Development

Firebase 9.0: A New Era of App Development Firebase, Google's mobile and web development platform, has just released its latest version, Firebase 9.0. This major update brings a number of new features and improvements, making it easier and faster than ever to build and deploy high-quality apps. Here are some of the highlights of Firebase 9.0: New AI Extensions powered by the PaLM API Firebase now includes a number of new AI Extensions that can be used to add powerful features to your apps, such as natural language processing, image recognition, and machine translation. Introducing the Extensions publishing experience Firebase Extensions are now available to be published and shared with the community. This makes it easy for developers to find and use the extensions they need, and it also gives developers the opportunity to share their own extensions with the world. Cloud Functions for Firebase 2nd gen supports Python Cloud Functions for Firebase is a serverless platform that lets y

BEE ASSIGNMENT

 Here is the solution of BEE ASSIGNMENT    QUESTION 1 - QUESTION 5 Question 6 to Question 10  For maths assignment : click here  

Index Sequential Search

 Code for Index Sequential Search  import java . util .*; public class Index_search {     public static void main ( String [] args ) {         int i , a = 0 ;         Scanner in = new Scanner ( System . in );         int arr [] = { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 10 };         System . out . println ( "Please enter the number to be find: " );         int num = in . nextInt ();         System . out . println ( "Please enter the steps to left" );         int steps = in . nextInt ();         in . close ();         for ( i = 0 ; i < arr . length ; ) {             if ( num == arr [ i ] ) {                 System . out . println ( "Number found in the first one. " + i );                 a = 1 ;                 break ;             }             else if ( num < arr [ i ]){                 break ;             }             i = i + steps ;         }         if ( a == 0 ) {             for ( int j = ( i - steps )+ 1 ; j < i ; j +