Skip to content
Philoid
Browse Saved
Back to chapter
Maths
1. Euclids Algorithm and Real Numbers
Home · Class 10 · Maths · Ref. Book · 1. Euclids Algorithm and Real Numbers
Prev
Next
Q3 of 128 Page 4

Prove that if either of 2a + 3b and 9a + 5b is divisible by 17, so is the other. a, b E N (Hint: 4(2a + 3b) + 9a + 5b = 17a + 17b)

Let 2a + 3b be divisible by 17.

Therefore, for some integer k, 2a + 3b = 17k….. eq (1)


Now,


9a + 5b = 17a + 17b – 4(2a + 3b)


= 17(a + b) – 4(17k) (from eq (1))


= 17(a + b – 4k)


Therefore, we can say that 9a + 5b is divisible by 17.


More from this chapter

All 128 →
1

Prove that 16 divides n4 + 4n2 + 11, if n is an odd integer.

2

Prove that if n is a positive even integer, then 24 divides n(n + 1)(n + 2).

4

Prove that every natural number can be written in the form 5k or 5k ± 1 or 5k ± 2, k E N V {0}.

5

Prove that if 6 has no common factor with n, n2 — 1 is divisible by 6.

Questions · 128
1. Euclids Algorithm and Real Numbers
1 2 3 4 5 6 1 1 1 2 3 4 1 1 1 1 2 2 2 2 3 3 3 4 4 4 4 4 5 6 7 8 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 2 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43
Back to chapter
ADVERTISEMENT
About Contact Privacy Terms
Philoid · 2026
  • Home
  • Search
  • Browse
  • Quiz
  • Saved