After the murder of a wealthy landlord inside his own house, Holmes and I were called to investigate the scene. According to his secretary, the victim had been holding a charity fair for the past days before being found dead in his working room this morning. Holmes suspected the culprit was one of the guests coming in these past few days because the log book keeping all the guests' names was missing.
When asked about the number of guests on the first and second party day, the secretary could not recall the exact numbers but ascertained that there were both odd numbers (greater than from her memory) of men and women on both days, with more men on the first day. Moreover, she added that each man would donate Shillings while each woman donate Shillings into the box placed at the front door. Interestingly, she claimed the total fund earned was the same for both days, and when she told us such amount of fund, Holmes instantly portrayed numbers of men and women on each day.
I: How could you confidently know the number of guests on both days just by knowing the amount of fund?
Holmes: Can't you see, Watson, that the amount of fund earned on each day couldn't come from one gender's donation alone? But if we take one man's or one woman's donation out, then we couldn't tell.
I: That I'm well aware, but we didn't even know any number of men or women on either day yet.
Holmes: Actually, even if we knew any of that, we still wouldn't know the amount of fund earned at all.
Despite his seemingly inconceivable deduction, I admitted he had been right the whole time after hearing his explanations.
How much money, in Shillings, was earned on each charity day? (Bonus: Can you work out the number of men and women guests on each day as well?)
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let S stand for the solution amount fund earned on each day; a , b be the odd numbers of men and women on the first day respectively; and c , d be the odd numbers of men and women on the second day respectively with distinct a , b , c , d > 3 . We can conclude that S = 5 a + 3 b = 5 c + 3 d , and so alternatively, we could then write the matrix system as the following:
[ a c b d ] [ 5 3 ] = [ S S ]
Since a , b , c , d be odd and greater than 3 as there were men and women in the party, we are looking at the ways the even S can be rewritten in the sum of 2 composite odd numbers. Then since Holmes found out the numbers of guests immediately after knowing S , that means there are only 2 ways that S can be rewritten in such summations. That is, S = 5 a + 3 b = 5 c + 3 d is the only combination.
In order to find such combinations, let us learn first that 5 + 3 ≡ 3 ( m o d 5 ) ≡ 5 ( m o d 3 ) naturally. Now, if we add 3 n into it for some non-negative integer n , we will get a new number of 5 + 3 + 3 n , and to make it even as S , n must also be even. Hence, let us rewrite it as 5 + 3 + 3 n = 5 + 3 + 6 m for some natural number m . Then there are more ways to break it down the multiples of 3 , but if m < 5 , the only multiple of 5 remains as 5 + ( 3 + 6 m ) because in order to increase the multiple of 5 and retaining the multiple of 3 , we must be able to obtain some quotient when dividing m by 5 . Thus, m must exceed 5 .
Then let us rewrite it as 5 + 3 + 6 m = 5 + 3 + 6 ( 5 q + r ) = 5 + 3 + 3 0 q + 6 r for some positive quotient q and non-negative r .
By similar methods, we can altogether rewrite S = 5 + 3 + 3 0 q + 6 r + 1 0 s and, also, S ≥ 5 + 3 + 3 0 q .
Let us take q = 1 , for example. Then 5 + 3 + 3 0 = 3 8 = 5 + 3 3 = 3 + 3 5 . There are no ways to write it as the sum of odd composites, and so we need to add the cominations of 6 r and 1 0 s . The candidate numbers then are:
5 + 3 + 3 0 + 6 + 1 0 = 5 4 ;
5 + 3 + 3 0 + 1 2 + 1 0 = 6 0 ;
5 + 3 + 3 0 + 6 + 2 0 = 6 4 .
However, Holmes told us that S could not be of men's or women's donations alone. That means S itself is not a multiple of 3 or 5 , so only 6 4 = 2 5 + 3 9 = 9 + 5 5 remains, but with S = 6 4 , b = 3 is contradicted.
Now for q = 2 , we have 5 + 3 + 6 0 = 6 8 = 3 3 + 3 5 . This is the only summation of odd composites. By using the same restrictions of S as non-divisible by 3 or 5 and a , b , c , d > 3 , we will seek out more candidate numbers:
6 8 + 1 8 = 8 6 = 5 1 + 3 5 = 2 1 + 6 5 ;
6 8 + 2 0 = 8 8 = 3 3 + 5 5 = 6 3 + 2 5 ;
6 8 + 2 4 = 9 2 = 2 7 + 6 5 = 5 7 + 3 5 ;
Then for q = 3 we will obtain: 9 8 = 6 5 + 3 3 = 3 5 + 6 3 .
Then 9 8 + 6 = 1 0 4 = 6 5 + 3 9 = 3 5 + 6 9 = 9 + 9 5 ;
9 8 + 2 0 = 1 1 8 = 8 5 + 3 3 = 5 5 + 6 3 = 2 5 + 9 3 ;
9 8 + 1 8 = 1 1 6 = 6 5 + 5 1 = 3 5 + 6 9 = 9 5 + 2 1 ;
9 8 + 2 4 = 1 2 2 = 6 5 + 5 7 = 3 5 + 7 7 = 9 5 + 2 1 ;
At this point, if we keep on adding 6 r or 1 0 s , it will cause the number of S summations to be greater than 2 . Thus, this is our upper limit though 1 0 4 = 6 5 + 3 9 = 3 5 + 6 9 might be possible, given that we rule out 9 + 9 5 out. We will then investigate our candidate numbers.
In order to visualize a , b , c , d , let us rewrite them in the matrix systems:
[ 1 3 7 7 1 7 ] [ 5 3 ] = [ 8 6 8 6 ]
[ 1 1 5 1 1 2 1 ] [ 5 3 ] = [ 8 8 8 8 ]
[ 1 3 7 9 1 9 ] [ 5 3 ] = [ 9 2 9 2 ]
[ 1 3 7 1 1 2 1 ] [ 5 3 ] = [ 9 8 9 8 ]
[ 1 3 7 1 3 2 3 ] [ 5 3 ] = [ 1 0 4 1 0 4 ]
From Holmes' last clue, even if we know the number of guests in any day, it wouldn't help us with S . At this point, if we know d = 2 3 , it will instantly lead to S = 1 0 4 , for the number stands out distinctly from the other numbers. Similarly, if we know d = 1 7 , then S = 8 6 , because the number, too, stands out uniquely. Moreover, if c = 5 , then we know S = 8 8 , and if b = 9 , then we know S = 9 2 . On the other hand, even if we know a = 1 3 , b = 1 1 , c = 7 , or d = 2 1 , that wouldn't conclude which S to be because these numbers overlap with other combinations.
As a result, we can conclude that S = 9 8 , and of course, a = 1 3 , b = 1 1 , c = 7 , or d = 2 1 .