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

Home > Just Math
Minimizing disjoint sum (Posted on 2023-06-20) Difficulty: 2 of 5
Let A and B be two non-empty subsets of X = {1, 2, . . . , 8 } with A ∪ B = X and A ∩ B = ∅. Let PA be the product of all elements of A and let PB be the product of all elements of B. Find the minimum possible value of PA +PB.

No Solution Yet Submitted by Danish Ahmed Khan    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Solution | Comment 1 of 6
A and B form two halves of a partition of X, so then the product of all the elements of X is the same as the product PA*PB.  Then this value  is 8!=40320.  

There is a classic problem "Given the product of two positive numbers is Z, what is the smallest possible sum of the two numbers?" The answer is that each number equals sqrt(Z), with a sum 2*sqrt(Z).

So then to adapt this to our problem, we want to factor 8! into two parts, by partitioning the integers 1-8, so that the two terms are as close as possible.

sqrt(8!) ~= 200.8.  PA=1*5*6*7=210 and PB=2*3*4*8=192 is the closest we can get by shuffling around the integers 1-8.  Then the minimum possible value of PA+PB is 210+192=402.

  Posted by Brian Smith on 2023-06-20 11:00:15
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


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

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information