Question

Difficulty: HardProperties of Integers and Divisibility

If nn is a positive integer such that nn is divisible by 1212 and n2n^2 is divisible by 180180, what is the least possible value of nn?

  1. A
    30
  2. 60Answer
  3. C
    90
  4. D
    180
  5. E
    360

Answer

60
The correct answer is 60. The prime factorization of 12 is 22×312^2 \times 3^1, requiring nn to have at least two factors of 2 and one factor of 3. The prime factorization of 180 is 22×32×512^2 \times 3^2 \times 5^1. For n2n^2 to be divisible by 180, nn must contribute a factor of 5 (which becomes 525^2 in n2n^2). Multiplying the minimal prime factors yields 22×31×51=602^2 \times 3^1 \times 5^1 = 60.

Step-by-Step Solution

1
Analyze the prime factorization required for nn to be divisible by 12
Since 12=22×3112 = 2^2 \times 3^1, any positive integer nn divisible by 12 must contain at least 222^2 and 313^1 in its prime factorization.
An integer must contain all prime factors of its divisor with at least equal exponents.
2
Analyze the prime factorization required for n2n^2 to be divisible by 180
Since 180=22×32×51180 = 2^2 \times 3^2 \times 5^1, n2n^2 must contain at least 222^2, 323^2, and 515^1. Because n2n^2 doubles all prime exponents of nn, nn must contribute at least 515^1, which makes the factor of 5 in n2n^2 equal to 525^2.
The exponent of any prime factor in a perfect square n2n^2 must be even.
3
Combine the minimal prime factor requirements for nn
The minimum prime factorization for nn is 22×31×51=4×3×5=602^2 \times 3^1 \times 5^1 = 4 \times 3 \times 5 = 60.
Taking the minimum required power of each prime factor yields the smallest positive integer fulfilling both conditions.

Key Concept

Prime Factorization and Divisibility of Powers
Rate this question