5. What is the second step in proving by mathematical induction that for every positive integer n, 11" - 6 is divisible by
5, is true?
Let n = k. Then assume that 11" - 6 is divisible by 5.
Let n = 1. Then assume that 111 - 6 is divisible by 5.
Let n = k. Then assume that 11k+1 – 6 is divisible by 5.
O Let n = (k + 1). Then assume that 11k - 6 is divisible by 5.

NEED THIS ASAP
NEED A EXAM DONE WILL PAY

5 What is the second step in proving by mathematical induction that for every positive integer n 11 6 is divisible by 5 is true Let n k Then assume that 11 6 is class=

Respuesta :

Answer:

The correct answer is A:Let n = k. Then assume that 11" - 6 is divisible by 5. sorry if im wrong but if correct pls mark brainliest

DWRead

Answer:

Step-by-step explanation:

Premise:  If n is a positive integer, then 11ⁿ-6 is divisible by 5.

Let n=1.

11¹-6 = 5, so the premise is true for n=1.

Suppose the premise is true when n is an integer greater than 1,

then 11ⁿ-6 is divisible by 5.

11ⁿ⁺¹-6 = 11·11ⁿ - 6

   = (10+1)11ⁿ - 6

   = (10·11ⁿ) + (1·11ⁿ) - 6

   = (10·11ⁿ) + (11ⁿ - 6)

Both terms are divisible by 5, so 11ⁿ⁺¹-6 is divisible by 5. Therefore, the premise holds true for n+1.

Proof by induction.

ACCESS MORE
ACCESS MORE
ACCESS MORE
ACCESS MORE