M and N are integers. Find the remainder when is divided by

Oldest

Best Reply

Author

Message

TAGS:

SVP

Joined: 03 Feb 2003

Posts: 1683

Followers: 4

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

M and N are integers. Find the remainder when is divided by [#permalink]

27 Sep 2003, 11:58

00:00

Question Stats:

0% (00:00) correct

0% (00:00) wrong

based on 0 sessions

M and N are integers. Find the remainder when [M^2+N^2] is divided by 4.

(1) M and N are consequtive integers
(2) M is odd and N is even

Intern

Joined: 07 Sep 2003

Posts: 15

Followers: 0

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

[#permalink]

27 Sep 2003, 17:14

D -

a. 2N^2 + 2N + 1 : odd
b. (odd)^2 + (even^2) : odd

both can't be divisible by 4.

SVP

Joined: 03 Feb 2003

Posts: 1683

Followers: 4

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

[#permalink]

28 Sep 2003, 07:34

The question is to find the remainder, and not to define whether the sum is divisible by 4 or not.

Intern

Joined: 29 Sep 2003

Posts: 2

Location: Dubai

Followers: 0

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

[#permalink]

29 Sep 2003, 03:09

I would say A

'coz the sum of the squares of any 2 consecutive nos is 1 more than a multiple of 4.Hence no matter which 2 consecutive nos we take, we will always have 1 as the remainder

Egs:
2^2+3^3=13 which when divided by 4 gives 1 as the remainder
4^4+5^5=41 which when divided by 4 gives 1 as the remainder

Senior Manager

Joined: 22 Aug 2003

Posts: 262

Location: Bangalore

Followers: 1

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

[#permalink]

29 Sep 2003, 03:57

D both are suffecient.
1) Sum of two consecutive integers always give 1 as remainder.
2) (2m)^2 + (2n+1)^2 when M & N are even and odd
= 4(m^2 + n^2 + n) + 1

SVP

Joined: 03 Feb 2003

Posts: 1683

Followers: 4

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

[#permalink]

04 Oct 2003, 03:33

Vicky wrote:

D both are suffecient.
1) Sum of two consecutive integers always give 1 as remainder.
2) (2m)^2 + (2n+1)^2 when M & N are even and odd
= 4(m^2 + n^2 + n) + 1

D is correct. A small addition for (1) sum of SQUARES of two consequtive integers always gives 1 in a remainder when the sum is divided by 4. Lets prove it quickly.

If M and N are consequtive, then one is even and the other is odd
Let M=2k, and N=2k+1
M┬▓+N┬▓=4k┬▓+4k┬▓+4k+1=4(2k┬▓+k)+1

[#permalink] 04 Oct 2003, 03:33

		Similar topics	Author	Replies	Last post
Similar Topics:		What is the remainder when the positive integer n is divided	mandy	9	03 Aug 2005, 06:35
		What is the remainder when the positive integer n is divided	sperumba	9	18 Jan 2006, 19:58
		If r is the remainder when positive integer n is divided by	wshaffer	4	18 Sep 2006, 17:43
		What is the remainder when positive Integer n is divided by	GmatInstinct	2	25 Sep 2006, 17:01
	1	If n is an integer, what is the remainder when n is divided	vcbabu	29	31 May 2009, 10:07

M and N are integers. Find the remainder when is divided by

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

M and N are integers. Find the remainder when is divided by

M and N are integers. Find the remainder when is divided by

Main navigation

GMAT Resources

Partners

MBA Resources