Show that the square of any odd integer is of the form 4q + 1, for some integer q.

Monjur Alahi

Show that the square of any odd integer is of the form 4q + 1, for some integer q.


0 like 0 dislike
1 views
Share with your friends

2 Answers

Salim Ahmed Kawsar

Call

Solution:
Let a be any odd integer and b = 4.
Then, by Euclid’s algorithm, a = 4m + r for some integer m ≥ 0 and r = 0,1,2,3 because 0 ≤ r < 4.
So, a = 4m or 4m + 1 or 4m + 2 or 4m + 3
So, a = 4m + 1 or 4m + 3
Here, a cannot be 4m or 4m + 2, as they are divisible by 2.
=> (4m + 1)2 = 16m2 + 8m + 1
= 4(4m2 + 2m) + 1
= 4q + 1, where q is some integer.
(4m + 3)2 = 16m2 + 24m + 9
= 4(4m2 + 6m + 2) + 1
= 4q + 1, where q is some integer.
Hence, The square of any odd integer is of the form 4q + 1, for some integer q.

0 like 0 dislike
1 views
Talk Doctor Online in Bissoy App
Salim Ahmed Kawsar

Call

Let a be any odd integer and b = 4.

According to Euclid’s algorithm,

a = 4m + r for some integer m ≥ 0

And r = 0,1,2,3 because 0 ≤ r < 4.

So, we have that,

a = 4m or 4m + 1 or 4m + 2 or 4m + 3 So, a = 4m + 1 or 4m + 3

We know that, a cannot be 4m or 4m + 2, as they are divisible by 2.

(4m + 1)2 = 16m2 + 8m + 1

= 4(4m2 + 2m) + 1

= 4q + 1, where q is some integer and q = 4m2 + 2m.

(4m + 3)2 = 16m2 + 24m + 9

= 4(4m2 + 6m + 2) + 1

= 4q + 1, where q is some integer and q = 4m2 + 6m + 2

Therefore, Square of any odd integer is of the form 4q + 1, for some integer q.

Hence Proved.

0 like 0 dislike
1 views
Talk Doctor Online in Bissoy App
Show that any positive odd integer is of the form 6q+1,6q+3 & 6q+5 where q is some integer.

Solution: Let a be any positive integer and b = 6. Then, by Euclid’s algorithm, a = 6q + r for some integer q ≥ 0, and r = 0, 1, 2, 3,...

1 Answers 1 views
Show that any positive odd integer is of the form 6q + 1, or 6q + 3, or 6q + 5, where q is some integer.

Solution: Let a be any positive integer and b = 6. Then, by Euclid’s algorithm, a = 6q + r for some integer q ≥ 0 and r = 0,1,2,3,4,5 because 0 ≤ r ≤ 6. So, a...

1 Answers 1 views
Show that cube of any positive integer is of the form 4m, 4m + 1 or 4m + 3, for some integer m.

How to assume value of “b”? Here it is assumed as a=4q+0,1,2,3. But in some similar problems value of b is taken as 3. So what is the criteria to assume...

1 Answers 1 views
Show that cube of any positive integer is of the form 4m, 4m + 1 or 4m + 3, for some integer m. 1 Answers 1 views
Show that the square of any positive integer cannot be of the form 5q + 2 or 5q + 3 for any integer q.

Solution: Let a be the positive integer and b = 5. Then, by Euclid’s algorithm, a = 5m + r for some integer m ≥ 0 and r = 0, 1, 2,...

1 Answers 1 views
Show that the square of any positive integer cannot be of the form 6m + 2 or 6m + 5 for any integer m.

Solution: Let a be the positive integer and b = 6. Then, by Euclid’s algorithm, a = 6q + r for some integer q ≥ 0 and r = 0, 1, 2,...

1 Answers 1 views
Show that the cube of a positive integer of the form 6q + r, q is an integer and r = 0, 1, 2, 3, 4, 5 is also of the form 6m+r.

Solution: 6q + r is a positive integer, where q is an integer and r = 0, 1, 2, 3, 4, 5 Then, the positive integers are of the form 6q, 6q+1,...

1 Answers 1 views
For some integer q, every odd integer is of the form

Correct answer is (D) 2q + 1

1 Answers 1 views
Show that the square of an odd positive integer is of the form 8q + 1, for some integer q.

By Euclid’s division algorithm a = bq + r, where 0 ≤ r ≤ b Put b = 4 a = 4q + r, where 0 ≤ r ≤ 4 If r = 0,...

1 Answers 1 views
Show that any positive odd integer is of the form 6q + 1 or 6q + 3 or 6q + 5, where q is some integer

Let a be any positive odd integer and b = 6. Then, by Euclid’s algorithm, a = 6q + r, for some integer q ≥ 0 and 0 ≤ r...

1 Answers 1 views
X