Question: Prove by smallest counter example that the following statement P(n) is true. 11n6 is divisible by 5 for every positive integer n. You need to

 Prove by smallest counter example that the following statement P(n) is

Prove by smallest counter example that the following statement P(n) is true. 11n6 is divisible by 5 for every positive integer n. You need to include the following steps: 1. Express P(n) as an universal statement using symbols. 2. Express the opposite assumption as an existential statement. 3. Check if P(n) holds for the lower bound of the universe. 4. If P(n) holds for the lower bound of the universe, based upon bullet 2, there must be some values that make P false and we can pick the smallest counter value m. What will be the value range ' R ' in the universe that we know for sure will make P(n) hold? What is the largest value in this range? 5. Prove that when the largest value in the range R makes P true, then the next value after this value also makes P true. This next value is actually the smalest counter example m that you pick. Therefore, we have both P(m) and P(m), which is a contradiction. Therefore, the original assumption in bullet 2 is false and the original statement should be true

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!