Which the least number n can we imagine in product n = a∙b like k ways? Products a∙b and b∙a is one of the way, where all numbers is natural (1≤ k ≤50).
One number k.
One number n.
Could you describe the algorithms. I have one complicated algro using the first theorem of arithmetics, but it can't pass a few tests.