When an integer Q is divided by 5, it leaves 1 as a

Oldest

Best Reply

Author

Message

TAGS:

Current Student

Joined: 31 Aug 2007

Posts: 374

Followers: 1

Kudos [?]: 36 [0], given: 1

When an integer Q is divided by 5, it leaves 1 as a [#permalink]

29 Nov 2007, 20:00

00:00

Question Stats:

0% (00:00) correct

0% (00:00) wrong

based on 0 sessions

When an integer Q is divided by 5, it leaves 1 as a remainder. When Q is divided by 7, it leaves 3 as a remainder. Find the smallest positive Q. Then find the next smallest positive Q.

Manager

Joined: 01 Oct 2007

Posts: 87

Followers: 0

Kudos [?]: 6 [0], given: 0

Re: PS division [#permalink]

29 Nov 2007, 20:22

young_gun wrote:

When an integer Q is divided by 5, it leaves 1 as a remainder. When Q is divided by 7, it leaves 3 as a remainder. Find the smallest positive Q. Then find the next smallest positive Q.

Q = 5k + 1 and 7t + 3, where k & t are positive integers.

So 5k + 1 = 7t + 3

5k = 7t + 2

k = (7t + 2)/5. We want values of t such that 7t + 2 is divisible by 5. The lowest is 4; the next lowest is 9.

If t = 4, Q = 31.

If t = 9, Q = 66.

Senior Manager

Joined: 09 Oct 2007

Posts: 471

Followers: 1

Kudos [?]: 15 [0], given: 1

[#permalink]

29 Nov 2007, 22:32

I like johnrb's method. Mine wasn;t as fancy.

Did 2 lists. First, the column on the right with multiples of 7. Then a column on the right, adding 3 to the number on the left:

7 10
14 17
21 24
28 31
35 38
42 45
49 52
56 59
63 66
70 73

Then went though it to find a mutliple of five+1. Whole thing didn't take a minute to do.

Current Student

Joined: 31 Aug 2007

Posts: 374

Followers: 1

Kudos [?]: 36 [0], given: 1

Re: PS division [#permalink]

30 Nov 2007, 10:32

johnrb wrote:

young_gun wrote:

When an integer Q is divided by 5, it leaves 1 as a remainder. When Q is divided by 7, it leaves 3 as a remainder. Find the smallest positive Q. Then find the next smallest positive Q.

agreed, this method is nice...how can you quickly find values of t such that 7t + 2 is divisible by 5?

CIO

Joined: 09 Mar 2003

Posts: 471

Followers: 1

Kudos [?]: 16 [0], given: 0

[#permalink]

30 Nov 2007, 10:47

asdert wrote:

Personally, when it comes to remainders, simpler is better. Lots of algebra looks great and sophisticated, but often is confusing and time consuming. I think this method, though not "as fancy", yields the right answer nearly immediately.

Note that asdert started with multiples of 7. That's the right move. S/He could have started with 5, but then there are just more numbers to write out on the list. So start with the higher number, then make the other number conform.

[#permalink] 30 Nov 2007, 10:47

		Similar topics	Author	Replies	Last post
Similar Topics:		When an integer Q is divided by 5, it leaves 1 as a	stolyar	2	15 Jul 2003, 09:48
		When an integer Z is divided by 3, it leaves 1 as a	stolyar	6	15 Jul 2003, 09:54
		An integer when divided by 12 leaves remainder 0,when	Praetorian	8	06 Oct 2003, 02:26
	1	Q. When integer x is divided by 3, the remainder is 1; when	pretttyune	1	12 Nov 2007, 04:42
	5	A number when divided successively by 4 and 5 leaves	stne	9	28 Aug 2012, 22:32

When an integer Q is divided by 5, it leaves 1 as a

Main navigation

GMAT Resources

Partners

MBA Resources

GMAT ® is a registered trademark of the Graduate Management Admission Council ® (GMAC ®). GMAT Club's website has not been reviewed or endorsed by GMAC.

GMAT Courses

Admissions Consulting

When an integer Q is divided by 5, it leaves 1 as a

When an integer Q is divided by 5, it leaves 1 as a

Main navigation

GMAT Resources

Partners

MBA Resources