Posted inAbstract Algebra Advanced Math Mathematics Multivariable Calculus Number Theory Let n be an integer and not divisible by 3 then n^2 = 3k + 1 for some integer k. Posted by By SK Math Expert October 10, 2021Posted inAbstract Algebra, Advanced Math, Mathematics, Multivariable Calculus, Number Theory Question.: Let n be an integer and not divisible by 3 then n^2 = 3k + 1 for some integer k. Proof: If n is be an integer then n is not divisible by 3 if either n = 3k… This Question has been answered. Please Login or Register to See The Answer Post navigation Previous Post Prove that square root of 2 is irrationalNext PostProve that 1 + 2 + · · · + n = n(n + 1)/2 for all integers n ≥ 1.
