If x and y are positive integers and x/y has a remainder of 5, what is the smallest possible value of xy?
A) 30
b) 66
c) 22
d) 33
e) 85
Remainders
This topic has expert replies
- logitech
- Legendary Member
- Posts: 2134
- Joined: Mon Oct 20, 2008 11:26 pm
- Thanked: 237 times
- Followed by:25 members
- GMAT Score:730
x = a Y + 5Abdulla wrote:If x and y are positive integers and x/y has a remainder of 5, what is the smallest possible value of xy?
A) 30
b) 66
c) 22
d) 33
e) 85
Since we are trying to find the smallest value we should take a=1 ( you can not use a=0, because both x and y are positive integers )
X = Y + 5 Since the remainder is 5, Y > 5 and the smallest value for Y = 6
X = 6+5 = 11
XY = 6x11 = 66
Hence, B
And could you please post the official answers (OA) using the spoiler function.
Thanks
LGTCH
---------------------
"DON'T LET ANYONE STEAL YOUR DREAM!"
---------------------
"DON'T LET ANYONE STEAL YOUR DREAM!"
- logitech
- Legendary Member
- Posts: 2134
- Joined: Mon Oct 20, 2008 11:26 pm
- Thanked: 237 times
- Followed by:25 members
- GMAT Score:730
That would be 5/6 and remainder =5cramya wrote:One more vote for 30
30 = 6*5
6/5 = remainder 1
@mental:
I agree with you that a=0 and X =5 but, I am not quite clear about whether we need to stick to a rule that says:
X>Y
Any ideas ?
LGTCH
---------------------
"DON'T LET ANYONE STEAL YOUR DREAM!"
---------------------
"DON'T LET ANYONE STEAL YOUR DREAM!"
-
- Master | Next Rank: 500 Posts
- Posts: 106
- Joined: Thu May 22, 2008 10:50 am
- Thanked: 3 times
The question is basically asking us a number that is multiple of 6.
I use multiple of 6, because 6 is the next highest divisor that can actually result in a remainder of 5.
That leaves us with 30 and 66.
30=6*5 (this is basically prime factorization, but I didn't break up 6, because the question is involving 6s.)
66=6*11
5/6=0 R5
11/6= 1 R5
Answer is 30.
I hope this makes sense, please correct me if I made a mistake.
I use multiple of 6, because 6 is the next highest divisor that can actually result in a remainder of 5.
That leaves us with 30 and 66.
30=6*5 (this is basically prime factorization, but I didn't break up 6, because the question is involving 6s.)
66=6*11
5/6=0 R5
11/6= 1 R5
Answer is 30.
I hope this makes sense, please correct me if I made a mistake.
- logitech
- Legendary Member
- Posts: 2134
- Joined: Mon Oct 20, 2008 11:26 pm
- Thanked: 237 times
- Followed by:25 members
- GMAT Score:730
You know the rule..puff puff and pass!cramya wrote:Thanks Logitech; dont know what I was smoking there...That would be 5/6 and remainder =5
So I realized that I do not know some of the remainder concepts.
X = a Y + b
Lets go:
1) b < Y
The remainder for natural numbers
If a and d are natural numbers, with d non-zero, it can be proven that there exist unique integers q and r, such that a = qd + r and 0 ≤ r < d. The number q is called the quotient, while r is called the remainder. The division algorithm provides a proof of this result and also an algorithm describing how to calculate the remainder.
Examples
* When dividing 13 by 10, 1 is the quotient and 3 is the remainder, because 13=1×10+3.
* When dividing 26 by 4, 6 is the quotient and 2 is the remainder, because 26=6×4+2.
* When dividing 56 by 7, 8 is the quotient and 0 is the remainder, because 56=7×8+0.
* When dividing 3 by 10, 3 is the remainder as we always take the front number as the remainder when the second number is of higher value.
The case of general integers
If a and d are integers, with d non-zero, then a remainder is an integer r such that a = qd + r for some integer q, and with 0 ≤ |r| < |d|.
When defined this way, there are two possible remainders. For example, the division of −42 by −5 can be expressed as either
−42 = 9×(−5) + 3
as is usual for mathematicians, or
−42 = 8×(−5) + (−2).
So the remainder is then either 3 or −2.
This ambiguity in the value of the remainder can be quite serious computationally; for mission critical computing systems, the wrong choice can lead to dangerous consequences. In the case above, the negative remainder is obtained from the positive one just by subtracting 5, which is d. This holds in general. When dividing by d, if the positive remainder is r1, and the negative one is r2, then
r1 = r2 + d. :twisted:
The remainder for real numbers
When a and d are real numbers, with d non-zero, a can be divided by d without remainder, with the quotient being another real number. If the quotient is constrained to being an integer however, the concept of remainder is still necessary. It can be proved that there exists a unique integer quotient q and a unique real remainder r such that a=qd+r with 0≤r < |d|. As in the case of division of integers, the remainder could be required to be negative, that is, -|d| < r ≤ 0.
Extending the definition of remainder for real numbers as described above is not of theoretical importance in mathematics; however, many programming languages implement this definition — see modulo operation.
The inequality satisfied by the remainder
The way remainder was defined, in addition to the equality a=qd+r an inequality was also imposed, which was either 0≤ r < |d| or -|d| < r ≤ 0. Such an inequality is necessary in order for the remainder to be unique — that is, for it to be well-defined. The choice of such an inequality is somewhat arbitrary. Any condition of the form x < r ≤ x+|d| (or x ≤ r < x+|d|), where x is a constant, is enough to guarantee the uniqueness of the remainder.
what else ? Feel free to add.
- Attachments
-
Last edited by logitech on Wed Nov 19, 2008 3:16 pm, edited 3 times in total.
LGTCH
---------------------
"DON'T LET ANYONE STEAL YOUR DREAM!"
---------------------
"DON'T LET ANYONE STEAL YOUR DREAM!"