Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Sum of first N natural numbers which are divisible by X or Y

  • Last Updated : 11 May, 2022

Given a number N. Given two numbers X and Y, the task is to find the sum of all those numbers from 1 to N that are divisible by X or by Y.
Examples: 
 

Input : N = 20
Output : 98

Input : N = 14 
Output : 45

Approach: To solve the problem, follow the below steps:
->Find the sum of numbers that are divisible by X upto N. Denote it by S1. 
->Find the sum of numbers that are divisible by Y upto N. Denote it by S2. 
->Find the sum of numbers that are divisible by both X and Y (X*Y) upto N. Denote it by S3. 
->The final answer will be S1 + S2 – S3.
In order to find the sum, we can use the general formula of A.P. which is: 
 

Sn = (n/2) * {2*a + (n-1)*d}

For S1: The total numbers that will be divisible by X upto N will be N/X and the sum will be: 
 

Hence, 
S1 = ((N/X)/2) * (2 * X + (N/X - 1) * X)

For S2: The total numbers that will be divisible by Y upto N will be N/Y and the sum will be: 
 

Hence, 
S2 = ((N/Y)/2) * (2 * Y + (N/Y - 1) * Y)

For S3: The total numbers that will be divisible by both X and Y upto N will be N/(X*Y) and the sum will be: 
 

Hence, 
S2 = ((N/(X*Y))/2) * (2 * Y + (N/(X*Y) - 1) * (X*Y))

Therefore, the result will be: 
 

S = S1 + S2 - S3

Below is the implementation of the above approach: 
 

C++




// C++ program to find sum of numbers from
// 1 to N which are divisible by X or Y
#include <bits/stdc++.h>
using namespace std;
 
// Function to calculate the sum
// of numbers divisible by X or Y
int sum(int N, int X, int Y)
{
    int S1, S2, S3;
 
    S1 = ((N / X)) * (2 * X + (N / X - 1) * X) / 2;
    S2 = ((N / Y)) * (2 * Y + (N / Y - 1) * Y) / 2;
    S3 = ((N / (X * Y))) * (2 * (X * Y)
                      + (N / (X * Y) - 1) * (X * Y))/ 2;
 
    return S1 + S2 - S3;
}
 
// Driver code
int main()
{
    int N = 14;
    int X = 3, Y = 5;
 
    cout << sum(N, X, Y);
 
    return 0;
}
Java



// Java program to find sum of numbers from
// 1 to N which are divisible by X or Y
 
public class GFG{
     
    // Function to calculate the sum
    // of numbers divisible by X or Y
    static int sum(int N, int X, int Y)
    {
        int S1, S2, S3;
     
        S1 = ((N / X)) * (2 * X + (N / X - 1) * X) / 2;
        S2 = ((N / Y)) * (2 * Y + (N / Y - 1) * Y) / 2;
        S3 = ((N / (X * Y))) * (2 * (X * Y)
                          + (N / (X * Y) - 1) * (X * Y))/ 2;
     
        return S1 + S2 - S3;
    }
     
    // Driver code
    public static void main(String []args)
    {
        int N = 14;
        int X = 3, Y = 5;
     
        System.out.println(sum(N, X, Y));
     
    }
    // This code is contributed by Ryuga
}
Python3



# Python 3 program to find sum of numbers from
# 1 to N which are divisible by X or Y
from math import ceil, floor
 
# Function to calculate the sum
# of numbers divisible by X or Y
def sum(N, X, Y):
    S1 = floor(floor(N / X) * floor(2 * X +
               floor(N / X - 1) * X) / 2)
    S2 = floor(floor(N / Y)) * floor(2 * Y +
               floor(N / Y - 1) * Y) / 2
    S3 = floor(floor(N / (X * Y))) * floor (2 * (X * Y) +
               floor(N / (X * Y) - 1) * (X * Y))/ 2
 
    return S1 + S2 - S3
 
# Driver code
if __name__ == '__main__':
    N = 14
    X = 3
    Y = 5
 
    print(int(sum(N, X, Y)))
 
# This code is contributed by
# Surendra_Gangwar
C#



// C# program to find sum of numbers from
// 1 to N which are divisible by X or Y
  
using System;
public class GFG{
      
    // Function to calculate the sum
    // of numbers divisible by X or Y
    static int sum(int N, int X, int Y)
    {
        int S1, S2, S3;
      
        S1 = ((N / X)) * (2 * X + (N / X - 1) * X) / 2;
        S2 = ((N / Y)) * (2 * Y + (N / Y - 1) * Y) / 2;
        S3 = ((N / (X * Y))) * (2 * (X * Y)
                          + (N / (X * Y) - 1) * (X * Y))/ 2;
      
        return S1 + S2 - S3;
    }
      
    // Driver code
    public static void Main()
    {
        int N = 14;
        int X = 3, Y = 5;
      
        Console.Write(sum(N, X, Y));
      
    }
     
}
PHP



<?php
// PHP program to find sum of numbers from
// 1 to N which are divisible by X or Y
// Function to calculate the sum
// of numbers divisible by X or Y
function sum($N, $X, $Y)
{
    $S1; $S2; $S3;
 
    $S1 = floor(((int)$N / $X)) * (2 * $X + (int)((int)$N / $X - 1) * $X) / 2;
    $S2 = floor(((int)$N / $Y)) * (2 * $Y + (int)((int)$N / $Y - 1) * $Y) / 2;
    $S3 = floor(((int)$N / ($X * $Y))) * (2 * ($X * $Y)
                    + ((int)$N / ($X * $Y) - 1) * (int)($X * $Y))/ 2;
 
    return ceil($S1 + ($S2 - $S3));
}
 
// Driver code
    $N = 14;
    $X = 3;
    $Y = 5;
 
    echo  sum($N, $X, $Y);
 
#This code is contributed by ajit.
?>
Javascript



<script>
// javascript program to find sum of numbers from
// 1 to N which are divisible by X or Y
 
     
// Function to calculate the sum
// of numbers divisible by X or Y
function sum(N , X , Y)
{
    var S1, S2, S3;
 
    S1 = (parseInt(N / X)) * (2 * X + parseInt(N / X - 1) * X) / 2;
    S2 = (parseInt(N / Y)) * (2 * Y + parseInt(N / Y - 1) * Y) / 2;
    S3 = (parseInt(N / (X * Y))) * (2 * (X * Y)
                      + parseInt(N / (X * Y) - 1) * (X * Y))/ 2;
 
    return S1 + S2 - S3;
}
 
// Driver code
var N = 14;
var X = 3, Y = 5;
 
document.write(sum(N, X, Y));
 
// This code is contributed by Princi Singh
</script>
C



// C program to find sum of numbers from
// 1 to N which are divisible by X or Y
#include <stdio.h>
 
// Function to calculate the sum
// of numbers divisible by X or Y
int sum(int N, int X, int Y)
{
    int S1, S2, S3;
 
    S1 = ((N / X)) * (2 * X + (N / X - 1) * X) / 2;
    S2 = ((N / Y)) * (2 * Y + (N / Y - 1) * Y) / 2;
    S3 = ((N / (X * Y))) * (2 * (X * Y) + (N / (X * Y) - 1) * (X * Y))/ 2;
    return S1 + S2 - S3;
}
 
// Driver code
int main()
{
    int N = 14;
    int X = 3, Y = 5;
    printf("%d ",sum(N, X, Y));
    return 0;
}
Output: 
45
 
Time Complexity : O(1)
 

My Personal Notes
arrow_drop_up
Previous
Sum of first N natural numbers which are divisible by 2 and 7
Next

Sum of numbers from 1 to N which are divisible by 3 or 4
Recommended Articles
Page :
Sum of first N natural numbers which are divisible by 2 and 7
05, Nov 18
Number of pairs from the first N natural numbers whose sum is divisible by K
12, Mar 19
Check whether factorial of N is divisible by sum of first N natural numbers
01, Apr 19
Check if factorial of N is divisible by the sum of squares of first N natural numbers
28, Mar 19
Check if product of first N natural numbers is divisible by their sum
12, Apr 19
Sum of first N natural numbers which are not powers of K
22, Nov 18
Check if the concatenation of first N natural numbers is divisible by 3
25, Jul 20
Kth element in permutation of first N natural numbers having all even numbers placed before odd numbers in increasing order
03, Mar 21
Sum of first K numbers which are not divisible by N
22, May 20
Minimize sum of numbers required to convert an array into a permutation of first N natural numbers
14, Jun 21
Generate a sequence from first X natural numbers which adds up to S on raising 2 to the power of their lowest set bits
03, Jan 21
Difference between sum of the squares of first n natural numbers and square of sum
22, Dec 17
Difference between Sum of Cubes and Sum of First N Natural Numbers
17, Sep 19
Sum of sum-series of first N Natural numbers
26, Jun 20
Check if a given number can be expressed as pair-sum of sum of first X natural numbers
12, Sep 20
Sum of sum of all subsets of a set formed by first N natural numbers
22, Aug 18
Find the Nth natural number which is not divisible by A
19, May 20
Find the first natural number whose factorial is divisible by x
12, Jan 17
Bitwise XOR of first N natural numbers that are product of two distinct Prime Numbers
03, Jun 21
Sum of cubes of first n odd natural numbers
02, Sep 17
Program to find sum of first n natural numbers
17, Sep 17
Program for cube sum of first n natural numbers
05, Oct 17
C++ Program for cube sum of first n natural numbers
05, Oct 17
Sum of all subsets of a set formed by first n natural numbers
07, Oct 17
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
gfg_sal_gfg
@gfg_sal_gfg
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!