Chapter 4, Problem 13C

Explanation of Solution

Preconditions:

• Considering the given scenario that Bob develops a Web site and shared the URL only to his “n” friends which is numbered from 1 to “n”.
• Bob insisted that the friend number “i” can visit the web site for at most “i” times and it is tracked by the counter “C”.
• Thus, to determine the minimum number of visits that the Bob’s friend has made during the maximum number of times.

Minimum number of visits:

Total number of friends who keeps visiting the website is given as follows:

  $\text{Total number of visits}=\text{1 + 2 + 3 + 4 + … + i + }\left(\text{i + 1}\right)\text{ + … n = }\text{n}\left(\text{n + 1}\right)/2$