proof prove induction p^2+2 is divisible by 3 divides and p>3, Use the division algorithm
Added by عبدالله ا.
Step 1
Then p^2 + 2 = 3^2 + 2 = 11, which is not divisible by 3. However, the problem states that p > 3, so we need to check the next value of p. Let p = 4. Then p^2 + 2 = 4^2 + 2 = 18, which is divisible by 3. So, the base case holds for p = 4. Show more…
Show all steps
Close
Your feedback will help us improve your experience
Jerelyn Nevil and 93 other Algebra 2 educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
proof prove induction p^2+2 is divisible by 3 divides, p>3
Jerelyn N.
Use mathematical induction to prove that (n ^3 + 3n ^2 + 2n) is divisible by 3 for all n ≥ 1
Adi S.
Use mathematical induction to prove that 3^n is divisible by 2 for all integers n.
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD