In a cathedral there are distinct images which show saints ( in a line ) sharing a total of halos over their heads (otherwise the saints are indistinguishable from each other). There are exactly saints in each image that have halos (the others do not ).
Find ?
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 these boxes with numbers represent the seven saints and the number of halos above each one.
◯ ◯ ◯ ◯ ◯ ◯ ◯
Let this string of boxes and 1’s represent the number of halos over each saint.
1 ◯ 1 ◯ 1 ◯ 1 ◯ 1 ◯ 1 ◯ 1
For 7 saints with halos ( x = 7 ) , we must choose all 6 boxes to place a + sign to form the sum
1 + 1 + 1 + 1 + 1 + 1 + 1 = 1 + 1 + 1 + 1 + 1 + 1 + 1
Thus, there is only 1 image that can be formed where all 7 saints have a halo.
For x = 6 ( 1 saint without a halo ), we must choose 5 of 6 boxes to place a + sign to form the sums of 6 saints sharing the 7 halos. This can be done in ( 5 6 ) = 6 ways:
1 ◯ 1 + 1 + 1 + 1 + 1 + 1 1 + 1 ◯ 1 + 1 + 1 + 1 + 1 1 + 1 + 1 ◯ 1 + 1 + 1 + 1 1 + 1 + 1 + 1 ◯ 1 + 1 + 1 1 + 1 + 1 + 1 + 1 ◯ 1 + 1 1 + 1 + 1 + 1 + 1 + 1 ◯ 1 = 2 + 1 + 1 + 1 + 1 + 1 = 1 + 2 + 1 + 1 + 1 + 1 = 1 + 1 + 2 + 1 + 1 + 1 = 1 + 1 + 1 + 2 + 1 + 1 = 1 + 1 + 1 + 1 + 2 + 1 = 1 + 1 + 1 + 1 + 1 + 2
In general if we want to have x saints sharing 7 halos we will have ( x − 1 6 ) ways to do this:
( x − 1 6 ) = ( x − 1 ) ! ( 7 − x ) ! 6 ! Eq1
Now, ( to start with ) distribute the halos to the saints choosing the farthest saint on the left to NOT have a halo:
◯ ◯ ◯ ◯ ◯ ◯ 2 1 1 1 1 1 1 2 1 1 1 1 1 1 2 1 1 1 1 1 1 2 1 1 1 1 1 1 2 1 1 1 1 1 1 2
Choosing the first saint to NOT have one of the halos was arbitrary. Any one of the 7 saints could be chosen for a total of ( 1 7 ) = 7 ways. In general, when we want 7 − x saints to not have a halo we will have ( 7 − x 7 ) ways to do this :
( 7 − x 7 ) = ( 7 − x ) ! x ! 7 ! Eq2
Thus, the number of images N that can made for some number x saints that have a halo is given by the product ( number of ways that x saints can share 7 halos times the number of ways to choose the ( 7 − x ) without halos out of 7 saints ):
N = ( x − 1 6 ) ⋅ ( 7 − x 7 ) = ( x − 1 ) ! ( 7 − x ) ! 6 ! ⋅ ( 7 − x ) ! x ! 7 !
For this problem we are trying to find x such that N = 7 0 0 :
7 0 0 = ( x − 1 ) ! ( 7 − x ) ! 6 ! ⋅ ( 7 − x ) ! x ! 7 ! = ( 7 − x ) ! 2 ( x − 1 ) ! x ! 6 ! 7 ! Eq3
I don’t know of any way to form analytical solutions to Eq3 , so I used guess and check:
For x = 4 we have:
( 3 ) ! 2 ( 3 ) ! 4 ! 6 ! 7 ! = 3 ! 3 ⋅ 4 ! 3 ! ⋅ 5 ⋅ 4 ⋅ 3 ! ⋅ 7 ⋅ 3 ! ⋅ 5 ⋅ 4 ! = 7 ⋅ 5 2 ⋅ 4 = 7 0 0