EdiShorts

UPSC Prelims 2024 CSAT Q54 · Numeracy

Year2024
PaperCSAT
QuestionQ54
SubjectNumeracy

32^5 + 2^27 is divisible by

  1. a3
  2. b7
  3. c10
  4. d11
Show answer & explanationHide answer
Correct answer(c) 10

32^5 + 2^27 simplifies to 2^25 × 5, which equals 2^24 × 10 and is thus directly divisible by 10.

Statement-by-statement analysis

✗ Option (a)
  • Simplifying the expression yields 2^25 × 5.
  • Using modular arithmetic modulo 3, 2^25 is equivalent to (-1)^25 which equals -1 or 2 mod 3.
  • Thus 2^25 × 5 is equivalent to 2 × 5 = 10, which leaves a remainder of 1 mod 3, so it is not divisible by 3.
✗ Option (b)
  • Simplifying the expression yields 2^25 × 5.
  • Using modular arithmetic modulo 7, 2^3 is equivalent to 1 mod 7, so 2^25 = (2^3)^8 × 2 is equivalent to 2 mod 7.
  • Thus 2^25 × 5 is equivalent to 2 × 5 = 10, which leaves a remainder of 3 mod 7, so it is not divisible by 7.
✓ Option (c)
  • Convert 32 to base 2, giving 32^5 = (2^5)^5 = 2^25.
  • Factor out 2^25 from the expression: 2^25 + 2^27 = 2^25 × (1 + 2^2) = 2^25 × 5.
  • Rewrite 2^25 × 5 as 2^24 × (2 × 5) = 2^24 × 10, which is clearly divisible by 10.
✗ Option (d)
  • Simplifying the expression yields 2^25 × 5.
  • Using modular arithmetic modulo 11, 2^5 = 32 is equivalent to -1 mod 11, so 2^25 = (-1)^5 is equivalent to -1 or 10 mod 11.
  • Thus 2^25 × 5 is equivalent to 10 × 5 = 50, which leaves a remainder of 6 mod 11, so it is not divisible by 11.

Concept to know

  • Convert terms with composite bases to a common prime base using exponent identities such as (a^m)^n = a^(m×n).
  • Factor out the highest common term from exponential sums using a^m + a^(m+k) = a^m × (1 + a^k).
  • Check for divisibility by verifying if all prime factors of the divisor are present in the factored product.
  • A number is divisible by 10 if its prime factorization contains at least one factor of 2 and at least one factor of 5.
  • Modular arithmetic can be used to quickly determine remainder when direct factor check is insufficient.

Related facts for revision

  • Finding the unit digit of exponential expressions using cyclicity of unit digits.
  • Divisibility rules based on algebraic identities like a^n + b^n being divisible by a + b for odd n.
  • Finding remainders for large exponential numbers divided by a non-factor using Binomial Theorem.
  • Determining the number of trailing zeros by counting the minimum powers of 2 and 5.
How UPSC tests this

Simplification of powers of numbers by prime factorization and taking out common terms.

Trap: Attempting to compute actual large values or calculating unit digits separately instead of taking out common factors.

More Numeracy PYQs

All Numeracy questions →

Answer from the official UPSC answer key. Explanation by the EdiShorts editorial team.