Can Integer Solutions to 12m + 15n = 1 Be Positive?

  • Thread starter Thread starter physicsgirlie26
  • Start date Start date
  • Tags Tags
    Proof
Click For Summary
SUMMARY

The discussion centers on the equation 12m + 15n = 1, specifically addressing the impossibility of finding integer solutions for m and n. Participants confirm that since both terms are multiples of 3, the sum can never equal 1, as it will always yield multiples of 3. Furthermore, they clarify that if integers m and n were to exist such that 12m + 15n = 1, then both must be negative, although this scenario is impossible due to the greatest common divisor (gcd) of 12 and 15 being 3, not 1.

PREREQUISITES
  • Understanding of linear Diophantine equations
  • Knowledge of greatest common divisor (gcd) concepts
  • Familiarity with modular arithmetic
  • Basic proof techniques in mathematics
NEXT STEPS
  • Study linear Diophantine equations and their solutions
  • Learn about the properties of gcd and its implications in number theory
  • Explore modular arithmetic and its applications in proofs
  • Review proof techniques, particularly implications and contrapositive statements
USEFUL FOR

Mathematics students, educators, and anyone interested in number theory or proof techniques will benefit from this discussion.

physicsgirlie26
Messages
42
Reaction score
0
Prove that:

d) there do not exsist integers m abd n such that 12m+15n=1

f) if there exist integers m and n such that 12m+15n=1, then m and n are both positive.

so far for d i have

d) since 12m is always a multiple of 3
and since 15n is always a multiple of 3, then
adding or subtracting two multiples of 3 always yields another multiple of 3, and so
12m + 15n can never equal 1 (it can only equal multiples of 3.)

but I have no idea how to do f. In the back of the book it has a hint that says, "See the statement of part (d). Can you prove that m and n are both negative whenever the antecedent is true?" I don't understand it. Can you please help me?

Thanks for the help!
 
Physics news on Phys.org
d) for any integers x and y, there exists integer m and n such that xm + yn =1 if and only if gcd(x,y) = 1. Does gcd(12,15)=1?
 
no the gcd(12, 15)=3.
 
I don't see what the question is getting at either. If you write it as P->Q, then you've shown there are no integers m and n that satisfy the antecedent. So formally the implication is true, but you could equally well claim if m and n satisfy 12m+15n=1 then m and n are bananas.
 
I really don't understand it either and it is killing me. -.- I have a headache because I'm trying to figure it out and I can't. haha Does anyone have any other suggestions on how to go about this proof?
 
That's all the question is trying to get at... in a statement P->Q, if the P part is false, the entire statement is true by default. This is chapter 1, don't over think it too much. Just like Dick said "If there exist integers m and n such that 12m+15n=1, then m and n are bananas" is also a very true statement. The author is just trying to get a very simple concept across, in a fairly convoluted way.
 
But how would you prove that that m and n are both negative whenever the antecedent is true?
 
The thing is... the antecedent isn't true. So if you were asked to prove that "If there exists integers m and n such that 12m+15n=1 then m and n are negative" all you'd do is prove that the antecedent is false and say "by default this statement is true."...
 
Ok. Thanks for all of your help! :0)
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 13 ·
Replies
13
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 12 ·
Replies
12
Views
1K
Replies
9
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
2
Views
1K
Replies
9
Views
3K