To prove: If n is positive integer, then
Explanation of Solution
Proof:
Use mathematical induction on n.
Let
Base case:
To prove that the statement is true for
Clearly, it is divisible by 6.
Therefore, the statement is true for
Induction hypothesis:
Assume that the claim is true for
That is,
Thus
Inductive step:
To prove that the statement is true for
Thus, the statement is true for
Therefore, by mathematical induction, the statement
Hence the required result is obtained.
Chapter 1 Solutions
Single Variable Calculus: Concepts and Contexts, Enhanced Edition
- Calculus: Early TranscendentalsCalculusISBN:9781285741550Author:James StewartPublisher:Cengage LearningThomas' Calculus (14th Edition)CalculusISBN:9780134438986Author:Joel R. Hass, Christopher E. Heil, Maurice D. WeirPublisher:PEARSONCalculus: Early Transcendentals (3rd Edition)CalculusISBN:9780134763644Author:William L. Briggs, Lyle Cochran, Bernard Gillett, Eric SchulzPublisher:PEARSON
- Calculus: Early TranscendentalsCalculusISBN:9781319050740Author:Jon Rogawski, Colin Adams, Robert FranzosaPublisher:W. H. FreemanCalculus: Early Transcendental FunctionsCalculusISBN:9781337552516Author:Ron Larson, Bruce H. EdwardsPublisher:Cengage Learning