SOLUTION: determine the smallest number which when divided by7,9and 11 leaves remainder 1,2and3 respectively with comlete process.

Algebra ->  Exponents -> SOLUTION: determine the smallest number which when divided by7,9and 11 leaves remainder 1,2and3 respectively with comlete process.      Log On


   



Question 743388: determine the smallest number which when divided by7,9and 11 leaves remainder 1,2and3 respectively with comlete process.
Answer by KMST(5328) About Me  (Show Source):
You can put this solution on YOUR website!
n= the number we are looking for

n divided by 7 leaves a remainder of 1 can be written as
n=7k%2B1 <--> n-1=7k for some integer k
In words, we would say n-1 is a multiple of 7 (or is divisible by 7).
If a larger number also leaves a remainder of 1 when divided by 7, then those numbers will differ by multiples of 7.

n divided by 9 leaves a remainder of 2, and
n divided by 11 leaves a remainder of 3 can be interpreted similarly

Since 7, 9, and 11 are relatively prime (no common factors), if a number is divisible by 7, 9, and 11, it must be divisible by 7%2A9%2A11=693.
We could say that 0, 693, 2%2A693 are exactly divisible by 7, 9, and 11.
If a number leaves remainders of 1,2, and 3 respectively when divided by 7, 9, and 11, adding (or subtracting) 693 to that number will produce another number that satisfies the same requirement.
The smallest such number must be between 0 and 693.

Let's consider numbers with a remainder of 3 when divided by 11.
We could say that the first number with a remainder of 3 when divided by 11 is 3, and adding 11 repeatedly we get others. The next is 14, then 25, and so on. It's an arithmetic sequence.
When divided by 7, and by 9, 3 leaves a remainder of 3.
In the sequence 3, 14,25, ..., the remainders from dividing by 9, and by 7 change in predictable ways.
The remainders from dividing by 9, increase by 11-9=2 each time to 5 and 7, and continue to increase in modulo 9 fashion to 9-9=0, 11-9=2, 4, 6, 8, 10-9=1, and then 3 starting the cycle again, after 9 additions of 11 for a total addition of 9%2A11=99%7D%7D.+The+first+of+those+numbers+with+a+remainder+of+%7B%7B%7B2 when divided by 9 is 3%2B4%2A11=3%2B44=47. Every 99 units we get another one.
The remainders from dividing by 7, increase by 11-7=4 each time in modulo 7 fashion going to 7-7=0, 4, 8-7=1, 5, 9-7=2, 6 and then 10-7=3, starting the cycle again, after 7 additions of 11 for a total addition of 7%2A11=99%7D%7D.+The+first+of+those+numbers+with+a+remainder+of+%7B%7B%7B1 when divided by 7 is 3%2B3%2A11=3%2B33=36. Every 77 units we get another one.
We need a number that can be written as 99p%2B47 and as 77q%2B36
99p%2B47=77q%2B36-->77p%2B36%2B22p%2B11=77q%2B36-->77p%2B11%282p%2B1%29=77q--> 11(2p+1)=77q-77p}}}-->11%282p%2B1%29=7%2A11%28q-p%29
2p%2B1 must be a multiple of 7, and the smallest one happens for 2p%2B1=7-->p=3
99%2A3%2B47=297%2B47=highlight%28344%29