You are starting a direct-sale network with inviting friends as your first members, who will each find new members on their own. However, in order to be honored as new duo members, they must be invited and enrolled by the same person on top. In other words, the top member may not simply invite one person into the group; two newcomers are required for such membership.
For example, as shown in the above left, you (red), as the apex founder, have (blue) members as the chain is complete. On the other hand, in the above right, you only have members as one of your members "drops off" or fails to find new members, as previously stated.
After some time, if you have members under your chain network, what is the least possible number of people who "drop off", according to this rule?
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.
With the chain network, the number of members will be in terms 2 n − 1 + 2 n − 2 + ⋯ + 4 + 2 = 2 n − 2 , where n is a positive integer for number of generations. In other words, with the whole network, there are theoretically 2 n − 1 including the (red) founder, but if we exclude the founder and count only the (blue) members, there will be 2 n − 2 .
Now by having someone to "drop off", the network will lose the amount of people in terms of 2 m − 2 as any member can be considered as the "founder" for a smaller pyramid chain as well.
Hence, if 4 2 members are present, the ideal whole chain should involve 2 6 − 2 = 6 2 members, so 2 0 members are missing.
Then since 2 0 = 1 4 + 6 = ( 2 4 − 2 ) + ( 2 3 − 2 ) , the least number of drops off happen at 2 members, one at the third generation and another at the fourth.
Note that 2 0 can not be written in terms of 2 m − 2 . Thus, only one drop off can not lead to this scenario.
Therefore, the least number of drops off = 2 .