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.

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

Re: If the operation @ is defined for all integers a and b [#permalink]
18 Sep 2010, 19:29

3

This post received KUDOS

Expert's post

1

This post was BOOKMARKED

cmugeria wrote:

If the operation @ is defined for all integers a and b by a@b=a+b-ab, which of the following statements must be true for all integers a, b and c?

I. a@b = b@a II. a@0 = a III. (a@b)@c = a@(b@c)

(A) I only (B) II only (C) I and II only (D) I and III only (E) I, II and III

We have that: a@b=a+b-ab

I. a@b = b@a --> a@b=a+b-ab and b@a=b+a-ab --> a+b-ab=b+a-ab, results match;

II. a@0 = a --> a@0=a+0-a*0=0 --> 0=0, results match;

III. (a@b)@c = a@(b@c) --> (a@b)@c=a@b+c-(a@b)*c=(a+b-ab)+c-(a+b-ab)c=a+b+c-ab-ac-bc+abc and a@(b@c)=a+b@c-a*(b@c)=a+(b+c-bc)-(b+c-bc)a=a+b+c-bc-ab+abc, results match.

Re: If the operation @ is defined for all integers a and b [#permalink]
15 Jan 2012, 16:17

I was careless in writing the equation for option 3, else it was easy. I got it wrong but once you write it you clearly see that C also satifies the equation.

Re: If the operation @ is defined for all integers a and b [#permalink]
18 Dec 2012, 07:45

Sorry for bumping up an old thread, I have a doubt: my approach for solving the question was to assume that the operation in this case was the union between two sets, a and b, and consequently the three points were the properties of the union of sets. Is that a correct approach or might it be too risky in the actual exam? (or is it even a wrong assumption, and I got it right out of luck?)

Re: If the operation @ is defined for all integers a and b [#permalink]
19 Dec 2012, 02:24

Expert's post

fguardini1 wrote:

Sorry for bumping up an old thread, I have a doubt: my approach for solving the question was to assume that the operation in this case was the union between two sets, a and b, and consequently the three points were the properties of the union of sets. Is that a correct approach or might it be too risky in the actual exam? (or is it even a wrong assumption, and I got it right out of luck?)

That's not correct. Stem defines some function @ for all integers a and b by a@b=a+b-ab. For example if a=1 and b=2, then a@b=1@2=1+2-1*2.

Re: If the operation @ is defined for all integers a and b [#permalink]
28 Jan 2013, 21:58

1

This post received KUDOS

subhashghosh wrote:

(I) and (II) are obviously correct.

For (III)

(a+b-ab)@c = (a + b - ab)@c = a + b - ab + c - c(a + b - ab) = a + b - ab + c - ac - ab + abc

a@(b@c) = a@(b + c - bc) = a + b + c - bc - a(b + c - bc) = a + b + c - bc -ab - ac + abc

Answer - E

Been looking at this for a while and still can't figure it out.. I thought that we must ALWAYS first do the calculations in the brackets and open them, and then do the remaining calculations. as we have a@(b@c), how come do you straight come up to (a + b - ab)@c, when it's b@c in the brackets, not a@b anymore.. finding this one a bit confusing.. thanks for explaining in advance

EDIT:

OK, I think I get it now.. pls, have a look at my upload and let me know if I am correct.. this is the left side of the equation in (III). With the right one, we do the exact same thing, right?

Re: If the operation @ is defined for all integers a and b [#permalink]
07 May 2013, 11:22

Bunuel wrote:

We have that: a@b=a+b-ab

I. a@b = b@a --> a@b=a+b-ab and b@a=b+a-ab --> a+b-ab=b+a-ab, results match;

II. a@0 = a --> a@0=a+0-a*0=0 --> 0=0, results match;

III. (a@b)@c = a@(b@c) --> (a@b)@c=a@b+c-(a@b)*c=(a+b-ab)+c-(a+b-ab)c=a+b+c-ab-ac-bc+abc and a@(b@c)=a+b@c-a*(b@c)=a+(b+c-bc)-(b+c-bc)a=a+b+c-bc-ab+abc, results match.

Answer: E.

Bunuel, is there a faster method than solving it with algebra or picking numbers? Thanks!

Re: If the operation @ is defined for all integers a and b [#permalink]
02 Oct 2013, 12:21

danzig wrote:

Bunuel wrote:

We have that: a@b=a+b-ab

I. a@b = b@a --> a@b=a+b-ab and b@a=b+a-ab --> a+b-ab=b+a-ab, results match;

II. a@0 = a --> a@0=a+0-a*0=0 --> 0=0, results match;

III. (a@b)@c = a@(b@c) --> (a@b)@c=a@b+c-(a@b)*c=(a+b-ab)+c-(a+b-ab)c=a+b+c-ab-ac-bc+abc and a@(b@c)=a+b@c-a*(b@c)=a+(b+c-bc)-(b+c-bc)a=a+b+c-bc-ab+abc, results match.

Answer: E.

Bunuel, is there a faster method than solving it with algebra or picking numbers? Thanks!

Came here to ask this. I got this one wrong, the proof for III would have taken about 5 minutes for me to figure out

Re: If the operation @ is defined for all integers a and b [#permalink]
23 Oct 2013, 12:34

Hey there folks, sorry to bump on an old thread. Just wondering, is there a way to evaluate statement 3 faster? I believe this questions takes around 2 minutes and evaluating statement 3 takes a lot of work and is prone to errors.

Just wondering if I'm doing this the correct/most efficient way

Re: If the operation @ is defined for all integers a and b [#permalink]
27 Oct 2013, 13:13

Would it be smart to pick numbers for each of the variables? I selected 1&3 only since I got mixed up with the letter variables. Is picking number the most efficient way to approach this problem?

Re: If the operation @ is defined for all integers a and b [#permalink]
28 Oct 2013, 11:40

1

This post received KUDOS

jlgdr wrote:

Hey there folks, sorry to bump on an old thread. Just wondering, is there a way to evaluate statement 3 faster? I believe this questions takes around 2 minutes and evaluating statement 3 takes a lot of work and is prone to errors.

Just wondering if I'm doing this the correct/most efficient way

Thanks guys Cheers!

J

In this problem we have been asked to check the commutative and associative property of the given function. These properties are defined as below:

Commutative: In mathematics, a binary operation is commutative if changing the order of the operands does not change the result.

Associative: Within an expression containing two or more occurrences in a row of the same associative operator, the order in which the operations are performed does not matter as long as the sequence of the operands is not changed. That is, rearranging the parentheses in such an expression will not change its value.

If you're wondering if commutativity implies associativity in mathematics then the answer is NO. However, for simple addition and multiplication functions commutativity does imply associativity and hence in such cases option 3 need not be tested if option 1 is true. However, the only way to solve such problems which involve functions other than simple addition and multiplication would be to solve the expression completely as stated above.

Re: If the operation @ is defined for all integers a and b [#permalink]
31 Oct 2013, 04:39

Well, can't argue that learning the definitions is in fact quite interesting and thank you for that. Nevertheless, I was really intereted in solving statement 3 quicker/faster/more efficient So, being able to recognize if operations in the different order given will yield same result without having to go through all the long distribution process.

I will try to come up with a faster way but if anyone else come's up with a nice and elegant approach I'd be happy to give some nice Kudos for the collection

Re: If the operation @ is defined for all integers a and b [#permalink]
31 Oct 2013, 04:55

jlgdr wrote:

Well, can't argue that learning the definitions is in fact quite interesting and thank you for that. Nevertheless, I was really intereted in solving statement 3 quicker/faster/more efficient So, being able to recognize if operations in the different order given will yield same result without having to go through all the long distribution process.

I will try to come up with a faster way but if anyone else come's up with a nice and elegant approach I'd be happy to give some nice Kudos for the collection

Re: If the operation @ is defined for all integers a and b [#permalink]
01 Mar 2014, 15:08

Just took this question today, and I was also wondering if there were a way to solve it more quickly than performing the heavy manipulations that are in III or guessing numbers.

Re: If the operation @ is defined for all integers a and b [#permalink]
13 Jul 2014, 21:50

Bunuel wrote:

cmugeria wrote:

If the operation @ is defined for all integers a and b by a@b=a+b-ab, which of the following statements must be true for all integers a, b and c?

I. a@b = b@a II. a@0 = a III. (a@b)@c = a@(b@c)

(A) I only (B) II only (C) I and II only (D) I and III only (E) I, II and III

We have that: a@b=a+b-ab

I. a@b = b@a --> a@b=a+b-ab and b@a=b+a-ab --> a+b-ab=b+a-ab, results match;

II. a@0 = a --> a@0=a+0-a*0=0 --> 0=0, results match;

III. (a@b)@c = a@(b@c) --> (a@b)@c=a@b+c-(a@b)*c=(a+b-ab)+c-(a+b-ab)c=a+b+c-ab-ac-bc+abc and a@(b@c)=a+b@c-a*(b@c)=a+(b+c-bc)-(b+c-bc)a=a+b+c-bc-ab+abc, results match.

Answer: E.

Hi Bunuel,

Here in second statement how you are getting 0=0?

Thanks.

gmatclubot

Re: If the operation @ is defined for all integers a and b
[#permalink]
13 Jul 2014, 21:50