Recent content by and1bball4mk

  1. A

    Prove Number Theory Proofs: Sum Irrational, (m+dk) mod d, x^2=x, n^2 mod 3

    Actually I might of made some headway on number 4. If x^2=x then x=x/x. So x/x will always reduce to 1 unless x=0. Is this sufficient for a proof?
  2. A

    Prove Number Theory Proofs: Sum Irrational, (m+dk) mod d, x^2=x, n^2 mod 3

    1. For any positive integer n, if 7n+4 is even, then n is even. 2.Sum of any two positive irrational numbers is irrational. 3. If m, d, and k are nonnegative integers with d=/=0 then (m+dk) mod d = m mod 4. For all real x, if x^2=x and x=/=1 then x=0 5. If n is an integer not divisible by 3...