All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Three tasks (Posted on 2014-08-21) Difficulty: 3 of 5
Given a 12-member set of consecutive integers (1,2,311,12).
Partition it into 3 subsets, each with a distinct number of members ,
e.g . A=(1,2); B=(3,5,11,12) & C=(4,6,7,8,9,10).
Evaluate the sums of the members for each of the subsets, in our example:
Sa=3 ; Sb=31 & Sc=44;

Now evaluate:
F1 (product of the three sums) = Sa * Sb * Sc, i.e. 3*31*44 = 4092 in our example.

F2= Sa * Sb + Sc; equals to 93+44=137 in our case.

F3= d(Sa) +d(Sb) + d(Sc); where d(N) is the number of N's divisors.
So in our case F3=2+2+6 = 10.

The 3 independent tasks :

Executing the above procedures find the partitions of the main set, that provide maximum values for F1, F2 & F3.

No Solution Yet Submitted by Ady TZIDON    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Question Are null sets allowed? | Comment 1 of 3
I would assume yes, but the author tends to not like null sets for some reason.  Ady?
  Posted by Steve Herman on 2014-08-21 15:01:58
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information