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,...

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...

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...

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,...

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,...

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 <...

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,...

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,...

Let, n = 6q + 5, when q is a positive integer We know that any positive integer is of the form 3k, or 3k + 1, or 3k + 2 ∴...