How many ways can we pick three distinct integers from {1, 2, ..., 15} such that their sum is divisible by 3?
1 answer:
You might be interested in
A) 4a - 3b + 2c
4(2, -1, 5) - 3(4, 3 , -2) + 2(5, 4, 0) = (8, -4, 20) - (12, 9, - 6) + (10, 8, 0) =
= (8 - 12 + 10 , -4 - 9 + 8 , 20 + 6 + 0) = (6, - 5, 26)
Answer: (6, - 5, 26)
b) magnitude of vector b
c) vector of length 7 parallel to vector c
=> m(5,4,0) = (5m,4m,0)
=>
=> m = 7 / √41 ≈ 1.093
=> 1.093 (5, 4, 0) = (5.465 , 4.372, 0)
Answer: (5.465 , 4.372 , 0)
4(2, -1, 5) - 3(4, 3 , -2) + 2(5, 4, 0) = (8, -4, 20) - (12, 9, - 6) + (10, 8, 0) =
= (8 - 12 + 10 , -4 - 9 + 8 , 20 + 6 + 0) = (6, - 5, 26)
Answer: (6, - 5, 26)
b) magnitude of vector b
c) vector of length 7 parallel to vector c
=> m(5,4,0) = (5m,4m,0)
=>
=> m = 7 / √41 ≈ 1.093
=> 1.093 (5, 4, 0) = (5.465 , 4.372, 0)
Answer: (5.465 , 4.372 , 0)