Sum of subset products

01262014, 09:14 AM
Post: #1




Sum of subset products
I hope somebody here can think of an elegant way of calculating the sum of the products of all the (n1) element subsets of an nelement set in PPL. In other words:
{A B} > A+B {A B C} > AB+AC+BC {A B C D} > ABC+ABD+ACD+BCD etc. Brute force by looping is ... brutish. There must be an elegant way of doing this on the HP Prime, since it has so many list and array functions. Thanks in advance! <0ΙΈ0> Joe 

« Next Oldest  Next Newest »

Messages In This Thread 
Sum of subset products  Joe Horn  01262014 09:14 AM
RE: Sum of subset products  Joe Horn  01262014, 10:03 AM

User(s) browsing this thread: 1 Guest(s)