When a^2 is divided by 6,which of the followi | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(B) Any natural number $a$ can be expressed in the form $6k, 6k+1, 6k+2, 6k+3, 6k+4,$ or $6k+5$. Calculating $a^2 \pmod{6}$ for each case: $1) (6k)^2

Vedclass · Accepted Answer

$2$

Vedclass · Answer

(B) Any natural number $a$ can be expressed in the form $6k, 6k+1, 6k+2, 6k+3, 6k+4,$ or $6k+5$. Calculating $a^2 \pmod{6}$ for each case: $1) (6k)^2 = 36k^2 = 6(6k^2) \equiv 0 \pmod{6}$ $2) (6k+1)^2 = 36k^2 + 12k + 1 = 6(6k^2 + 2k) + 1 \equiv 1 \pmod{6}$ $3) (6k+2)^2 = 36k^2 + 24k + 4 = 6(6k^2 + 4k) + 4 \equiv 4 \pmod{6}$ $4) (6k+3)^2 = 36k^2 + 36k + 9 = 6(6k^2 + 6k + 1) + 3 \equiv 3 \pmod{6}$ $5) (6k+4)^2 = 36k^2 + 48k + 16 = 6(6k^2 + 8k + 2) + 4 \equiv 4 \pmod{6}$ $6) (6k+5)^2 = 36k^2 + 60k + 25 = 6(6k^2 + 10k + 4) + 1 \equiv 1 \pmod{6}$ The possible remainders are $0, 1, 3, 4$. Thus,the remainders $2$ and $5$ are not possible.

When $a^2$ is divided by $6$,which of the following cannot be the remainder? $(a \in N)$

Similar Questions

For any positive integer $n$,prove that $n^{3}-n$ is divisible by $6$.

Find the $g.c.d.$ (Greatest Common Divisor) of $81$ and $237$ using Euclid's division algorithm.

Express the number $7429$ as a product of its prime factors.

Prove that one and only one out of $n, n+2$ and $n+4$ is divisible by $3,$ where $n$ is any positive integer.

The decimal expansion of the rational number $\frac{14587}{1250}$ will terminate after

Vedclass Test Series

Exam Paper Generator

Online Exam Module