For this question assume the following for integers, which is the analog of "every integer is odd or even" but using 3 instead of 2 as a factor. We have not proven this assumption, but you may, and will need to, use it. The assumption is: Every integer \(n\) can be written in exactly one of the following 3 ways:
- Type A
- In the form \(3k\) where \(k\) is some integer.
- Type B
- In the form \(3k+1\) where \(k\) is some integer.
- Type C
- In the form \(3k+2\) where \(k\) is some integer.
Answer the following questions:
- Show that if \(n\) is of type C, then \(2n\) is of type B.
- Show that if \(m\) is of type A and \(n\) is any integer, then \(mn\) is also of type A.
- Show that if \(n\) is an integer, then \(n^2\) cannot be of type C.
- Show that for any integer \(n\), the product \((2n+1)(n+1)n\) is of type A.