If the three unique positive digits A,B, and C are arranged

Clever approach. Apparently the post is wrong then as it says the non-divisor is 11 (answer D).

The answer indeed is 11. However I reached there by actually doing the permutations of digits 1, 2, 3 and adding them up and checking for the divisibility furthur. I am sure there should be some other approach

Can you please let me know your approach?

Mine is a random approach...the question here is "Except" kind off so one can pick any number. I picked 123 and listed all the possible permutations

123
132
231
213
312
321

Which sums up to 1332. one can see that the number "1332" is clearly divisible by 3 and 2 and hence 6. also it is not divisible by 11. for 37 I actually divided the number by 37 and found it as divisible. and hence answer is D....Bunuels' formula is an excellent way to do with..

Ans: There would be six combinations of numbers, let A=x, B=y, C=z. Now ABC= 100x+10y+z and if we add all the six numbers we get 222(x+y+z). We check that 222 is divisible by all of the options except 37. The answer is (E).

222 IS divisible by 37: 37*6=222. Check here: if-the-three-unique-positive-digits-a-b-and-c-are-arranged-143836.html#p1152825

Did in the same way; shortened the addition part

Picked up first two & so on as below..

255 + 466 + 933

= 1332

Fails divisibility check of 11

Answer = D

does gmat really ask such kind of questions?
i got it right and its excellent for practise but really?
Honest answer expected as always
thanks

First, consider a random three digit number as an example: 375 = 100(3) + 10(7) + 1(5), because 3 is in the hundreds place, 7 is in the tens place, and 5 is in the ones place. More generally, ABC = 100(A) + 10(B) + 1(C). For digit problems, particularly those that involve
“shuffling” or permutations of digits, we must think about place value.

Since we are dealing with three unique digits, the number of possible sequences will be 3! or 6. If we write them out, we can see a pattern:
ABC
ACB
BAC
BCA
CAB
CBA

Notice that each unique digit appears exactly twice in each column, so each column individually sums to 2(A + B + C).
Sum of the hundreds column: 100 × 2(A + B + C) = 200(A + B + C)
Sum of the tens column: 10 × 2(A + B + C) = 20(A + B + C)
Sum of the ones column: 1 × 2(A + B + C) = 2(A + B + C)
Altogether, the sum of the three-digit numbers is (200 + 20 + 2)(A + B + C) = 222(A + B + C). Regardless of the values of A, B, and C, the sum of the three-digit numbers must be divisible by 222 and all of its factors: 1, 2, 3, 6, 37, 74, 111, and 222. The only answer choice that is not among these
is 11.

The correct answer is D.

let digits be 2,3,4
possible sequences=6
[(234+432)/2]*6=1998=sum of six 3-digit integers
1998/37=54
1998/11=181.6
D

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.