Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Sum of all the multiples of 3 and 7 below N

  • Last Updated : 05 Apr, 2021

Given a number N, the task is to find the sum of all the multiples of 3 and 7 below N. 
Note: A number must not repeat itself in the sum.

Examples:  

Input: N = 10 
Output: 25 
3 + 6 + 7 + 9 = 25

Input: N = 24 
Output: 105 
3 + 6 + 7 + 9 + 12 + 14 + 15 + 18 + 21 = 105 

Approach:  

  • We know that multiples of 3 form an AP as S3 = 3 + 6 + 9 + 12 + 15 + 18 + 21 + …
  • And the multiples of 7 form an AP as S7 = 7 + 14 + 21 + 28 + …
  • Now, Sum = S3 + S7 i.e. 3 + 6 + 7 + 9 + 12 + 14 + 15 + 18 + 21 + 21 + …
  • From the previous step, 21 is repeated twice. In fact, all of the multiples of 21 (or 3*7) will be repeated as they are counted twice, once in the series S3 and again in the series S7. So, the multiples of 21 need to be discarded from the result.
  • So, the final result will be S3 + S7 – S21

The formula for the sum of an AP series is : 
n * ( a + l ) / 2 
Where n is the number of terms, a is the starting term, and l is the last term. 
 

Below is the implementation of the above approach:  

C++




// C++ program to find the sum of all
// multiples of 3 and 7 below N
 
#include <bits/stdc++.h>
using namespace std;
 
// Function to find sum of AP series
long long sumAP(long long n, long long d)
{
    // Number of terms
    n /= d;
 
    return (n) * (1 + n) * d / 2;
}
 
// Function to find the sum of all
// multiples of 3 and 7 below N
long long sumMultiples(long long n)
{
    // Since, we need the sum of
    // multiples less than N
    n--;
 
    return sumAP(n, 3) + sumAP(n, 7) - sumAP(n, 21);
}
 
// Driver code
int main()
{
    long long n = 24;
 
    cout << sumMultiples(n);
 
    return 0;
}
Java



// Java program to find the sum of all
// multiples of 3 and 7 below N
import java.util.*;
 
class solution
{
 
// Function to find sum of AP series
static long sumAP(long n, long d)
{
    // Number of terms
    n /= d;
 
    return (n) * (1 + n) * d / 2;
}
 
// Function to find the sum of all
// multiples of 3 and 7 below N
static long sumMultiples(long n)
{
    // Since, we need the sum of
    // multiples less than N
    n--;
 
    return sumAP(n, 3) + sumAP(n, 7) - sumAP(n, 21);
}
 
// Driver code
public static void main(String args[])
{
    long n = 24;
 
    System.out.println(sumMultiples(n));
 
 }
}
 
//This code is contributed by Surendra_Gangwar
Python3



# Python3 program to find the sum of
# all multiples of 3 and 7 below N
 
# Function to find sum of AP series
def sumAP(n, d):
     
    # Number of terms
    n = int(n / d);
 
    return (n) * (1 + n) * (d / 2);
 
# Function to find the sum of all
# multiples of 3 and 7 below N
def sumMultiples(n):
 
    # Since, we need the sum of
    # multiples less than N
    n -= 1;
 
    return int(sumAP(n, 3) +
               sumAP(n, 7) -
               sumAP(n, 21));
 
# Driver code
n = 24;
 
print(sumMultiples(n));
 
# This code is contributed
# by mits
C#



// C# program to find the sum of all
// multiples of 3 and 7 below N
using System;
 
class GFG
{
 
// Function to find sum of AP series
static long sumAP(long n, long d)
{
    // Number of terms
    n /= d;
 
    return (n) * (1 + n) * d / 2;
}
 
// Function to find the sum of all
// multiples of 3 and 7 below N
static long sumMultiples(long n)
{
    // Since, we need the sum of
    // multiples less than N
    n--;
 
    return sumAP(n, 3) + sumAP(n, 7) -
                         sumAP(n, 21);
}
 
// Driver code
static public void Main(String []args)
{
    long n = 24;
 
    Console.WriteLine(sumMultiples(n));
}
}
 
// This code is contributed
// by Arnab Kundu
PHP



<?php
// PHP program to find the sum of all
// multiples of 3 and 7 below N
 
// Function to find sum of AP series
function sumAP($n, $d)
{
    // Number of terms
    $n = (int)($n / $d);
 
    return ($n) * (1 + $n) * ($d / 2);
}
 
// Function to find the sum of all
// multiples of 3 and 7 below N
function sumMultiples($n)
{
    // Since, we need the sum of
    // multiples less than N
    $n--;
 
    return sumAP($n, 3) +
           sumAP($n, 7) - sumAP($n, 21);
}
 
// Driver code
$n = 24;
 
echo sumMultiples($n);
 
// This code is contributed
// by Akanksha Rai
?>
Javascript



<script>
 
// JavaScript program to find the sum of all
// multiples of 3 and 7 below N
 
// Function to find sum of AP series
function sumAP(n, d)
{
     
    // Number of terms
    n = parseInt(n / d);
 
    return (n) * (1 + n) * (d / 2);
}
 
// Function to find the sum of all
// multiples of 3 and 7 below N
function sumMultiples(n)
{
     
    // Since, we need the sum of
    // multiples less than N
    n--;
 
    return sumAP(n, 3) +
           sumAP(n, 7) -
           sumAP(n, 21);
}
 
// Driver code
let n = 24;
 
document.write(sumMultiples(n));
 
// This code is contributed by mohan1240760
 
</script>
Output: 
105
 

My Personal Notes
arrow_drop_up
Previous
Check whether product of digits at even places is divisible by sum of digits at odd place of a number
Next

Find Selling Price from given Profit Percentage and Cost
Recommended Articles
Page :
Find the sum of all multiples of 2 and 5 below N
14, Nov 18
Sum of the multiples of two numbers below N
13, Dec 18
Find the sum of all Truncatable primes below N
12, Mar 19
Print all safe primes below N
14, Jan 19
Count of numbers below N whose sum of prime divisors is K
11, Sep 19
Minimum numbers needed to express every integer below N as a sum
09, Nov 18
Count of primes below N which can be expressed as the sum of two primes
09, Dec 19
Largest subsequence such that all indices and all values are multiples individually
15, Jul 20
Given a number n, count all multiples of 3 and/or 5 in set {1, 2, 3, ... n}
05, Feb 15
Sum of multiples of A and B less than N
23, Nov 18
Check if a number N can be represented as a sum of multiples of 3, 5, and 7
30, Nov 21
Rearrange all elements of array which are multiples of x in increasing order
05, Nov 18
Minimum prefix increments required to make all elements of an array multiples of another array
31, Jan 21
Sum of multiples of a number up to N
26, Oct 17
Minimum sum after subtracting multiples of k from the elements of the array
26, Nov 18
Sum of multiples of Array elements within a given range [L, R]
30, Jun 20
Value required to be added to N to obtain the sum of first M multiples of K
14, Feb 21
Sum of array elements which are multiples of a given number
31, Jan 21
Maximum possible sum of K even multiples of 5 in a given range
23, Dec 20
Find minimum value of K to maximise sum of elements on indices that are multiples of K
27, Dec 21
Count common elements in two arrays containing multiples of N and M
12, Jun 19
Find numbers which are multiples of first array and factors of second array
30, Sep 19
Kth number from the set of multiples of numbers A, B and C
16, Oct 19
N-th multiple in sorted list of multiples of two numbers
08, Feb 17
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
pawan_asipu
@pawan_asipu
Vote for difficulty





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

Start Your Coding Journey Now!