尼科马丘定理

Nicomachu定理指出，前n个自然数的立方和等于自然数和的平方。
$1^{3}+2^{3}+3^{3}+\cdots +n^{3}=\left(1+2+3+\cdots +n\right)^{2}$
换句话说
$1^{3}+2^{3}+3^{3}+\cdots +n^{3}=\left(n*(n+1)/2)^{2}$
或者我们可以说和等于第n个三角数的平方。
在这里可以找到基于数学归纳法的证明。

C++

// CPP program to verify Nicomachu's Theorem
#include 
using namespace std;
 
void NicomachuTheorum_sum(int n)
{
   // Compute sum of cubes
   int sum = 0;
   for (int k=1; k<=n; k++)
      sum += k*k*k;
    
   // Check if sum is equal to
   // given formula.
   int triNo = n*(n+1)/2;
   if (sum == triNo * triNo)
     cout << "Yes";
   else
     cout << "No";
}
 
// driver function
int main()
{
    int n = 5;
    NicomachuTheorum_sum(n);
    return 0;
}

Java

// Java program to verify Nicomachu's Theorem
import java.io.*;
 
class GFG {
 
    static void NicomachuTheorum_sum(int n)
    {
         
        // Compute sum of cubes
        int sum = 0;
         
        for (int k = 1; k <= n; k++)
            sum += k * k * k;
             
        // Check if sum is equal to
        // given formula.
        int triNo = n * (n + 1) / 2;
         
        if (sum == triNo * triNo)
            System.out.println("Yes");
        else
            System.out.println("No");
    }
     
    // driver function
    public static void main (String[] args)
    {
        int n = 5;
        NicomachuTheorum_sum(n);
    }
}
 
// This code is contributed by anuj_67.

Python3

# Python3 program to verify
# Nicomachu's Theorem
 
def NicomachuTheorum_sum(n):
     
    # Compute sum of cubes
    sum = 0;
    for k in range(1, n + 1):
        sum += k * k * k;
         
    # Check if sum is equal to
    # given formula.
    triNo = n * (n + 1) / 2;
    if (sum == triNo * triNo):
        print("Yes");
    else:
        print("No");
 
# Driver Code
n = 5;
NicomachuTheorum_sum(n);
 
# This code is contributed
# by mits

C#

// C# program to verify
// Nicomachu's Theorem
using System;
  
class GFG {
  
    static void NicomachuTheorum_sum(int n)
    {
          
        // Compute sum of cubes
        int sum = 0;
          
        for (int k = 1; k <= n; k++)
            sum += k * k * k;
              
        // Check if sum is equal to
        // given formula.
        int triNo = n * (n + 1) / 2;
          
        if (sum == triNo * triNo)
            Console.WriteLine("Yes");
        else
            Console.WriteLine("No");
    }
      
    // Driver Code
    public static void Main ()
    {
        int n = 5;
        NicomachuTheorum_sum(n);
    }
}
  
// This code is contributed by anuj_67

Javascript

 
// JavaScript program to verify Nicomachu's Theorem
 
    function NicomachuTheorum_sum(n)
    {
           
        // Compute sum of cubes
        let sum = 0;
           
        for (let k = 1; k <= n; k++)
            sum += k * k * k;
               
        // Check if sum is equal to
        // given formula.
        let triNo = n * (n + 1) / 2;
           
        if (sum == triNo * triNo)
            document.write("Yes");
        else
            document.write("No");
    }
       
 
// Driver code
 
        let n = 5;
        NicomachuTheorum_sum(n);
           
          // This code is contributed by souravghosh0416.

输出：

Yes