Question

There are two types of products type A and type B
to be packed. There can be the utmost 'N' number
of products in the box. The task is to find the
number of ways the products can be packed such
that no two products of type A are packed next to
each other.

Answer 1

Answer:

jsgsjsb nskshsbskkakavx sk

Answer 2

Correct option is

C : $2^{n}$  −2

Each object can be put in 2 ways (Box 1 or Box 2).

Explanation:

The number of ways in which an object can be put in=2×2×2×...2 (n times) =$2^{n}$  

Two of these choices correspond to either first or the second box being empty.

(i.e., Box 1=0, Box 2=n and Box 1=n, Box 2=0)

∴ Required number of ways $2^{n}$ −2.