I want to see different approaches to this problem If n : PS Archive
Check GMAT Club App Tracker for the Latest School Decision Releases http://gmatclub.com/AppTrack

 It is currently 08 Dec 2016, 16:12

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

# I want to see different approaches to this problem If n

Author Message
Manager
Joined: 28 Dec 2005
Posts: 117
Followers: 1

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

I want to see different approaches to this problem If n [#permalink]

### Show Tags

22 Apr 2006, 08:44
00:00

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 sessions

### HideShow timer Statistics

This topic is locked. If you want to discuss this question please re-post it in the respective forum.

I want to see different approaches to this problem

If n is a positive integer and n^2 is divisible by 72, then the largest positive integer that must divide n is.

A. 6
B. 12
C. 24
D. 36
E. 48
Intern
Joined: 19 Feb 2006
Posts: 46
Followers: 1

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

### Show Tags

22 Apr 2006, 09:50
B.

72 = 9 * 8 = 3^2 * 2^2* 2

Hence the largest possible interger = 3 * 2 * 2 = 12
Display posts from previous: Sort by