Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A gardener spends exactly units on plants: shrubs at units each and herbs at units each, buying at least one of each. Find a solution of by the Euclidean algorithm, write the general solution, and use it to find every solution with and positive. Give the number of such solutions and the smallest possible number of shrubs.
has integer solutions exactly when . From one solution , all are
For coprime the largest that is not with is .
Check an answer or open a hint to unlock the worked solution.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Given. with .
Step 1. Bezout. Working back: .
Step 2. One solution. Multiply by : .
Step 3. All solutions. , .
Step 4. Positive. needs , so . needs , so .
Step 5. List. give , , .
Check. .
Answer: positive solutions, with at least shrubs.
Log in to join the discussion.
Loading…