🚀 go-pugleaf

Bruce Varley <bv@nospam.com> wrote:
> This is an outcome of an industrial problem that's been solved with some 
> brute force computer work, this posting is just a result of my curiosity.
> We had the task of checking an array of integers for duplicates, due to the 
> hardware involved the traditional approaches weren't suitable. One of our 
> people came up with an algo that works for the cases that we encounter in 
> the field,  I'm wondering whether the result holds for all n.
> There is an array of n integers between 1 and n, with no repeated members, 
> in any order. Let P be the product of all the entries, and S be the sum.
> The postulate is that no other set of n integers, all between 1 and n 
> (obviously containing repeats) will have the same values for both P and S.


1 54 55 	sum 110 product 2970

5 6 99

---
You whackos [i.e. "scientists"] just keep changing your "predictions" to suit reality!
  -- BONZO@27-32-240-172 [86 nyms and counting], 16 Feb 2011 15:57 +1100