Soru

Zorluk: OrtaProperties of Integers and Divisibility

If nn is a positive integer such that n2n^2 is divisible by 72, what is the smallest possible value of nn?

  1. A
    6
  2. 12Cevap
  3. C
    18
  4. D
    24
  5. E
    36

Cevap

12
The prime factorization of 72 is 23×322^3 \times 3^2. For n2n^2 to be a multiple of 72, the prime factorization of n2n^2 must contain at least three factors of 2 and two factors of 3. Since n2n^2 is a perfect square, the exponents of all prime factors in n2n^2 must be even. Therefore, the exponent of 2 in n2n^2 must be at least 4, making the minimum value of n2n^2 equal to 24×32=1442^4 \times 3^2 = 144. Taking the square root yields n=12n = 12, which is the smallest positive integer.

Adım Adım Çözüm

1
Find the prime factorization of 72.
72=23×3272 = 2^3 \times 3^2.
Decomposing 72 into prime factors reveals the minimum prime factor requirements for n2n^2.
2
Determine the prime factorization required for n2n^2.
For n2n^2 to be divisible by 23×322^3 \times 3^2, its prime factorization must contain at least three factors of 2 and two factors of 3. Because n2n^2 is a perfect square, all exponents in its prime factorization must be even numbers. Thus, n2n^2 must contain at least 24×32=1442^4 \times 3^2 = 144.
Exponents of prime factors in any perfect square must be even integers.
3
Take the square root to find the minimum value of nn.
n=24×32=22×31=12n = \sqrt{2^4 \times 3^2} = 2^2 \times 3^1 = 12.
The smallest positive integer nn must equal the square root of the minimal perfect square multiple of 72.

Anahtar Kavram

Prime Factorization and Divisibility of Perfect Squares
Bu soruyu puanla