Skip to content
Related Articles

Related Articles

Improve Article
Sum of multiples of A and B less than N
  • Last Updated : 07 Apr, 2021

Given a number N, the task is to find the sum of all the multiples of A and B below N.
Examples: 
 

Input:N = 11, A= 8, B= 2
Output: Sum = 30
Multiples of 8 less than 11 is 8 only.
Multiples of 2 less than 11 is 2, 4, 6, 8, 10 and their sum is 30.
As 8 is common in both so it is counted only once.

Input: N = 100, A= 5, B= 10
Output: Sum = 950

 

A naive approach is to iterate through 1 to and find the multiples of A and B and add them to sum. At the end of the loop display the sum.
Efficient approach: As the multiples of A will form an AP series a, 2a, 3a…. 
and B forms an AP series b, 2b, 3b … 
On adding the sum of these two series we will get the sum of multiples of both the numbers but there might be some common multiples so remove the duplicates from the sum of these two series by subtracting the multiples of lcm(A, B). So, subtract the series of lcm(A, B) . 
So the sum of multiples of A and B less than N is Sum(A)+Sum(B)-Sum(lcm(A, B)).
Below is the implementation of the above approach: 
 

C++




// CPP program to find the sum of all
// multiples of A and B below N
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
 
// Function to find sum of AP series
ll sumAP(ll n, ll d)
{
    // Number of terms
    n /= d;
 
    return (n) * (1 + n) * d / 2;
}
 
// Function to find the sum of all
// multiples of A and B below N
ll sumMultiples(ll A, ll B, ll n)
{
    // Since, we need the sum of
    // multiples less than N
    n--;
 
    // common factors of A and B
    ll common = (A * B) / __gcd(A, B);
 
    return sumAP(n, A) + sumAP(n, B) - sumAP(n, common);
}
 
// Driver code
int main()
{
    ll n = 100, A = 5, B = 10;
 
    cout << "Sum = " << sumMultiples(A, B, n);
 
    return 0;
}
Java



// Java program to find the sum of all
// multiples of A and B below N
 
class GFG{
 
static int __gcd(int a, int b)
    {
      if (b == 0)
        return a;
      return __gcd(b, a % b); 
    }
     
// Function to find sum of AP series
static int sumAP(int n, int d)
{
    // Number of terms
    n /= d;
 
    return (n) * (1 + n) * d / 2;
}
 
// Function to find the sum of all
// multiples of A and B below N
static int sumMultiples(int A, int B, int n)
{
    // Since, we need the sum of
    // multiples less than N
    n--;
 
    // common factors of A and B
    int common = (A * B) / __gcd(A,B);
 
    return sumAP(n, A) + sumAP(n, B) - sumAP(n, common);
}
 
// Driver code
public static void main(String[] args)
{
    int n = 100, A = 5, B = 10;
 
    System.out.println("Sum = "+sumMultiples(A, B, n));
}
}
// this code is contributed by mits
Python3



# Python 3 program to find the sum of
# all multiples of A and B below N
from math import gcd,sqrt
 
# 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 A and B below N
def sumMultiples(A, B, n):
     
    # Since, we need the sum of
    # multiples less than N
    n -= 1
 
    # common factors of A and B
    common = int((A * B) / gcd(A, B))
 
    return (sumAP(n, A) + sumAP(n, B) -
            sumAP(n, common))
 
# Driver code
if __name__ == '__main__':
    n = 100
    A = 5
    B = 10
 
    print("Sum =", int(sumMultiples(A, B, n)))
 
# This code is contributed by
# Surendra_Gangwar
C#



// C# program to find the sum of all
// multiples of A and B below N
 
class GFG{
 
static int __gcd(int a, int b)
    {
    if (b == 0)
        return a;
    return __gcd(b, a % b);
    }
     
// Function to find sum of AP series
static int sumAP(int n, int d)
{
    // Number of terms
    n /= d;
 
    return (n) * (1 + n) * d / 2;
}
 
// Function to find the sum of all
// multiples of A and B below N
static int sumMultiples(int A, int B, int n)
{
    // Since, we need the sum of
    // multiples less than N
    n--;
 
    // common factors of A and B
    int common = (A * B) / __gcd(A,B);
 
    return sumAP(n, A) + sumAP(n, B) - sumAP(n, common);
}
 
// Driver code
public static void Main()
{
    int n = 100, A = 5, B = 10;
 
    System.Console.WriteLine("Sum = "+sumMultiples(A, B, n));
}
}
// this code is contributed by mits
PHP



<?php
// PHP program to find the sum of all
// multiples of A and B below N
function __gcd($a,$b)
{
    if ($b == 0)
        return $a;
    return __gcd($b, $a % $b);
}
 
// 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 A and B below N
function sumMultiples($A, $B, $n)
{
    // Since, we need the sum of
    // multiples less than N
    $n--;
 
    // common factors of A and B
    $common = (int)(($A * $B) /
               __gcd($A, $B));
 
    return sumAP($n, $A) +
           sumAP($n, $B) -
           sumAP($n, $common);
}
 
// Driver code
$n = 100;
$A = 5;
$B = 10;
 
echo "Sum = " . sumMultiples($A, $B, $n);
 
// This code is contributed by mits
?>
Javascript



<script>
 
// JavaScript  program to find the sum of all
// multiples of A and B below N
function __gcd(a,b)
{
    if (b == 0)
        return a;
    return __gcd(b, a % b);
}
 
// 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 A and B below N
function sumMultiples(A, B, n)
{
    // Since, we need the sum of
    // multiples less than N
    n--;
 
    // common factors of A and B
    common = parseInt((A * B) /
               __gcd(A, B));
 
    return sumAP(n, A) +
           sumAP(n, B) -
           sumAP(n, common);
}
 
// Driver code
let n = 100;
let A = 5;
let B = 10;
 
document.write( "Sum = " + sumMultiples(A, B, n));
 
 
// This code is contributed by bobby
 
</script>
Output: 
Sum = 950
 
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 industry experts, please refer Geeks Classes Live



My Personal Notes
arrow_drop_up
Previous
numpy.save()
Next

Count distinct pairs from two arrays having same sum of digits
Recommended Articles
Page :
Sum of all the multiples of 3 and 7 below N
19, Nov 18
Multiples of 3 or 7
23, Sep 16
Sum of the multiples of two numbers below N
13, Dec 18
Nth number in a set of multiples of A , B or C
24, Sep 19
Find the sum of all multiples of 2 and 5 below N
14, Nov 18
Sum of multiples of a number up to N
26, Oct 17
Kth number from the set of multiples of numbers A, B and C
16, Oct 19
Count of Multiples of A ,B or C less than or equal to N
24, Sep 19
Maximum possible sum of K even multiples of 5 in a given range
23, Dec 20
Find Multiples of 2 or 3 or 5 less than or equal to N
03, Oct 18
Given a number n, count all multiples of 3 and/or 5 in set {1, 2, 3, ... n}
05, Feb 15
Count of multiples in an Array before every element
05, Apr 20
Sum of multiples of Array elements within a given range [L, R]
30, Jun 20
Generate first K multiples of N using Bitwise operators
07, Aug 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
Queries for counts of multiples in an array
05, Oct 17
N-th multiple in sorted list of multiples of two numbers
08, Feb 17
Sort elements of the array that occurs in between multiples of K
15, Mar 19
Count of common multiples of two numbers in a range
30, Oct 18
Count common elements in two arrays containing multiples of N and M
12, Jun 19
Minimum sum after subtracting multiples of k from the elements of the array
26, Nov 18
Largest subsequence such that all indices and all values are multiples individually
15, Jul 20
Minimum prefix increments required to make all elements of an array multiples of another array
31, Jan 21
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
andrew1234
@andrew1234
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