Question

You are given a box that has a number of chocolates. You can remove 1 or 3. In how many ways box can be emptied.

Answer 1

Answer:

2

Step-by-step explanation:

the only two ways the box can get emptied is  one at a time or three at a time

Answer 2

Solution:

• let's assume there are 7 chocolates and therefore $n=7$. These can be removed in the following ways

                                     $1.(1,1,1,1,1,1,1)\\2.(1.1.1.1.3)\\3.(1,1,1,3,1)\\4.(1,1,3,1,1)\\5.(1,3,1,1,1)\\6.(3,1,1,1,1)\\7.(1,3,3)\\8.(3,1,3)\\9.(3,3,1)$

• We have to complete the function in several ways in that and also the function must be an integer that denotes the number of ways of the empty box.

• Therefore the number of ways is,

                    $n=integer$

• the constraints are,

               $1 < =n < =10^8$

• Therefore we can say that there is only 1 way to move 1 chocolate.
• it is

           $=(1$%$1000000007)$

            $=1$

∴ the answer is $1$

#SPJ3