A church collected exactly $303 from its members during a service.

Option C

Max number of people = min donation
303/2= 151.5 => 151 people - 1 person gave 3 $

To determine the greatest number of members that could have attended the service while ensuring each member contributed at least $2, we need to minimize the contribution per person while respecting the constraint that each person contributes at least $2.

Given:

The total amount collected is $303.
Each member contributes at least $2.
We want to maximize the number of members, ( n ). Since each member contributes at least $2, the minimum total contribution for ( n ) members would be ( 2n ). To find the maximum number of members: [ 2n \leq 303 ]

Now, solve for ( n ): [ n \leq \frac{303}{2} = 151.5 ]

Since the number of members ( n ) must be a whole number, we round down to the nearest whole number: [ n = 151 ]

Therefore, the greatest number of members that could have attended the service, with each contributing at least $2, is 151 members.

Option C - 151

$303/$2=151.5 ~151

To find the maximum of a certain entity we have always assume that the contribution of the corresponding entity being measured is the minimum. And vice versa.

In the case of this question, 303$ has been collected and we have to find the max number of people who have contributed. The basic step is to assume that everyone has contributed the minimum which is $2. 151 people doing the same will amount to 302$. The reason we cannot add the 152nd person is because the minimum contribution is 2$ and only 1$ is remaining.

Hence we have conclude that 151 people have contributed - Option (C).