Question

Show that the square of 2q+1 is infact the form 4s+1 and thus prove that every...

Show that the square of 2q+1 is infact the form 4s+1 and thus prove that every integer square leaves remainder 0 or 1 on division by 4.

Homework Answers

Answer #1

1) The square of (2q+1) is in the form of (4s+1)

Since q and q^2 will belong to set of integers, hence we can write

so we can say that

The integer will belong to two form, either the integers will be even or odd

Even integer: a = 2p, where p is an integer

Since p is an integer, hence p^2 will also be an integer

So the a^2 is divisible by 4, hence it will leave the remainder 0

Odd integer: a = 2p+1, where p is an integer

Since p is an integer, hence p^2 will also be an integer

So the a^2 4s_2 will be divisible by 4, hence it will leave the remainder 1 after division by 4

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Prove that every integer of the form 5n + 3 for n ∈ Z, n ≥...
Prove that every integer of the form 5n + 3 for n ∈ Z, n ≥ 1, cannot be a perfect square
Show 2 different solutions to the task. Prove that for every integer n (...-3, -2, -1,...
Show 2 different solutions to the task. Prove that for every integer n (...-3, -2, -1, 0, 1, 2, 3, 4...), the expression n2 + n will always be even.
Prove that every prime greater than 3 can be written in the form 6n+ 1 or...
Prove that every prime greater than 3 can be written in the form 6n+ 1 or 6n+ 5 for some positive integer n.
Prove that every prime greater than 3 can be written in the form 6n + 1...
Prove that every prime greater than 3 can be written in the form 6n + 1 or 6n + 5 for some positive integer n.
Show/Prove that every invertible square (2x2) matrix is a product of at most four elementary matrices
Show/Prove that every invertible square (2x2) matrix is a product of at most four elementary matrices
A stochastic matrix is a square matrix A with entries 0≤a_ij≤1 such that the sum of...
A stochastic matrix is a square matrix A with entries 0≤a_ij≤1 such that the sum of each column of A is 1. Prove that if A is stochastic, then A^k is stochastic for every positive integer k.
Prove that a positive integer n, n > 1, is a perfect square if and only...
Prove that a positive integer n, n > 1, is a perfect square if and only if when we write n = P1e1P2e2... Prer with each Pi prime and p1 < ... < pr, every exponent ei is even. (Hint: use the Fundamental Theorem of Arithmetic!)
Let n be an integer. Prove that if n is a perfect square (see below for...
Let n be an integer. Prove that if n is a perfect square (see below for the definition) then n + 2 is not a perfect square. (Use contradiction) Definition : An integer n is a perfect square if there is an integer b such that a = b 2 . Example of perfect squares are : 1 = (1)2 , 4 = 22 , 9 = 32 , 16, · · Use Contradiction proof method
Prove the following statement by mathematical induction. For every integer n ≥ 0, 2n <(n +...
Prove the following statement by mathematical induction. For every integer n ≥ 0, 2n <(n + 2)! Proof (by mathematical induction): Let P(n) be the inequality 2n < (n + 2)!. We will show that P(n) is true for every integer n ≥ 0. Show that P(0) is true: Before simplifying, the left-hand side of P(0) is _______ and the right-hand side is ______ . The fact that the statement is true can be deduced from that fact that 20...
4. Prove that if p is a prime number greater than 3, then p is of...
4. Prove that if p is a prime number greater than 3, then p is of the form 3k + 1 or 3k + 2. 5. Prove that if p is a prime number, then n √p is irrational for every integer n ≥ 2. 6. Prove or disprove that 3 is the only prime number of the form n2 −1. 7. Prove that if a is a positive integer of the form 3n+2, then at least one prime divisor...