# Linear Combinations, Division and the Euclidean Algorithm

Assume that d=sa+tb is a linear combination of integers a and b. Find infinitely many pairs of integers ( s sub k, t sub k ) with d=s sub k a + t sub k b

Hint: If 2s +3t =1, then 2 (s+3) + 3 (t-2) = 1

I would like a very detailed, as possible, explanation on how to work this problem if you please.

© BrainMass Inc. brainmass.com October 9, 2019, 6:41 pm ad1c9bdddfhttps://brainmass.com/math/discrete-math/linear-combinations-division-euclidean-algorithm-95001

#### Solution Preview

The pair of integers can be represented as (k1, k2), such that (s-k1)a + ...

#### Solution Summary

Linear Combinations, Division and the Euclidean Algorithm are investigated.

$2.19