Skip to main content
Walter Baeck's user avatar
Walter Baeck's user avatar
Walter Baeck's user avatar
Walter Baeck
Unregistered
  • Member for 14 years, 4 months
comment
What is the minimum set of combinations C(p,n) required to guarantee q<p matches with a target combination (pT,n)
Thanks Nathann. The paper you referred to, has numerical results for small cases. No closed solution for the general case seems yet to exist. I understand now, why my question was not used on Project Euler.
awarded
awarded
Loading…