Hi! Everyone, i Recently found a problem in which i have given two integers x and K denoting the total number of divisors a number and number of prime divisors respectively. The task is to find wheather that number could exist or not ? we can do it for the small number like: we can clearly observe that for a number with 2 prime factors the minimum number of divisors is 4 i.e there is no number with 2 prime factors and exactly three 3 divisors.
so ,can we generalize this result for bigger values of k.. plzz someone help me with this
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
plz someone help me with this..