I came up with this task two days ago. Then had to sleep over the idea to write this down here. Now, waiting for your insights.

Let P={p_1,p_2,…,p_n}, for , be set of primes. Find the number of combinations of elements of out of which we can build a -divisor number (by multiplying the chosen numbers), . Divisors within a number don’t need to be distinct.

Example: For {3,5,7,11,13}, we have for k=3 e.g. (3,5,11) or (7,11,13), but also (3,3,5), (3,3,3). For k=4 we could have e.g.(3,7,11,13) or (7,7,13,13).

christmas redemption

identity distorted

Another thing, I recently played a little with a function: and noticed that for prime , the result of the function cannot be prime. Then wanted to think that it might be interesting to investigate this function only for prime n.

the vulnerable

### Like this:

Like Loading...

*Related*

## About misha

Imagine a story that one can't believe. Hi. Life changes here. Small things only.