What is a systematic method to solve this Diophantine equation?

  • Thread starter Thread starter the_Doctor111
  • Start date Start date
  • Tags Tags
    Method Systematic
Click For Summary

Homework Help Overview

The problem involves determining the number of chocolate bars and bags of chips purchased given a total expenditure of $12.30, with specific costs for each item. The equation representing the situation is 12.30 = 1.20x + 2.50y, where both x (chocolate bars) and y (bags of chips) must be positive integers.

Discussion Character

  • Exploratory, Mathematical reasoning, Assumption checking

Approaches and Questions Raised

  • Participants discuss various methods to solve the equation, including the potential use of the Euclidean algorithm and the implications of the odd number of bags of chips. There is also a suggestion to manipulate the equation for easier handling.

Discussion Status

The discussion is ongoing, with participants exploring different approaches and reasoning. Some have provided insights into manipulating the equation and the nature of the solutions, while others are questioning the assumptions and methods being considered.

Contextual Notes

Participants note that both variables must be positive integers, which adds constraints to the solutions being explored. There is also a mention of the need to avoid guesswork in finding the solution.

the_Doctor111
Messages
6
Reaction score
0

Homework Statement



Suppose you spend $12.30 on chocolate bars and chips. If chocolate bars cost $1.20 and each bag of chips cost $2.50, how many bags of chips did you buy?

*Both the number of chocolate bars and bags of chips must be positive.

Homework Equations



12.30 = 1.20x + 2.50y

The Attempt at a Solution



What is the method i go about solving this problem besides guess and check. I assume it has something to do with the euclidian algorithm since that's what I have been learning.
Cheers.
 
Physics news on Phys.org
Euclidean algorithm?
 
Well I think I got it, start with see why the chip bags have got to be an odd number and after that the chocolate bars have got to be...

Hopefully this leads to something interesting (because I can't say it starts that way :biggrin:)
 
Notice that all three numbers are "nearly" multiples of 1.2.

You can use that fact to solve the problem without guessing, or chugging through Euclid's algorithm.
 
The first thing I would do it is multiply 12.30 = 1.20x + 2.50y by 10 to get 12x+ 25y= 123.

The only "Euclidean algorithm" needed is to note that 25- 2(12)= 1. Multiplying that equation by 123, 12(-246)+ 25(123)= 123. That is, one solution is x= -246 and y= 123. That is not the solution because -246 is not positive. But x= -246+ 25k and y= 123-12k is also a solution for ay integer, k: 12(-246+ 25k)+ 25(123- 12k)= 12(-246)+ (12)(25k)+ 25(123)- 25(12k)= 123 since the two terms in k cancel.

So you want to find an integer, k, such that x= -245+ 25k> 0 and y= 123- 12k> 0.
 
Thanks heap guys! :!)
 
the_Doctor111 said:
Thanks heap guys! :!)
By the Way: Welcome to PF, Doctor111 !
 

Similar threads

  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 19 ·
Replies
19
Views
3K
  • · Replies 18 ·
Replies
18
Views
3K
Replies
2
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
1
Views
1K
Replies
1
Views
3K
  • · Replies 7 ·
Replies
7
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K