When using the general divisibility test, we want to make sure we can have relatively prime factors. Find counterexample
Posted: Mon Jul 11, 2022 12:50 pm
When using the general divisibility test, we want to make sure we can have relatively prime factors. Find counterexamples for these plausible-looking but unreliable divisibility tests. 1. If 2 is a factor of n and 6 is a factor of n, 12 is a factor of n. 2. If 3 is a factor of n and 6 is a factor of n, 18 is a factor of n. 3. If 7 is a factor of n, then 14 is a factor of n.