The sum of the numbers from 1 to n can be defined recursively as follows: the sum from 1 to 1 is 1. the sum from 1 to n is n more than the sum from 1 to n-1. write a int -method named sum that accepts an int parameter , n, and recursively calculates and returns the sum of the numbers from 1 to n. submit

-1, -2, -3, -4, -6

step-by-step explanation:

amount of oatypop that contains the prize = 40%

amount   of oatypop which doesn't contain the prize = (100-40)=60%

probability that hannah will win a prize

    = s +f s +f f s+ff   f s+ff f f s+ infinity.where f= failure,s= success

=   or 60%

probability that hannah only has to buy 3 or less boxes before getting a prize= (s) and ( f s) and (ff s) and (f f f s)

        = = 87.04 %  

step-by-step explanation: