Answer:
50
Step-by-step explanation:
If the first statement its true (At most 0 of the statements are true), there are not true statements in the paper. So, the first statement its false.
Now, if the first statement its false, this mean there must be at least 1  true statement in the paper.
Now, if the second statement its true ( at most 1 of the statements are true) this implies that the third statement its true (if "at most 1" its true, then "as most 2" must be true). 
If any statement (besides the first) its true, then all the statement that follows it must be true.
The first non false statement, then, must be the statement made by the person 51:  "At most 50 statements are true"
And the 49 statements that follows are true as well.
 
        
             
        
        
        
12!!!! Hope this helped and good encouragement
        
             
        
        
        
<h2>
Answer with explanation:</h2>
We are asked to prove by the method of mathematical induction that:

where n is a positive integer.
then we have:

Hence, the result is true for n=1.
- Let us assume that the result is true for n=k
i.e.

- Now, we have to prove the result for n=k+1
i.e.
<u>To prove:</u>  
Let us take n=k+1
Hence, we have:

( Since, the result was true for n=k )
Hence, we have:

Also, we know that:

(
Since, for n=k+1 being a positive integer we have:
 )
  )
Hence, we have finally,

Hence, the result holds true for n=k+1
Hence, we may infer that the result is true for all n belonging to positive integer.
i.e.
 where n is a positive integer.
  where n is a positive integer.
 
        
        
        
A because everything after the verb is a preposition