hcf and lcm formulas - Wikitechy https://www.wikitechy.com/interview-questions/tag/hcf-and-lcm-formulas/ Interview Questions Tue, 14 Sep 2021 05:52:29 +0000 en-US hourly 1 https://wordpress.org/?v=6.9 https://www.wikitechy.com/interview-questions/wp-content/uploads/2025/10/cropped-wikitechy-icon-32x32.png hcf and lcm formulas - Wikitechy https://www.wikitechy.com/interview-questions/tag/hcf-and-lcm-formulas/ 32 32 Find the smallest 4 digit number which is divisible by 18, 24, 32 ? https://www.wikitechy.com/interview-questions/lcm-and-hcf/find-the-smallest-4-digit-number-which-is-divisible-by-18-24-32/ https://www.wikitechy.com/interview-questions/lcm-and-hcf/find-the-smallest-4-digit-number-which-is-divisible-by-18-24-32/#respond Tue, 17 Aug 2021 17:54:58 +0000 https://www.wikitechy.com/interview-questions/?p=1845

Find the smallest 4 digit number which is divisible by 18, 24, 32 ?

A. 1216

B. 1512

C. 1152

D. 1680

Answer : C. 1152

Explanation:

LCM of 18, 24 and 32:
–> 18 = 2 x 3 x 3
–> 24 = 2 x 2 x 2 x 3
–> 32 = 2 x 2 x 2 x 2 x 2
LCM = 2 x 2 x 2 x 2 x 2 x 3 x 3 = 288.

The smallest four digit number that is divisible by 288:
288 x 3 = 864
288 x 4 = 1152

Since 288 is divisible by 18, 24 and 32, 1152 is also divisible by all these numbers. Therefore, 1152 is the smallest four digit number divisible by 18, 24 and 32.

]]> https://www.wikitechy.com/interview-questions/lcm-and-hcf/find-the-smallest-4-digit-number-which-is-divisible-by-18-24-32/feed/ 0 Find the greatest number which on dividing 1661 and 2045, leaves a remainder of 10 and 13 respectively ? https://www.wikitechy.com/interview-questions/lcm-and-hcf/find-the-greatest-number-which-on-dividing-1661-and-2045-leaves-a-remainder-of-10-and-13-respectively/ https://www.wikitechy.com/interview-questions/lcm-and-hcf/find-the-greatest-number-which-on-dividing-1661-and-2045-leaves-a-remainder-of-10-and-13-respectively/#respond Tue, 17 Aug 2021 17:48:26 +0000 https://www.wikitechy.com/interview-questions/?p=1842

Find the greatest number which on dividing 1661 and 2045, leaves a remainder of 10 and 13 respectively ?

A. 91

B. 127

C. 137

D. 140

Answer : B . 127

Explanation:

In this type of question, we need to calculate the HCF, trick is,
HCF (1661 – 10) and (2045 -13)
= HCF (1651, 2032)
= 127

]]> https://www.wikitechy.com/interview-questions/lcm-and-hcf/find-the-greatest-number-which-on-dividing-1661-and-2045-leaves-a-remainder-of-10-and-13-respectively/feed/ 0 How to find LCM of two Numbers in C ? https://www.wikitechy.com/interview-questions/c/how-to-find-lcm-of-two-numbers-in-c/ https://www.wikitechy.com/interview-questions/c/how-to-find-lcm-of-two-numbers-in-c/#respond Mon, 12 Jul 2021 21:04:03 +0000 https://www.wikitechy.com/interview-questions/?p=339 To Find LCM of Two Numbers in C
  • The LCM of two numbers a and b is the smallest positive integer that is perfectly divisible by both a and b (without a remainder). For example: The LCM of 72 and 120 is 360.

Sample Code

#include <stdio.h> 
// Recursive function to return gcd of a and b
int gcd(int a, int b)
{
// Everything divides 0
    if (a == 0 || b == 0)
        return 0;
// Base case
    if (a == b)
        return a;
// a is greater
    if (a > b)
        return gcd(a-b, b);
    return gcd(a, b-a);
}
// Function to return LCM of two numbers
int lcm(int a, int b)
{
    return (a*b)/gcd(a, b);
}
// Driver program to test above function
int main()
{
    int a = 10, b = 28;
    printf("LCM of %d and %d is %d ", a, b, lcm(a, b));
    return 0;
}

Output

LCM of 10 and 28 is 140
]]> https://www.wikitechy.com/interview-questions/c/how-to-find-lcm-of-two-numbers-in-c/feed/ 0