wiz-icon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

If x1=aibici,i=1,2,3 are three-digit positive integers such that each x1 is a multiple of 19, then for some integer n, prove that ∣ ∣a1a2a3b1b2b3c1c2c3∣ ∣ is divisible by 19.

Open in App
Solution

we can write a three digit number as abc=a×102+b×10+c
∣ ∣a1a2a3b1b2b3c1c2c3∣ ∣
just multiply 102 in the first row and 10 in the second row and add 3 rows which results the first row into
∣ ∣a1b1c1a2b2c2a3b3c3b1b2b3c1c2c3∣ ∣
which makes the first row three elements as multiples of 19.
hence proved.

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Elementary Transformation of Matrices
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon