## There are 27 different three-digit integers that can be formed using only the digits 1, 2 and 3. If all 27 of the

##### This topic has expert replies
Moderator
Posts: 6225
Joined: 07 Sep 2017
Followed by:20 members

### There are 27 different three-digit integers that can be formed using only the digits 1, 2 and 3. If all 27 of the

by BTGmoderatorDC » Thu Apr 15, 2021 6:10 pm

00:00

A

B

C

D

E

## Global Stats

There are 27 different three-digit integers that can be formed using only the digits 1, 2 and 3. If all 27 of the integers were listed, what would their sum be?

A. 2,704
B. 2,990
C. 5,404
D. 5,444
E. 5,994

OA E

Source: GMAT Prep

### GMAT/MBA Expert

GMAT Instructor
Posts: 15946
Joined: 08 Dec 2008
Location: Vancouver, BC
Thanked: 5254 times
Followed by:1267 members
GMAT Score:770

### Re: There are 27 different three-digit integers that can be formed using only the digits 1, 2 and 3. If all 27 of the

by [email protected] » Fri Dec 03, 2021 7:38 am
BTGmoderatorDC wrote:
Thu Apr 15, 2021 6:10 pm
There are 27 different three-digit integers that can be formed using only the digits 1, 2 and 3. If all 27 of the integers were listed, what would their sum be?

A. 2,704
B. 2,990
C. 5,404
D. 5,444
E. 5,994

OA E

Source: GMAT Prep
This is a great example of how the GMAT often rewards students for thinking outside the box.

Here, we can apply a divisibility rule that says integer N is divisible by 3 if and only if the sum of the digits of N is divisible by 3.
For example, we know that 11112 is divisible by 3, because 1+1+1+1+5=9, and 9 is divisible by 3.

Notice that 1+2+3 = 6, and 6 is divisible by 3
This means any 3-digit integer consisting of a 1, a 2 and a 3 must be divisible by 3
If each of the 27 integers in the sum is divisible by 3, then the sum must also be divisible by 3.
In other words, the correct answer must be divisible by 3, which means the sum of its digits must be divisible by 3.