The Wayback Machine - https://web.archive.org/web/20211016005930/https://www.geeksforgeeks.org/sum-squares-binomial-coefficients/
Skip to content
Related Articles

Related Articles

Improve Article

Sum of squares of binomial coefficients

  • Difficulty Level : Easy
  • Last Updated : 06 May, 2021

Given a positive integer n. The task is to find the sum of square of Binomial Coefficient i.e 
nC02 + nC12 + nC22 + nC32 + ……… + nCn-22 + nCn-12 + nCn2 
Examples: 
 

Input : n = 4
Output : 70

Input : n = 5
Output : 252

 

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

Method 1: (Brute Force) 
The idea is to generate all the terms of binomial coefficient and find the sum of square of each binomial coefficient.
Below is the implementation of this approach: 
 



C++




// CPP Program to find the sum of square of
// binomial coefficient.
#include<bits/stdc++.h>
using namespace std;
 
// Return the sum of square of binomial coefficient
int sumofsquare(int n)
{
    int C[n+1][n+1];
    int i, j;
 
    // Calculate value of Binomial Coefficient
    // in bottom up manner
    for (i = 0; i <= n; i++)
    {
        for (j = 0; j <= min(i, n); j++)
        {
            // Base Cases
            if (j == 0 || j == i)
                C[i][j] = 1;
 
            // Calculate value using previously
            // stored values
            else
                C[i][j] = C[i-1][j-1] + C[i-1][j];
        }
    }   
     
    // Finding the sum of square of binomial
    // coefficient.
    int sum = 0;
    for (int i = 0; i <= n; i++)   
        sum += (C[n][i] * C[n][i]);   
     
    return sum;
}
 
// Driven Program
int main()
{
    int n = 4;   
    cout << sumofsquare(n) << endl;
    return 0;
} 
Java



// Java Program to find the sum of
// square of binomial coefficient.
import static java.lang.Math.*;
 
class GFG{
         
    // Return the sum of square of
    // binomial coefficient
    static int sumofsquare(int n)
    {
        int[][] C = new int [n+1][n+1] ;
        int i, j;
     
        // Calculate value of Binomial
        // Coefficient in bottom up manner
        for (i = 0; i <= n; i++)
        {
            for (j = 0; j <= min(i, n); j++)
            {
                // Base Cases
                if (j == 0 || j == i)
                    C[i][j] = 1;
     
                // Calculate value using
                //previously stored values
                else
                    C[i][j] = C[i-1][j-1]
                             + C[i-1][j];
            }
        }
         
        // Finding the sum of square of
        // binomial coefficient.
        int sum = 0;
        for (i = 0; i <= n; i++)
            sum += (C[n][i] * C[n][i]);
         
        return sum;
    }
     
    // Driver function
    public static void main(String[] args)
    {
        int n = 4;
         
        System.out.println(sumofsquare(n));
    }
}
 
// This code is contributed by
// Smitha Dinesh Semwal
Python3



# Python Program to find
# the sum of square of
# binomial coefficient.
 
# Return the sum of
# square of binomial
# coefficient
def sumofsquare(n) :
     
    C = [[0 for i in range(n + 1)]
            for j in range(n + 1)]
             
    # Calculate value of
    # Binomial Coefficient
    # in bottom up manner
    for i in range(0, n + 1) :
     
        for j in range(0, min(i, n) + 1) :
                     
            # Base Cases
            if (j == 0 or j == i) :
                C[i][j] = 1
 
            # Calculate value
            # using previously
            # stored values
            else :
                C[i][j] = (C[i - 1][j - 1] +
                           C[i - 1][j])
 
     
    # Finding the sum of
    # square of binomial
    # coefficient.
    sum = 0
    for i in range(0, n + 1) :
        sum = sum + (C[n][i] *
                     C[n][i])
     
    return sum
 
 
# Driver Code
n = 4
print (sumofsquare(n), end="\n")
     
# This code is contributed by
# Manish Shaw(manishshaw1)
C#



// C# Program to find the sum of
// square of binomial coefficient.
using System;
 
class GFG {
         
    // Return the sum of square of
    // binomial coefficient
    static int sumofsquare(int n)
    {
        int[,] C = new int [n+1,n+1] ;
        int i, j;
     
        // Calculate value of Binomial
        // Coefficient in bottom up manner
        for (i = 0; i <= n; i++)
        {
            for (j = 0; j <= Math.Min(i, n); j++)
            {
                // Base Cases
                if (j == 0 || j == i)
                    C[i,j] = 1;
     
                // Calculate value using
                //previously stored values
                else
                    C[i,j] = C[i-1,j-1]
                            + C[i-1,j];
            }
        }
         
        // Finding the sum of square of
        // binomial coefficient.
        int sum = 0;
        for (i = 0; i <= n; i++)
            sum += (C[n,i] * C[n,i]);
         
        return sum;
    }
     
    // Driver function
    public static void Main()
    {
        int n = 4;
         
        Console.WriteLine(sumofsquare(n));
    }
}
 
// This code is contributed by vt_m.
PHP



<?php
// PHP Program to find the sum of
// square of binomial coefficient.
 
// Return the sum of square of binomial
// coefficient
function sumofsquare($n)
{
    $i; $j;
 
    // Calculate value of Binomial
    // Coefficient in bottom up manner
    for ($i = 0; $i <= $n; $i++)
    {
        for ($j = 0; $j <= min($i, $n); $j++)
        {
             
            // Base Cases
            if ($j == 0 || $j == $i)
                $C[$i][$j] = 1;
 
            // Calculate value using previously
            // stored values
            else
                $C[$i][$j] = $C[$i-1][$j-1]
                                + $C[$i-1][$j];
        }
    }
     
    // Finding the sum of square of binomial
    // coefficient.
    $sum = 0;
    for ($i = 0; $i <= $n; $i++)
        $sum += ($C[$n][$i] * $C[$n][$i]);
     
    return $sum;
}
 
// Driven Program
    $n = 4;
    echo sumofsquare($n), "\n";
     
// This code is contributed by ajit
?>
Javascript



<script>
 
// JavaScript Program to find the sum of
// square of binomial coefficient.
 
    // Return the sum of square of
    // binomial coefficient
    function sumofsquare(n)
    {
        let  C = new Array(n+1);
         
        // Loop to create 2D array using 1D array
        for (let i = 0; i < C.length; i++) {
            C[i] = new Array(2);
        }
         
        let  i, j;
       
        // Calculate value of Binomial
        // Coefficient in bottom up manner
        for (i = 0; i <= n; i++)
        {
            for (j = 0; j <= Math.min(i, n); j++)
            {
             
                // Base Cases
                if (j == 0 || j == i)
                    C[i][j] = 1;
       
                // Calculate value using
                //previously stored values
                else
                    C[i][j] = C[i-1][j-1]
                             + C[i-1][j];
            }
        }
           
        // Finding the sum of square of
        // binomial coefficient.
        let sum = 0;
        for (i = 0; i <= n; i++)
            sum += (C[n][i] * C[n][i]);
           
        return sum;
    }
 
// Driver code    
        let  n = 4;
        document.write(sumofsquare(n));
        
       // This code is contributed by code_hunt.
</script>
Output:  
70
Method 2: (Using Formula) 
^nC^2_0 + ^nC^2_1 + ^nC^2_2 + .... + ^nC^2_n-1 + ^nC^2_n    
= ^2nC_n    
= \frac{(2n)!}{(n!)^2}    
Proof, 
 
We know,
(1 + x)n = nC0 + nC1 x + nC2 x2 + ......... + nCn-1 xn-1 + nCn-1 xn
Also,
(x + 1)n = nC0 xn + nC1 xn-1 + nC2 xn-2 + ......... + nCn-1 x + nCn

Multiplying above two equations,
(1 + x)2n = [nC0 + nC1 x + nC2 x2 + ......... + nCn-1 xn-1 + nCn-1 xn] X 
            [nC0 xn + nC1 xn-1 + nC2 xn-2 + ......... + nCn-1 x + nCn]

Equating coefficients of xn on both sides, we get
2nCn = nC02 + nC12 + nC22 + nC32 + ......... + nCn-22 + nCn-12 + nCn2

Hence, sum of the squares of coefficients = 2nCn = (2n)!/(n!)2.
Also, (2n)!/(n!)2 = (2n * (2n – 1) * (2n – 2) * ….. * (n+1))/(n * (n – 1) * (n – 2) *….. * 1).
Below is the implementation of this approach: 
 
C++



// CPP Program to find the sum of square of
// binomial coefficient.
#include<bits/stdc++.h>
using namespace std;
 
// function to return product of number
// from start to end.
int factorial(int start, int end)
{
    int res = 1;
    for (int i = start; i <= end; i++)
        res *= i;
         
    return res;
}
 
// Return the sum of square of binomial
// coefficient
int sumofsquare(int n)
{
    return factorial(n+1, 2*n)/factorial(1, n);
}
 
// Driven Program
int main()
{
    int n = 4;   
    cout << sumofsquare(n) << endl;
    return 0;
}
Java



// Java Program to find the sum of square of
// binomial coefficient.
class GFG{
     
    // function to return product of number
    // from start to end.
    static int factorial(int start, int end)
    {
        int res = 1;
        for (int i = start; i <= end; i++)
            res *= i;
             
        return res;
    }
     
    // Return the sum of square of binomial
    // coefficient
    static int sumofsquare(int n)
    {
        return factorial(n+1, 2*n)/factorial(1, n);
    }
     
    // Driven Program
    public static void main(String[] args)
    {
        int n = 4;
        System.out.println(sumofsquare(n));
    }
}
 
// This code is contributed by
// Smitha DInesh Semwal
Python



# Python 3 Program to find the sum of
# square of binomial coefficient.
 
# function to return product of number
# from start to end.
def factorial(start, end):
 
    res = 1
     
    for i in range(start, end + 1):
        res *= i
         
    return res
 
# Return the sum of square of binomial
# coefficient
def sumofsquare(n):
 
    return int(factorial(n + 1, 2 * n)
                     /factorial(1, n))
 
# Driven Program
 
n = 4
print(sumofsquare(n))
 
 
# This code is contributed by
# Smitha Dinesh Semwal
C#



// C# Program to find the sum of square of
// binomial coefficient.
using System;
 
class GFG {
     
    // function to return product of number
    // from start to end.
    static int factorial(int start, int end)
    {
        int res = 1;
         
        for (int i = start; i <= end; i++)
            res *= i;
             
        return res;
    }
     
    // Return the sum of square of binomial
    // coefficient
    static int sumofsquare(int n)
    {
        return factorial(n+1, 2*n)/factorial(1, n);
    }
     
    // Driven Program
    public static void Main()
    {
        int n = 4;
         
        Console.WriteLine(sumofsquare(n));
    }
}
 
// This code is contributed by vt_m.
PHP



<?php
// PHP Program to find the sum
// of square of binomial coefficient.
 
// function to return
// product of number
// from start to end.
function factorial($start, $end)
{
    $res = 1;
    for ($i = $start;
         $i <= $end; $i++)
        $res *= $i;
         
    return $res;
}
 
// Return the sum of
// square of binomial
// coefficient
function sumofsquare($n)
{
    return factorial($n + 1,
                     2 * $n) /
           factorial(1, $n);
}
 
// Driver Code
$n = 4;
echo sumofsquare($n), "\n";
     
// This code is contributed by ajit
?>
Javascript



<script>
 
    // Javascript Program to find
    // the sum of square of
    // binomial coefficient.
     
    // function to return product of number
    // from start to end.
    function factorial(start, end)
    {
        let res = 1;
          
        for (let i = start; i <= end; i++)
            res *= i;
              
        return res;
    }
      
    // Return the sum of square of binomial
    // coefficient
    function sumofsquare(n)
    {
        return parseInt
        (factorial(n+1, 2*n)/factorial(1, n), 10);
    }
     
    let n = 4;
          
      document.write(sumofsquare(n));
     
</script>
Output:  
70
 



My Personal Notes
arrow_drop_up
Previous
Snake case of a given sentence
Next

Sum of the series 2 + (2+4) + (2+4+6) + (2+4+6+8) + …… + (2+4+6+8+….+2n)
Recommended Articles
Page :
Sum of Binomial coefficients
14, Dec 17
Find sum of even index binomial coefficients
22, Dec 17
Sum of all products of the Binomial Coefficients of two numbers up to K
03, Aug 20
Sum of product of consecutive Binomial Coefficients
14, Jun 18
Program for Binomial Coefficients table
15, Dec 17
Count odd and even Binomial Coefficients of N-th power
21, Dec 20
Mathematics | PnC and Binomial Coefficients
03, Oct 17
Sum of product of r and rth Binomial Coefficient (r * nCr)
03, Jun 18
Minimize the sum of the squares of the sum of elements of each group the array is divided into
11, Feb 19
Find K numbers with sum equal to N and sum of their squares maximized
07, May 20
Binomial Random Variables
27, Jul 17
Corollaries of Binomial Theorem
02, Jun 18
Middle term in the binomial expansion series
17, May 18
Maximum binomial coefficient term value
18, Dec 17
Program to print binomial expansion series
08, Mar 18
Binomial Mean and Standard Deviation - Probability | Class 12 Maths
30, Nov 20
Central binomial coefficient
26, Jun 20
Eggs dropping puzzle (Binomial Coefficient and Binary Search Solution)
03, Sep 18
Space and time efficient Binomial Coefficient
15, Oct 12
Binomial Coefficient | DP-9
11, Feb 12
Count all subarrays whose sum can be split as difference of squares of two Integers
10, May 20
Maximum possible sum of squares of stack elements satisfying the given properties
09, Oct 20
Sum of squares of first n natural numbers
06, Dec 17
Sum of squares of first n natural numbers
10, Dec 17
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
anuj0503
@anuj0503
Vote for difficulty
Current difficulty :
Easy





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox