Posted by please..anyone help!! on Monday, March 18, 2013 at 3:11am.
A1_n= 2+(n-1)*7=7n-5
A2_k= 3+(k-1)*9=9k-6
Put A1_n=A2_k => so 9k-7n=1 and solve the Diophantine equation for n,k u can see that gcd(9,7)=1 so the solutions you want come from applying the euclidean algorithm and your numbers n,k must be less than or equal to 1000.
Calculating GCD(9,7) gives:
7 = 0*9 + 7
9 = 1*7 + 2
7 = 3*2 + 1
2 = 2*1 + 0
Then applying the Extended Euclidean Algorithm:
1 = (1 * 7) + (-3 * 2)
= (-3 * 9) + (4 * 7)
= (4 * 7) + (-3 * 9)
A particular solution is:
x0 = -3
y0 = 4
The complete solution is:
x = -3 + 7n
y = 4 - 9n
Related Questions
Math - How do you do this problem because i feel like i did it wrong (3&...
Sequences - A = {a1, a1 + d1, a1 + 2d1,
}, B = {a2, a2 + d2, a2 +2d2, ...
Discrete Mathematics - Suppose a0, a1, a2 ,... is a sequence defined recursively...
Math - (3ã2 + 4)^2 (3ã2 + 4)(3ã2 + 4) 9...
algebra - 1)Find the 20th term of the arithmetic sequence in which a1=3 and d=7 ...
Calc Help - demand = (p+1)sqroot(q+1)=1000. Find elasticity of demand at a price...
math - Show that the formula for a line through two points (a1,b1) and (a2,b2) ...
arithmetic - If a1,a2,a3 represents first, second, third terms in A.P. if the ...
arithmetic - Alan and Bob are playing with numbers. Starting with the number n=1...
Physics - 1. Question: Consider two planets with uniform mass distributions. The...
For Further Reading