It is currently 23 Oct 2017, 19:28

### 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

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

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# What is the remainder when (1!)^3+ (2!)^3 + (3!)^3 +.....(11

Author Message
TAGS:

### Hide Tags

Manager
Joined: 19 Aug 2009
Posts: 78

Kudos [?]: 278 [5], given: 46

What is the remainder when (1!)^3+ (2!)^3 + (3!)^3 +.....(11 [#permalink]

### Show Tags

04 Nov 2009, 01:07
5
KUDOS
16
This post was
BOOKMARKED
00:00

Difficulty:

45% (medium)

Question Stats:

74% (08:57) correct 26% (01:49) wrong based on 269 sessions

### HideShow timer Statistics

What is the remainder when (1!)^3+ (2!)^3 + (3!)^3 +.....(1152!)^3 is divided by 1152?

1. 125
2. 225
3. 325
[Reveal] Spoiler: OA

Kudos [?]: 278 [5], given: 46

Math Expert
Joined: 02 Sep 2009
Posts: 41913

Kudos [?]: 129535 [12], given: 12201

### Show Tags

31 Jan 2010, 07:17
12
KUDOS
Expert's post
9
This post was
BOOKMARKED
jeeteshsingh wrote:
Is there a specific approach to tackle this?

No specific approach.

We have the sum of many numbers: $$(1!)^3+ (2!)^3 + (3!)^3 +...+(1152!)^3$$ and want to determine the remainder when this sum is divided by 1152.

First we should do the prime factorization of 1152: $$1152=2^7*3^2$$.

Consider the third and fourth terms:
$$(3!)^3=2^3*3^3$$ not divisible by 1152;
$$(4!)^3=2^9*3^3=2^2*3*(2^7*3^2)=12*1152$$ divisible by 1152, and all the other terms after will be divisible by 1152.

We'll get $$\{(1!)^3+ (2!)^3 + (3!)^3\} +\{(4!)^3+...+(1152!)^3\}=225+1152k$$ and this sum divided by 1152 will result remainder of 225.
_________________

Kudos [?]: 129535 [12], given: 12201

Intern
Affiliations: CA - India
Joined: 27 Oct 2009
Posts: 45

Kudos [?]: 780 [3], given: 5

Location: India
Schools: ISB - Hyderabad, NSU - Singapore

### Show Tags

04 Nov 2009, 04:19
3
KUDOS
The ans has to be 225. all the terms in the sequence after (3!)^3 are divisible by 1152 and hence remainder is 0. Upto (3!)^3, sum of all numbers, i.e. 1+8+216 = 225 which is the remainder!!

Kudos [?]: 780 [3], given: 5

Senior Manager
Joined: 22 Dec 2009
Posts: 356

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

### Show Tags

31 Jan 2010, 06:01
Is there a specific approach to tackle this?
_________________

Cheers!
JT...........
If u like my post..... payback in Kudos!!

|For CR refer Powerscore CR Bible|For SC refer Manhattan SC Guide|

~~Better Burn Out... Than Fade Away~~

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

Manager
Joined: 10 Feb 2010
Posts: 188

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

### Show Tags

12 Feb 2010, 18:45
Nice Explanation!

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

Manager
Status: I will not stop until i realise my goal which is my dream too
Joined: 25 Feb 2010
Posts: 223

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

Schools: Johnson '15

### Show Tags

14 Jul 2011, 03:13
Bunuel....+1 to you...
_________________

Regards,
Harsha

Note: Give me kudos if my approach is right , else help me understand where i am missing.. I want to bell the GMAT Cat

Satyameva Jayate - Truth alone triumphs

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

Manager
Joined: 14 Apr 2011
Posts: 193

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

### Show Tags

16 Jul 2011, 03:13
good question. Thanks Bunuel for sharing the approach for these problem!
_________________

Looking for Kudos

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

Intern
Joined: 23 May 2012
Posts: 31

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

Re: What is the remainder when (1!)^3+ (2!)^3 + (3!)^3 +.....(11 [#permalink]

### Show Tags

19 Oct 2012, 04:21
Did .. the same thing as Bunuel..

But took 8 minutes..

In actual exam.. I would have guessed and moved on

What is the source of this problem?

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

Manager
Joined: 14 Nov 2011
Posts: 145

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

Location: United States
Concentration: General Management, Entrepreneurship
GPA: 3.61
WE: Consulting (Manufacturing)

### Show Tags

18 Jul 2013, 06:20
Bunuel wrote:
jeeteshsingh wrote:
Is there a specific approach to tackle this?

No specific approach.

We have the sum of many numbers: $$(1!)^3+ (2!)^3 + (3!)^3 +...+(1152!)^3$$ and want to determine the remainder when this sum is divided by 1152.

First we should do the prime factorization of 1152: $$1152=2^7*3^2$$.

Consider the third and fourth terms:
$$(3!)^3=2^3*3^3$$ not divisible by 1152;
$$(4!)^3=2^9*3^3=2^2*3*(2^7*3^2)=12*1152$$ divisible by 1152, and all the other terms after will be divisible by 1152.

We'll get $$\{(1!)^3+ (2!)^3 + (3!)^3\} +\{(4!)^3+...+(1152!)^3\}=225+1152k$$ and this sum divided by 1152 will result remainder of 225.

Hi Bunnel,
To get the remainder, we dont have to reduce the fraction right?
That is we cant do - 225/1152 = 25/ 128 and get remainder 25?

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

Math Expert
Joined: 02 Sep 2009
Posts: 41913

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

### Show Tags

21 Jul 2013, 02:24
cumulonimbus wrote:
Bunuel wrote:
jeeteshsingh wrote:
Is there a specific approach to tackle this?

No specific approach.

We have the sum of many numbers: $$(1!)^3+ (2!)^3 + (3!)^3 +...+(1152!)^3$$ and want to determine the remainder when this sum is divided by 1152.

First we should do the prime factorization of 1152: $$1152=2^7*3^2$$.

Consider the third and fourth terms:
$$(3!)^3=2^3*3^3$$ not divisible by 1152;
$$(4!)^3=2^9*3^3=2^2*3*(2^7*3^2)=12*1152$$ divisible by 1152, and all the other terms after will be divisible by 1152.

We'll get $$\{(1!)^3+ (2!)^3 + (3!)^3\} +\{(4!)^3+...+(1152!)^3\}=225+1152k$$ and this sum divided by 1152 will result remainder of 225.

Hi Bunnel,
To get the remainder, we dont have to reduce the fraction right?
That is we cant do - 225/1152 = 25/ 128 and get remainder 25?

Yes, 225 divided by 1152 yields the remainder of 225. The same way as 2 divided by 4 yields the remainder of 2, not 1 (1:2).
_________________

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

GMAT Club Legend
Joined: 09 Sep 2013
Posts: 16539

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

Re: What is the remainder when (1!)^3+ (2!)^3 + (3!)^3 +.....(11 [#permalink]

### Show Tags

08 Aug 2014, 06:49
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.
_________________

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

Director
Joined: 23 Jan 2013
Posts: 601

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

Schools: Cambridge'16
Re: What is the remainder when (1!)^3+ (2!)^3 + (3!)^3 +.....(11 [#permalink]

### Show Tags

12 Aug 2015, 12:22
starting from 4!^3=24^3 all numbers are divisible by 1152, i.e. remainder equal to 0

Only 1!^3, 2!^3 and 3!^3 are not divisible by 1152 and have remainder equal to 1,8 and 216, respectively.

If sum numbers we can sum their remanders to find total remainder, which is 216+8+1+0=225

B

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

GMAT Club Legend
Joined: 09 Sep 2013
Posts: 16539

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

Re: What is the remainder when (1!)^3+ (2!)^3 + (3!)^3 +.....(11 [#permalink]

### Show Tags

26 Aug 2016, 23:31
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.
_________________

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

Re: What is the remainder when (1!)^3+ (2!)^3 + (3!)^3 +.....(11   [#permalink] 26 Aug 2016, 23:31
Display posts from previous: Sort by