The Brilliant Followers

Let there be 100 100 brilliant members labelled a 1 , a 2 , a 3 , a 4 , a 5 , , a 99 , a 100 a_1, a_2, a_3, a_4, a_5,\ldots, a_{99}, a_{100} In this group of brilliant members, a 2 a_2 follows a 1 a_1 , a 3 a_3 follows a 2 a_2 , \ldots a n a_n follows a n 1 a_{n-1} , till a 100 a_{100} follows a 99 a_{99} . Other than this group of members, these members have other followers, denoted by F F who themselves have no followers. Now, a n a_n has n n followers. Thus, for a 1 a_1 , the only follower is a 2 a_2 , while for a 2 a_2 , he has two followers: a 3 a_3 and 1 F 1 F . This pattern continues till a 100 a_{100} .

Now, say a 1 a_1 makes a post, the total number of possible reshares which can be done by a 2 , a 3 , a 4 , a 99 , a 100 a_2, a_3, a_4,\ldots a_{99}, a_{100} and the F F s is given by x x . All of the F F s will definitely reshare a post made or reshared by the person(s) they follow, and all a 2 n + 1 a_{2n+1} , with n N n\in\mathbb{N} , will do the same thing. However, for all a 2 n a_{2n} , with n N n\in\mathbb{N} , the probability that they will reshare something posted by someone they follow is 1 2 \frac12 . The probability that the number of reshares is x 2 \geq\frac{x}{2} is given by 1 a \frac{1}{a} . Find the last digit of a a


The answer is 8.

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.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...