The conjecture states that:(adsbygoogle = window.adsbygoogle || []).push({});

Given a positive integer n,

If n is even then divide by 2.

If n is odd then multiply by 3 and add 1

Conjecture: by repeating these operations you will eventually reach 1.

Proof:

Let n be the smallest positive integer that is a counterexample to the conjecture.

If n is even then it can be divided by two to give a smaller number, leading to a contradiction.

Assume n = 4k + 1.

Multiply it by 3, add 1, and divide by 2 twice.

The result is 3k + 1, a number smaller than n, leading to a contradiction. Therefore n has the form

n = 4k - 1.

Multiply by 3, add 1, and divide by 2.

The result is 6k - 1. If k is odd, then 6k - 1 is one more than a multiple of 4, which is impossible, therefore k is even, and n has the form

n = 8k - 1

Multiply by 3, add 1, and divide by 2.

The result is 12k -1, with k necessarily even. In this manner it can be proved that n must have the form 16k - 1, 32k -1, 64k -1, and so on, requiring n to be infinitely large, which is impossible.

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Where's the flaw in this proof of the Collatz Conjecture?

Loading...

Similar Threads - Where's flaw proof | Date |
---|---|

B Absolute Value Inequality, |x|>|x-1|...where's my mistake? | Mar 11, 2018 |

I Find the height up a ladder where a dropped bottle will break, using only two bottles | Feb 6, 2018 |

I Where has this proof gone wrong? ∞= 1/0 | Sep 16, 2017 |

B Is the theory of fractional-ordered calculus flawed? | Feb 25, 2017 |

B Where is the bug in my math? | Jan 12, 2017 |

**Physics Forums - The Fusion of Science and Community**