Combinatorics and Mathematical Induction

Gap-fill exercise

  
Fill in all the gaps, then press "Check" to check your answers. Use the "Hint" button to get a free letter if an answer is giving you trouble. You can also click on the "[?]" button to get a clue. Note that you will lose points if you ask for hints or clues!
of a natural number n is the product of the first n natural numbers.

In terms of function on any finite set say S = {x1, x2, ...xn}, a can be defined as a bijective mapping on the set S onto itself. T

In mathematics, we use a form of complete induction called .

The principle of mathematical induction is one such tool which can be used to prove a wide variety of .

Order matters for a permutation where as order does not matter for a .

P(n) is true for all numbers n.

The assumption that the given statement is true for n = k in the inductive step is called the .

is a technique of proving a statement, theorem or formula which is thought to be true, for each and every natural number.

P(n):2.7ⁿ+3.5ⁿ−5, ∀n∈N is divisible by .

For every natural number n, n(n²−1)is divisible by .

10²ⁿ⁻¹ + 1 is divisible by .

If n∈N,then 7²ⁿ+2³ⁿ⁻³.3ⁿ⁻¹ is always divisible by .

When 2³⁰¹ is divided by 5, the least positive remainder is .

For all n∈N,41ⁿ−14ⁿ is a multiple of .