If you have any questions, ask them on the Beat The GMAT discussion forums. The average response time is typically __less than 30 minutes__.

- Video Course
- Video Course Overview - READ FIRST
- General GMAT Strategies - 7 videos (all free)
- Data Sufficiency - 16 videos (all free)
- Arithmetic - 38 videos (some free)
- Powers and Roots - 36 videos (some free)
- Algebra and Equation Solving - 73 videos (some free)
- Word Problems - 48 videos (some free)
- Geometry - 42 videos (some free)
- Integer Properties - 38 videos (some free)
- Statistics - 20 videos (some free)
- Counting - 27 videos (some free)
- Probability - 23 videos (some free)
- Analytical Writing Assessment - 5 videos (all free)
- Reading Comprehension - 10 videos (all free)
- Critical Reasoning - 38 videos (some free)
- Sentence Correction - 70 videos (some free)
- Integrated Reasoning - 17 videos (some free)

- Study Guide
- Office Hours
- Extras
- Guarantees
- Prices

## Comment on

Squares of Integers## Hi Brent,

Could you please help solve this question using your methods?

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

## You bet!

You bet!

You'll find my step-by-step solution here: https://gmatclub.com/forum/if-n-is-a-positive-integer-and-n-2-is-divisib...

Cheers,

Brent

## Hi Brent,

Regarding this question: How many positive divisors of 12,500 are squares of integers (aka perfect squares)?

A) three

B) four

C) six

D) eight

E) twelve

Is my following deduction true, or was I simply lucky to obtain the right answer?

My thinking below:

We can find the Prime Factors of 12 500 which are 5^5 and 2^2.

The question asks to obtain the number of positive, perfect square divisors of 12, 500. To do so, we must apply the rule that "The Prime Factorization of a perfect square will have an even number of each prime".

Given this rule, we can see that the PFs of 12 ,500 = (5^5) (2^2). However, it is clear that 5^5 is ODD, which means that the number of positive, perfect square divisors of 12, 500 must be even. Therefore we can infer that the correct answer must be the next best EVEN pair of Prime Factors, that being: (5^4) (2^2).

This gives us a total of 6 numbers if we add the exponents.

Appreciate the help!

## Unfortunately, it was only a

Unfortunately, it was only a coincidence that adding the exponents of (5^4)(2^2) yielded the correct answer.

Notice that, if we were to determine how many divisors of (5^4) are squares of integers, we'd conclude (using your approach) that there are 4 such divisors, while there are actually only 3.

Likewise, if we were to determine how many divisors of (2^2)(3^2)(5^2) are squares of integers, we'd conclude (using your approach) that there are only 6 such divisors, while there are actually 8.

Cheers,

Brent

## Add a comment