I got what we have done here…but i want to just ask like…we can tell if there an integer A such that it has exactly X positive integer divisors and exactly K of them are prime numbers.
Example - A=6 has X=4 factors: 1, 2, 3 and 6. It also has exactly K=2 prime factors: 2 and 3.
We have to tell just print yes or no there exsist or not…its a question of some other like codeshef… i am finding this problem so hard…please help
Number Theory Doubt
@archa_1712
you could construct sieve so that you know all the prime numbers then just run an iterator from 1 to sqrt(num) and if the i is divisor just check if it is prime or not and same for num/i. This way you can see the total number of divisors as well as the number of divisors which are prime.Please share question link for more help.
okay…