Given two integer and , the task is to find the common prime divisors of these numbers.
Input: A = 6, B = 12
Output: 2 3
2 and 3 are the only common prime divisors of 6 and 12
Input: A = 4, B = 8
Naive Approach: Iterate from 1 to min(A, B) and check whether i is prime and a factor of both A and B, if yes then display the number.
Efficient Approach is to do following:
Efficient Approach for multiple queries: The above solution can be further optimized if there are multiple queries for common factors. The idea is based on Prime Factorization using Sieve O(log n) for multiple queries.
Below is the implementation of the above approach:
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.
- Print all numbers whose set of prime factors is a subset of the set of the prime factors of X
- Count common prime factors of two numbers
- Check if a number exists having exactly N factors and K prime factors
- Maximum number of prime factors a number can have with exactly x factors
- Print numbers such that no two consecutive numbers are co-prime and every three consecutive numbers are co-prime
- Find number of factors of N when location of its two factors whose product is N is given
- Maximum count of pairwise co-prime and common divisors of two given numbers
- Number of triangles formed by joining vertices of n-sided polygon with two common sides and no common sides
- K-Primes (Numbers with k prime factors) in a range
- Count numbers from range whose prime factors are only 2 and 3
- Number of distinct prime factors of first n natural numbers
- Count numbers in a range having GCD of powers of prime factors equal to 1
- Count numbers from range whose prime factors are only 2 and 3 using Arrays | Set 2
- Find sum of exponents of prime factors of numbers 1 to N
- Check if a prime number can be expressed as sum of two Prime Numbers
- Absolute Difference between the Sum of Non-Prime numbers and Prime numbers of an Array
- Absolute difference between the Product of Non-Prime numbers and Prime numbers of an Array
- Absolute difference between the XOR of Non-Prime numbers and Prime numbers of an Array
- Count prime numbers that can be expressed as sum of consecutive prime numbers
- Maximum factors formed by two numbers
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.