assig5

# assig5 - (a Show that there is no solution to the pair of...

This preview shows page 1. Sign up to view the full content.

MATH 135 Algebra, Assignment 5 Not to be handed in 1: Solve each of the following linear diophantine equations. (a) 42 x + 30 y = 24 (b) 231 x + 792 y = 513 (c) 385 x - 1183 y = 294 2: (a) Find all non-negative solutions to the diophantine equation 483 x + 336 y = 9513. (b) Find all pairs of integers ( x,y ) with x 1000, y 1000 such that 726 x - 1578 y = 324. 3: (a) What combinations of 18- and 33-cent stamps can be used to mail a package which requires postage of 6 dollars. (b) A shopper spends \$19.81 to buy some apples which cost 35 cents each and some oranges which cost 56 cents each. What is the minimum number of pieces of fruit that the shopper could have bought. 4: We can solve a pair of linear diophantine equations in three variables by ﬁrst eliminating one of the variables and solving the resulting equation in the remaining two variables.
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: (a) Show that there is no solution to the pair of diophantine equations 2 x + 7 y + z = 45 3 x + 8 y + 4 z = 21 . (b) Find all solutions to the pair of diophantine equations 20 x + 12 y + 15 z = 85 18 x + 20 y + 8 z = 110 . 5: Let a , b and c be non-zero integers. The greatest common divisor d = gcd( a,b,c ) is deﬁned to be the largest positive integer d such that d ± ± a , d ± ± b and d ± ± c . (a) Show that gcd( a,b,c ) = gcd ( gcd( a,b ) ,c ) . (b) Show that for any integer e , the linear diophantine ax + by + cz = e has a solution if and only if gcd( a,b,c ) ± ± e . (c) Find all solutions to the linear diophantine equation 42 x + 70 y + 105 z = 63....
View Full Document

## This note was uploaded on 07/25/2011 for the course MATH 135 taught by Professor Andrewchilds during the Spring '08 term at Waterloo.

Ask a homework question - tutors are online