Home › CBSE Class 11 (Commerce) › Mathematics › Mathematical Induction › Predecessor induction is an n-step loop; prefix …
Predecessor induction is an n-step loop; prefix induction matches what?
AAn n-squared loop
BA one-step loop
CA 2n-step loop
DA log-n-step loop
Answer & Solution
Correct answer: D. A log-n-step loop
Halving the number each step means only about log n applications are needed to reach P(n).
Related questions
Which pair of tools finishes the step for |sin nx| <= n|sin x|?The flawed horse argument claims that all horses are what?If natural numbers are taken to begin at 1, the base case uses which value?In Peano's axioms, the successor of a natural number x is which?A claim is to be proved for all n >= 3. What is the base case?The step from P(k) to P(k + 1) is proved, but P(1) is false. What follows?Moving a sum 1 + 2 + ... + n from k terms to k + 1 terms, which term joins?Sum the triple products 1x2x3, 2x3x4, and so on up to 6x7x8.