C++ Program for cube sum of first n natural numbers

C++ Program For Sum of Natural Numbers Using Recursion

Last Updated : 23 Jun, 2023

Natural numbers include all positive integers from 1 to infinity. It does not include zero (0). Given a number n, find the sum of the first n natural numbers. To calculate the sum, we will use the recursive function recur_sum().

Sum of first N numbers

Examples:

Input: 3
Output: 6
Explanation: 1 + 2 + 3 = 6

Input: 5
Output: 15
Explanation: 1 + 2 + 3 + 4 + 5 = 15

The Sum of Natural Numbers Using Recursion

Below is a C++ program to find the sum of natural numbers up to n using recursion:

C++

// C++ program to find the sum
// of natural numbers up to n
// using recursion
#include <iostream>
using namespace std;
 
// Returns sum of first
// n natural numbers
int recurSum(int n)
{
    if (n <= 1)
        return n;
 
    return n + recurSum(n - 1);
}
 
// Driver code
int main()
{
    int n = 5;
    cout << recurSum(n);
 
    return 0;
}

Output

C++ Program for cube sum of first n natural numbers

kartik

Improve

Article Tags :

Practice Tags :

CPP

Similar Reads

C++ Program to Find Factorial of a Large Number Using Recursion

Given a large number N, task is to find the factorial of N using recursion. Factorial of a non-negative integer is the multiplication of all integers smaller than or equal to n. For example factorial of 6 is 6*5*4*3*2*1 which is 720. Examples: Input : N = 100Output : 93326215443944152681699238856266

C++ Program for Sum of squares of first n natural numbers

Given a positive integer N. The task is to find 12 + 22 + 32 + ..... + N2. Examples: Input : N = 4 Output : 30 12 + 22 + 32 + 42 = 1 + 4 + 9 + 16 = 30 Input : N = 5 Output : 55 Method 1: O(N) The idea is to run a loop from 1 to n and for each i, 1 2 to sum. C/C++ Code // CPP Program to find sum of s

C++ Program to Find Factorial Using Recursion

The factorial of a number is denoted by "n!" and it is the product of all positive integers less than or equal to n. In this article, we will learn how to find the factorial of a number using recursion in C++. Example Input: 5 Output: Factorial of 5 is 120 Factorial Using Recursion in C++The Factori

C++ Program To Find Sum of First N Natural Numbers

Natural numbers are those positive whole numbers starting from 1 (1, 2, 3, 4, ...). In this article, we will learn to write a C++ program to calculate the sum of the first N natural numbers. AlgorithmInitialize a variable sum = 0.Run a loop from i = 1 to n.Inside the loop, add the value of i to the

C++ Program for cube sum of first n natural numbers

Write a C++ program to print the sum of series 13 + 23 + 33 + 43 + .......+ n3 till the n-th term. Examples: Input: n = 5Output: 225Explanation: 13 + 23 + 33 + 43 + 53 = 225 Input: n = 7Output: 784Explanation: 13 + 23 + 33 + 43 + 53 + 63 + 73 = 784 C++ Program for cube sum of first n natural numbers

C++ Program for Ways to sum to N using Natural Numbers up to K with repetitions allowed

Given two integers N and K, the task is to find the total number of ways of representing N as the sum of positive integers in the range [1, K], where each integer can be chosen multiple times. Examples: Input: N = 8, K = 2Output: 5Explanation: All possible ways of representing N as sum of positive i

C++ Program to Print an Array using Recursion

Write a program in C++ to print an Array using Recursion 1. Using Static Variable Static variables have the property of preserving their value even after they are out of their scope! Hence, static variables preserve their previous value in their previous scope and are not initialized again in the ne

C++ Program To Find Factorial Of A Number

The Factorial of a non-negative integer is the multiplication of all integers smaller than or equal to n. For example, the factorial of 6 is 6*5*4*3*2*1 which is 720. Recursive Solution Factorial can be calculated using the following recursive formula. n! = n * (n-1)! n! = 1 if n = 0 or n = 1 Below

Recursive program to find all Indices of a Number

Given an array arr of size N and an integer X. The task is to find all the indices of the integer X in the arrayExamples: Input: arr = {1, 2, 3, 2, 2, 5}, X = 2 Output: 1 3 4 Element 2 is present at indices 1, 3, 4 (0 based indexing)Input: arr[] = {7, 7, 7}, X = 7 Output: 0 1 2 The iterative approac

Sum of array Elements without using loops and recursion

Given an array of N elements, the task is to find the Sum of N elements without using loops(for, while & doWhile) and recursion.Examples: Input: arr[]={1, 2, 3, 4, 5} Output: 15 Input: arr[]={10, 20, 30} Output: 60 j Approach: Unconditional Jump Statements can be used to solve this problem.Uncon