|
||
Title: Divisible by 12 Post by NickH on Jan 7th, 2003, 5:32am Let a and b be integers such that a + b + ab is divisible by 12. What is the most we can deduce about a and b? |
||
Title: Re: Divisible by 12 Post by towr on Jan 7th, 2003, 8:31am I don't know what the most is.. But at least a, and b are integer (trivial deduction) a-b is divisible by 12 a (and likewise b) is either 6*i, or 6*i -2 for some integer i |
||
Title: Re: Divisible by 12 Post by Cyrus on Jan 7th, 2003, 9:34am I also don't know what the MOST is, but I've come up with a few constraints: 1) a & b must be integers and must be even 2) a + b must be a multiple of 4 3) a - b must be either 0 or a multiple of 12 4) ab must be a multiple of 4 This is another problem though, where I used my usual approach: 1) I came up with a few (5) possible solutions. 2) I then made some assumptions/constraints based on those solutions. 3) I tested my constraints by trying other numbers to see if I could find a pair of numbers that proved my constraints wrong. The problem with my approach, is clear even to me. How can I be SURE this is the OPTIMAL/maximum amount of constraints? And unless I tested infinite numbers through my constraints how can I be sure that my constraints are even correct at all?? |
||
Title: Re: Divisible by 12 Post by Cyrus on Jan 7th, 2003, 9:38am on 01/07/03 at 08:31:33, towr wrote:
Oh, I just now read your post towr, and I like that 2nd point "a must be either 6x or 6x-2", so that should be added to my list. See I missed one already. |
||
Title: Re: Divisible by 12 Post by towr on Jan 7th, 2003, 10:14am it's easy enough to prove a and b are even, and thus a*b is a multiple of 4.. After that I don't know.. a+b+ab=12N for some integer a,b,N (a+1)(b+1)-1=12N (a+1)(b+1)=12N-1 , 12N-1 is always odd, so a+1 and b+1 are odd, so a and b have to be even.. |
||
Title: Re: Divisible by 12 Post by towr on Jan 7th, 2003, 10:23am here are some example solutions to work with:
|
||
Title: Re: Divisible by 12 Post by NickH on Jan 8th, 2003, 5:29am towr, I got your original result, namely that a and b are either both divisible by 6, or both leave a remainder of 4 when divided by 6. As you indicated, write a + b + ab = (a + 1)(b + 1) - 1. Then (a + 1)(b + 1) = 1 (modulo 12.) Hence a + 1 and b + 1 are coprime with 12. Considering the multiplication table, mod. 12, the following are the only possibilities for a + 1 and b + 1: a + 1 = 1 => b + 1 = 1 a + 1 = 5 => b + 1 = 5 a + 1 = 7 => b + 1 = 7 a + 1 = 11 => b + 1 = 11 Therefore a = b = 0, 4, 6, or 10 (mod 12.) Equivalently, a = b = 0 or 4 (mod. 6.) Nick |
||
Powered by YaBB 1 Gold - SP 1.4! Forum software copyright © 2000-2004 Yet another Bulletin Board |