Has anyone considered this problem ? For arbitrary input set with length of n ( i.e. n squares), what is the upperbound for the number of different results ?

# An interesting problem

## An interesting problem

For more complete information about compiler optimizations, see our Optimization Notice.

Hi,

We haven't set any upper bound on the number of different results to report. So, please report all possible.

Thanks

-Rama

However, I do not know if it is the exact upperbound.

I think that's not correct.The worst possible combination is one of the form:2*3*5*7*11*13*17*19**...For example for :

2*3*5*7*11*13*17*19 =9699690

log(9699690)/log(2) =~23.21

But the number of possible solutions is 2^8=256 for that example.

Could you please give us an input file (n ordered integers) next time ? Then I can check the number of results by my solver. I believe the test cases are best for demonstration.

This test case is very interesting.

It still shows for a very large input, the number of solutions will not too large respect to the input.

Anyway, I believe you have given a very special case to demostrate the quickly increasing of the number of solutions.