GMAT Question of the Day - Daily to your Mailbox; hard ones only

It is currently 12 Dec 2018, 00:04

Close

GMAT Club Daily Prep

Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

Close

Request Expert Reply

Confirm Cancel
Events & Promotions in December
PrevNext
SuMoTuWeThFrSa
2526272829301
2345678
9101112131415
16171819202122
23242526272829
303112345
Open Detailed Calendar
  • The winning strategy for 700+ on the GMAT

     December 13, 2018

     December 13, 2018

     08:00 AM PST

     09:00 AM PST

    What people who reach the high 700's do differently? We're going to share insights, tips and strategies from data we collected on over 50,000 students who used examPAL.
  • GMATbuster's Weekly GMAT Quant Quiz, Tomorrow, Saturday at 9 AM PST

     December 14, 2018

     December 14, 2018

     09:00 AM PST

     10:00 AM PST

    10 Questions will be posted on the forum and we will post a reply in this Topic with a link to each question. There are prizes for the winners.

If m and n are positive integers, is the remainder of

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:

Hide Tags

Manager
Manager
avatar
Joined: 16 Feb 2010
Posts: 177
If m and n are positive integers, is the remainder of  [#permalink]

Show Tags

New post 24 Sep 2010, 14:11
7
58
00:00
A
B
C
D
E

Difficulty:

  95% (hard)

Question Stats:

43% (01:16) correct 57% (01:29) wrong based on 875 sessions

HideShow timer Statistics

If \(m\) and \(n\) are positive integers, is the remainder of \(\frac{10^m + n}{3}\) larger than the remainder of \(\frac{10^n + m}{3}\) ?

(1) \(m \gt n\)
(2) The remainder of \(\frac{n}{3}\) is \(2\)

i disagree with the OA answer: -

"Statement (2) by itself is sufficient. If the remainder of \(\frac{n}{3}\) is 2, as S2 states, then \(n\) is 2, 5, or 8 and the sum of the digits of \(\frac{10^m + n}{3}\) is divisible by 3. Therefore, the remainder of \(\frac{10^m + n}{3}\) is 0, which cannot be larger that the remainder of \(\frac{10^n + m}{3}\) no matter what \(m\) is."but if m=n, then the remainder of both expresions will be 0!
even more weird is if m=2, n=5, therefore remainder 0 for both....


please advice
Most Helpful Expert Reply
Veritas Prep GMAT Instructor
User avatar
P
Joined: 16 Oct 2010
Posts: 8659
Location: Pune, India
Re: If m and n are positive integers, is the remainder of  [#permalink]

Show Tags

New post 12 Apr 2012, 10:28
24
3
zisis wrote:
If \(m\) and \(n\) are positive integers, is the remainder of \(\frac{10^m + n}{3}\) larger than the remainder of \(\frac{10^n + m}{3}\) ?

1. \(m \gt n\)
2. The remainder of \(\frac{n}{3}\) is \(2\)



You can also use binomial theorem here. Again, let me reiterate that there are many concepts which are not essential for GMAT but knowing them helps you get to the answer quickly.

The moment I see \(\frac{10^m + n}{3}\) here, my mind sees \(\frac{(9+1)^m + n}{3}\)
So I say that \(\frac{10^m}{3}\) and \(\frac{10^n}{3}\) give remainder 1 in any case (m and n are positive integers). I just need to worry about n/3 and m/3.

1. \(m \gt n\)
Doesn't tell me about the remainder when m and n are divided by 3.

2. The remainder of \(\frac{n}{3}\) is \(2\)
If n/2 gives a remainder of 2, total remainder of \(\frac{10^m + n}{3}\) is 1+2 = 3 which is equal to 0. So no matter what the remainder of \(\frac{m}{3}\), the remainder of \(\frac{10^n + m}{3}\) will never be less than 0. Hence sufficient.

Answer B
_________________

[b]Karishma
Veritas Prep GMAT Instructor

Learn more about how Veritas Prep can help you achieve a great GMAT score by checking out their GMAT Prep Options >

Most Helpful Community Reply
Manager
Manager
avatar
Joined: 30 May 2010
Posts: 176
Re: GMAT Club > Tests > Number Properties - I Question 8  [#permalink]

Show Tags

New post 24 Sep 2010, 14:52
12
3
To determine if a number is divisible by 3, add the digits and if they are divisible by 3, then the entire number is also.

We are given m and n are positive integers. The sum of the digits of 10 to any positive power will always be 1.

From statement 2, we are told the remainder of \(n/3\) will be 2.

For \((10^m + n)/3\), the \(10^m\) part will always give you 1 in the sum of the digits, and the n part will always give you 2 in the digits of the numerator. Therefore, this will always be divisible by 3 (have a remainder of 0).

The question asked if (10^m + n)/3 will ever have a larger remainder than \((10^n + m)/3\). Remainders can't be negative, therefore we know it will never be larger. There is no need to evaluate possible remainders of \((10^n + m)/3\).
General Discussion
Manager
Manager
avatar
Joined: 04 Aug 2010
Posts: 103
Re: GMAT Club > Tests > Number Properties - I Question 8  [#permalink]

Show Tags

New post 24 Sep 2010, 14:42
2
The question asks if the reminder can be larger though. So even if the m = n and the reminders of both terms are 0, it's still not larger.

I agree with answer B.
Manager
Manager
avatar
Joined: 30 May 2008
Posts: 53
Re: If m and n are positive integers, is the remainder of  [#permalink]

Show Tags

New post 10 Apr 2012, 07:02
For (10^m + n) /3, the 10^m part will always give you 1 in the sum of the digits, and the n part will always give you 2 in the digits of the numerator. Therefore, this will always be divisible by 3 (have a remainder of 0).

I'm not sure i understand the bold face part, why will it give you 2? how did you come to this conclusion?
Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 51104
If m and n are positive integers, is the remainder of  [#permalink]

Show Tags

New post 10 Apr 2012, 07:08
17
9
catty2004 wrote:
For (10^m + n) /3, the 10^m part will always give you 1 in the sum of the digits, and the n part will always give you 2 in the digits of the numerator. Therefore, this will always be divisible by 3 (have a remainder of 0).

I'm not sure i understand the bold face part, why will it give you 2? how did you come to this conclusion?


\(m\) and \(n\) are positive integers. Is the remainder of \(\frac{10^m + n}{3}\) bigger than the remainder of \(\frac{10^n + m}{3}\) ?

First of all any positive integer can yield only three remainders upon division by 3: 0, 1, or 2.

Since, the sum of the digits of \(10^m\) and \(10^n\) is always 1 then the remainders of \(\frac{10^m + n}{3}\) and \(\frac{10^n + m}{3}\) are only dependent on the value of the number added to \(10^m\) and \(10^n\). There are 3 cases:
If the number added to them is: 0, 3, 6, 9, ... then the remainder will be 1 (as the sum of the digits of \(10^m\) and \(10^n\) will be 1 more than a multiple of 3);
If the number added to them is: 1, 4, 7, 10, ... then the remainder will be 2 (as the sum of the digits of \(10^m\) and \(10^n\) will be 2 more than a multiple of 3);
If the number added to them is: 2, 5, 8, 11, ... then the remainder will be 0 (as the sum of the digits of \(10^m\) and \(10^n\) will be a multiple of 3).

(1) \(m \gt n\). Not sufficient.

(2) The remainder of \(\frac{n}{3}\) is \(2\) --> \(n\) is: 2, 5, 8, 11, ... so we have the third case. Which means that the remainder of \(\frac{10^m + n}{3}\) is 0. Now, the question asks whether the remainder of \(\frac{10^m + n}{3}\), which is 0, greater than the reminder of \(\frac{10^n + m}{3}\), which is 0, 1, or 2. Obviously it cannot be greater, it can be less than or equal to. So, the answer to the question is NO. Sufficient.

Answer: B.

Hope it's clear.
_________________

New to the Math Forum?
Please read this: Ultimate GMAT Quantitative Megathread | All You Need for Quant | PLEASE READ AND FOLLOW: 12 Rules for Posting!!!

Resources:
GMAT Math Book | Triangles | Polygons | Coordinate Geometry | Factorials | Circles | Number Theory | Remainders; 8. Overlapping Sets | PDF of Math Book; 10. Remainders | GMAT Prep Software Analysis | SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS) | Tricky questions from previous years.

Collection of Questions:
PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat

DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.


What are GMAT Club Tests?
Extra-hard Quant Tests with Brilliant Analytics

Manager
Manager
avatar
Joined: 30 May 2008
Posts: 53
Re: If m and n are positive integers, is the remainder of  [#permalink]

Show Tags

New post 10 Apr 2012, 07:28
crystal clear! Just hope that my brain will remember this on the test day!
Intern
Intern
avatar
Joined: 22 Jan 2012
Posts: 31
Re: If m and n are positive integers, is the remainder of  [#permalink]

Show Tags

New post 29 Apr 2012, 09:32
I have a doubt why B is sufficient to answer the question.
I understood the solution but if we take only the statement B then there is nothing to prove that m is not equal to n.
As in the given statement m and n are positive integers but what is the relation between them is not provided whether m >n , m<n or m=n .

Also ,by B we are only able to prove that remainder will not be lesser but what if equal or greater.
Veritas Prep GMAT Instructor
User avatar
P
Joined: 16 Oct 2010
Posts: 8659
Location: Pune, India
Re: If m and n are positive integers, is the remainder of  [#permalink]

Show Tags

New post 30 Apr 2012, 05:04
3
raingary wrote:
I have a doubt why B is sufficient to answer the question.
I understood the solution but if we take only the statement B then there is nothing to prove that m is not equal to n.
As in the given statement m and n are positive integers but what is the relation between them is not provided whether m >n , m<n or m=n .

Also ,by B we are only able to prove that remainder will not be lesser but what if equal or greater.


The question is:
is the remainder of 'a' larger than the remainder of 'b'?

We found that the remainder of 'a' is 0 which is the smallest possible remainder. No matter what the remainder of 'b' is, it will never be less than 0. So remainder of 'a' can never be larger than the remainder of 'b'. We can answer the question with 'No'. Therefore, statement 2 is sufficient.
_________________

[b]Karishma
Veritas Prep GMAT Instructor

Learn more about how Veritas Prep can help you achieve a great GMAT score by checking out their GMAT Prep Options >

Intern
Intern
avatar
Joined: 11 May 2011
Posts: 6
Location: United States (NY)
Concentration: Real Estate, Finance
GMAT 1: 720 Q48 V40
Re: If m and n are positive integers, is the remainder of  [#permalink]

Show Tags

New post 23 Jul 2012, 20:18
to rephrase the question is x greater than y ( here x and y are the remainders).
If x is greater than y, answer is yes but if x is not greater than y the answer is no.

If x is 0 and y is 0 ----No
If x is 1 or 2 and y is 0 , the Yes

Why is the answer not E?

If the question is reversed -- is the remainder of 10^n +m/3 larger than the remainder of 10^m+n/3 ? then the answer would be B as
0 can never be greater than 0, 1 or 2.
Veritas Prep GMAT Instructor
User avatar
P
Joined: 16 Oct 2010
Posts: 8659
Location: Pune, India
Re: If m and n are positive integers, is the remainder of  [#permalink]

Show Tags

New post 24 Jul 2012, 04:17
nomis wrote:
to rephrase the question is x greater than y ( here x and y are the remainders).
If x is greater than y, answer is yes but if x is not greater than y the answer is no.

If x is 0 and y is 0 ----No
If x is 1 or 2 and y is 0 , the Yes

Why is the answer not E?

If the question is reversed -- is the remainder of 10^n +m/3 larger than the remainder of 10^m+n/3 ? then the answer would be B as
0 can never be greater than 0, 1 or 2.


Because you find that a = 0 (the remainder of the first expression is 0). Hence under no condition can 'a' be greater than 'b'. Hence, it is sufficient to answer with an emphatic 'No'.
_________________

[b]Karishma
Veritas Prep GMAT Instructor

Learn more about how Veritas Prep can help you achieve a great GMAT score by checking out their GMAT Prep Options >

Manager
Manager
User avatar
Joined: 03 Dec 2012
Posts: 214
Re: If m and n are positive integers, is the remainder of  [#permalink]

Show Tags

New post 20 Oct 2013, 23:42
1
karishma I did not understand this statement the total remainder 1+2=3 which is equal to zero
Intern
Intern
avatar
Joined: 05 Oct 2013
Posts: 21
Re: If m and n are positive integers, is the remainder of  [#permalink]

Show Tags

New post 21 Oct 2013, 09:19
The remainder of 10/3 is 1. So 1^n =1 = 1^m is the remainder of 10^n / 3 as well as 10^m/3. Therefore, the remainder of (10^n + m)/3 is the remainder of (1+m)/3 and the remainder of (10^m +n)/3 is equal to the remainder of (1 +n)/3.
(1) m >n which does not give us any extra information about the remainder of m,n/3.
(2) 2 is the remainder of n/3, so 0 is the remainder of (1+n)/3. That means the remainder of \frac{10^m + n}{3} is not larger than the remainder of \frac{10^n + m}{3}
The answer is B
Manager
Manager
User avatar
Joined: 04 Oct 2013
Posts: 170
Concentration: Finance, Leadership
GMAT 1: 590 Q40 V30
GMAT 2: 730 Q49 V40
WE: Project Management (Entertainment and Sports)
Re: If m and n are positive integers, is the remainder of  [#permalink]

Show Tags

New post 14 Nov 2014, 01:43
mohnish104 wrote:
karishma I did not understand this statement the total remainder 1+2=3 which is equal to zero


Even if my reply is belated. You can perform addition/subtraction/multiplication/division with reminders as long as you correct the excess, because a reminder must be at least one unit smaller than a divisor. If an expression yields R1 and the other expression yields R2 the overall expression in this case a sum yields R3 but since R3 is an illegal value you have to correct the excess and you do that by subtracting 3. Now R3-R3=R0 --> multiple of 3. That's what she said *wink.

Regarding the whole question, I'd suggest to write down a few numbers and see the behavior when divided by 3. It is helpful especially with statement 2 because you will be visually able to realize that is talking about (3n-1). Not super hard, but time consuming for sure, at least for me.
_________________

learn the rules of the game, then play better than anyone else.

Math Revolution GMAT Instructor
User avatar
V
Joined: 16 Aug 2015
Posts: 6621
GMAT 1: 760 Q51 V42
GPA: 3.82
Premium Member
Re: If m and n are positive integers, is the remainder of  [#permalink]

Show Tags

New post 06 Feb 2016, 18:23
Forget conventional ways of solving math questions. In DS, Variable approach is the easiest and quickest way to find the answer without actually solving the problem. Remember equal number of variables and independent equations ensures a solution.

If m and n are positive integers, is the remainder of 10m+n/3 larger than the remainder of 10n+m/3 ?

(1) m>n
(2) The remainder of n/3 is 2


Modify the original condition and the question. You need to figure out a remainder dividing n+1 with 3, regardless of the remainder dividing 10^m+n with 3 apart from m. Also, you need to figure out a remainder dividing m+1 with 3, regardless of the remainder dividing 10^n+m with 3 apart from n.
Thus, there are 2 variables, which should match with the number of equations. So you need 2 equations. For 1) 1 equation, for 2) 1 equation, which is likely to make C the answer.
When 1) & 2), if n=2, m=3, 2+1 divided by 3 is 0 and 3+1 divided by 3 is 1, which is no and sufficient. That makes C the answer.
Since this is an integer question, one of the key questions, apply the mistake type 4(A). In 1) m>n, m=2, n=1 -> yes, m=3, n=2 -> no, which is not sufficient. For 2), if you substitute n=2,5,8.., the remainder is 0 when dividing n+1 with 3. Then, m+1 divided by 3 can have a remainder amongst 0,1,2, which is always no and sufficient. Therefore, the answer is B.
Getting this type of question right can lead you to score 50-51.


-> Once we modify the original condition and the question according to the variable approach method 1, we can solve approximately 30% of DS questions.

-> For cases where we need 2 more equations, such as original conditions with “2 variables”, or “3 variables and 1 equation”, or “4 variables and 2 equations”, we have 1 equation each in both 1) and 2). Therefore, there is 70% chance that C is the answer, while E has 25% chance. These two are the majority. In case of common mistake type 3,4, the answer may be from A, B or D but there is only 5% chance. Since C is most likely to be the answer using 1) and 2) separately according to DS definition (It saves us time). Obviously there may be cases where the answer is A, B, D or E.
_________________

MathRevolution: Finish GMAT Quant Section with 10 minutes to spare
The one-and-only World’s First Variable Approach for DS and IVY Approach for PS with ease, speed and accuracy.
"Only $99 for 3 month Online Course"
"Free Resources-30 day online access & Diagnostic Test"
"Unlimited Access to over 120 free video lessons - try it yourself"

Current Student
User avatar
D
Joined: 12 Aug 2015
Posts: 2629
Schools: Boston U '20 (M)
GRE 1: Q169 V154
GMAT ToolKit User Premium Member
Re: If m and n are positive integers, is the remainder of  [#permalink]

Show Tags

New post 17 Oct 2016, 12:01
Just a Quick Fact =>
10^x for any positive integer x always leaves a remainder 1 when divided by 3 or 9
the reason being all the digits are zero except for the first digit -> that is one
hence the sum of digits will be 1
hence reminder with 3 =>1
remainder with 9 => 1
_________________


MBA Financing:- INDIAN PUBLIC BANKS vs PRODIGY FINANCE!

Getting into HOLLYWOOD with an MBA!

The MOST AFFORDABLE MBA programs!

STONECOLD's BRUTAL Mock Tests for GMAT-Quant(700+)

AVERAGE GRE Scores At The Top Business Schools!

Senior Manager
Senior Manager
avatar
G
Joined: 02 Apr 2014
Posts: 474
GMAT 1: 700 Q50 V34
If m and n are positive integers, is the remainder of  [#permalink]

Show Tags

New post 25 Feb 2018, 06:04
10^x divided by 3 always leaves remainder 1
so question is reduced to is (1+n)/3 remainder > (1+m)/3 remainder?

statement 1: m > n
if m = 2, n =1 , remainder (1+n)/3 = 2, remainder of (1+m)/3 = 0 => answer yes to question
if m = 3, n =2 , remainder (1+n)/3 = 0, remainder of (1+m)/3 = 1 => answer no to question
Insuff

Statement: n/3 leaves remainder 2
so n = 3k + 2, where k is any integer
(1+n) = 1 + 3k + 2 = 3k + 3 will leave remainder 0 when divided by 3
so (1+n)/3 remainder will be less than or equal to (1+m)/3 remainder, we can answer NO to the question => (B)
Manager
Manager
avatar
B
Joined: 22 Sep 2014
Posts: 106
GMAT ToolKit User
Re: If m and n are positive integers, is the remainder of  [#permalink]

Show Tags

New post 26 Sep 2018, 18:36
i don;t understand ....the answer is a NO ....why is the correct answer is B ? not E?
Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 51104
Re: If m and n are positive integers, is the remainder of  [#permalink]

Show Tags

New post 26 Sep 2018, 19:52
newyork2012 wrote:
i don;t understand ....the answer is a NO ....why is the correct answer is B ? not E?


There are two types of data sufficiency questions:

1. YES/NO DS Questions:

In a Yes/No Data Sufficiency questions, statement(s) is sufficient if the answer is “always yes” or “always no” while a statement(s) is insufficient if the answer is "sometimes yes" and "sometimes no".


2. VALUE DS QUESTIONS:

When a DS question asks about the value of some variable, then the statement(s) is sufficient ONLY if you can get the single numerical value of this variable.

This question is a VALUE question, so a statement to be sufficient it should give the single numerical value of the units digit. As you said, from (1) it could be 1 or 6, so (1) is not sufficient.

Hope it's clear.
_________________

New to the Math Forum?
Please read this: Ultimate GMAT Quantitative Megathread | All You Need for Quant | PLEASE READ AND FOLLOW: 12 Rules for Posting!!!

Resources:
GMAT Math Book | Triangles | Polygons | Coordinate Geometry | Factorials | Circles | Number Theory | Remainders; 8. Overlapping Sets | PDF of Math Book; 10. Remainders | GMAT Prep Software Analysis | SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS) | Tricky questions from previous years.

Collection of Questions:
PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat

DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.


What are GMAT Club Tests?
Extra-hard Quant Tests with Brilliant Analytics

Manager
Manager
avatar
B
Joined: 29 May 2017
Posts: 127
Location: Pakistan
Concentration: Social Entrepreneurship, Sustainability
Re: If m and n are positive integers, is the remainder of  [#permalink]

Show Tags

New post 30 Sep 2018, 15:42
VeritasKarishma wrote:
zisis wrote:
If \(m\) and \(n\) are positive integers, is the remainder of \(\frac{10^m + n}{3}\) larger than the remainder of \(\frac{10^n + m}{3}\) ?

1. \(m \gt n\)
2. The remainder of \(\frac{n}{3}\) is \(2\)



You can also use binomial theorem here. Again, let me reiterate that there are many concepts which are not essential for GMAT but knowing them helps you get to the answer quickly.

The moment I see \(\frac{10^m + n}{3}\) here, my mind sees \(\frac{(9+1)^m + n}{3}\)
So I say that \(\frac{10^m}{3}\) and \(\frac{10^n}{3}\) give remainder 1 in any case (m and n are positive integers). I just need to worry about n/3 and m/3.

1. \(m \gt n\)
Doesn't tell me about the remainder when m and n are divided by 3.

2. The remainder of \(\frac{n}{3}\) is \(2\)
If n/2 gives a remainder of 2, total remainder of \(\frac{10^m + n}{3}\) is 1+2 = 3 which is equal to 0. So no matter what the remainder of \(\frac{m}{3}\), the remainder of \(\frac{10^n + m}{3}\) will never be less than 0. Hence sufficient.

Answer B


VeritasKarishma

Hi.....i picked numbers: n is 2 and m as 3

1) m>n

(10^3 + 2)/3 --> (10^3/3) plus (2/3)
remainder (10^3/3)--> 1
remainder 2/3 --> 2

so the total remainder is 3

my question: why am i getting 3? since division by 3, i shd only get 0,1 or 2.

thanks
GMAT Club Bot
Re: If m and n are positive integers, is the remainder of &nbs [#permalink] 30 Sep 2018, 15:42

Go to page    1   2    Next  [ 21 posts ] 

Display posts from previous: Sort by

If m and n are positive integers, is the remainder of

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  


cron
Copyright

GMAT Club MBA Forum Home| About| Terms and Conditions and Privacy Policy| GMAT Club Rules| Contact| Sitemap

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne

Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.