Number Theory and Pattern Puzzles Short Notes for XAT: Concepts, Formulas, Worked Examples & Practice

    Number Theory and Pattern Puzzles short notes for XAT: 1 study cards covering concepts, formulas, shortcuts and exam traps, plus solved practice questions.

    Final Exam Strategy & Cheat Sheet

    Final Exam Strategy & Cheat Sheet
    Factors & Divisibility
    Total factors of is .
    Sum of factors uses the geometric series formula.
    HCF vs LCM
    HCF = Intersection of primes (lowest powers). Used for "Maximum" / "Largest".
    LCM = Union of primes (highest powers). Used for "Minimum" / "Smallest" / "Syncing".
    (Only for 2 numbers).
    Remainders & Cyclicity
    Use negative remainders for bases close to the divisor.
    Cyclicity of unit digits: ; ; .
    Factorials
    Trailing zeros in = Highest power of in .
    Pattern Puzzles
    Cyclic operations: Simulate Find Loop Modulo.
    Coprime in range : Count primes .
    Max GCD with sum : and divides .

    Number Theory and Pattern Puzzles: Solved Questions with Step-by-Step Explanations (2 Problems)

    Question 1 · Quantitative Aptitude and Data Interpretation (QA & DI) MCQ

    For which of the following sets of three positive integers will the incorrect formula accidentally yield the correct product?

    1. A.

      {2, 3, 4}

    2. B.

      {2, 3, 6}

    3. C.

      {3, 4, 1}

    4. D.

      {2, 4, 8}

    Correct Answer:

    C

    Step-by-Step Solution

    Key idea: This is a Cheat Sheet / Strategy question testing the boundary of the formula .

    Step 1: Recall the rule.

    The formula is ONLY valid for TWO numbers. For three numbers, it is generally false.

    Step 2: Test the options to find the exception.

    We need a set where .

    Option A: {2, 3, 4}

    HCF = 1, LCM = 12. Product = 24. Formula = 12. (False)

    Option B: {2, 3, 6}

    HCF = 1, LCM = 6. Product = 36. Formula = 6. (False)

    Option C: {3, 4, 1}

    HCF = 1, LCM = 12. Product = 12. Formula = 1 * 12 = 12. (True!)

    Option D: {2, 4, 8}

    HCF = 2, LCM = 8. Product = 64. Formula = 16. (False)

    Step 3: Understand why C works.

    When one of the numbers is 1, the HCF of the set becomes 1.

    The LCM of the set becomes the LCM of the other two numbers.

    So the formula gives .

    The actual product is .

    These are equal if and only if , which happens when and are coprime.

    In {3, 4, 1}, 3 and 4 are coprime.

    Answer: {3, 4, 1}.

    Question 2 · Quantitative Aptitude and Data Interpretation (QA & DI) MCQ

    Let be the number of trailing zeros of when expressed in base 6. How many positive integers satisfy the condition that is a perfect square?

    1. A.

      12

    2. B.

      14

    3. C.

      16

    4. D.

      18

    Correct Answer:

    B

    Step-by-Step Solution

    Key idea: This is a synthesis of Legendre's formula for trailing zeros in a non-decimal base and perfect square constraints. We must first determine the formula for in base 6, then count how many yield a perfect square result.

    Step 1: Determine for base 6.

    Base . The number of trailing zeros is determined by the limiting prime factor in the prime factorization of .

    The exponent of a prime in is .

    For base 6, we need pairs of . Since 3 is larger than 2, for all . Thus, the number of trailing zeros is determined by the exponent of 3.

    Step 2: Analyze the range .

    We need to find such that for some integer .

    Let's estimate the maximum value of .

    .

    So possible perfect squares for are (but max is 48, so up to 36).

    Step 3: Count for each perfect square value .

    Note that is a non-decreasing step function. It stays constant for intervals of 3, except at multiples of 9, 27, etc., where it jumps more.

    • : . (2 values)
    • : .

    .

    .

    .

    .

    So . (3 values)

    • :

    Check around .

    .

    .

    .

    .

    So . (3 values)

    • :

    Check around ? No, approx is too high because of higher powers.

    Let's test values.

    .

    .

    .

    .

    .

    .

    .

    .

    .

    So . (3 values)

    • :

    .

    .

    .

    .

    .

    .

    So . (3 values)

    • :

    .

    .

    .

    .

    .

    .

    .

    .

    .

    .

    So . (3 values)

    • :

    .

    .

    .

    (Jump!).

    Wait, let's check near 81 carefully.

    .

    .

    ? No. . . . Sum = 36.

    .

    So . (3 values)

    Total count = ?

    Let me re-evaluate . . Correct.

    Let me re-evaluate ranges.

    Usually, for large , increases by 1 every 3 numbers, but jumps by extra amounts at multiples of 9, 27, etc.

    The number of solutions for is typically 3, unless is hit exactly at a jump point where it might skip or have fewer/more.

    Actually, takes every integer value?

    . (2 vals)

    . (3 vals)

    . (3 vals)

    . Skips 3.

    So has 0 solutions.

    . (3 vals for 4? No, too. So 9,10,11. 3 vals).

    . (3 vals).

    . (3 vals).

    . Skips 7.

    . ( too. So 18,19,20. 3 vals).

    . (3 vals).

    Squares: 0, 1, 4, 9, 16, 25, 36.

    Values skipped: 3, 7, ...

    Are any squares skipped?

    Sequence of Z(N): 0,0, 1,1,1, 2,2,2, 4,4,4, 5,5,5, 6,6,6, 8,8,8, 9,9,9...

    Squares present:

    0: Yes (2 values)

    1: Yes (3 values)

    4: Yes (3 values)

    9: Yes (3 values)

    16: Yes (3 values)

    25: Yes (3 values)

    36: Yes (3 values)

    Next square 49. . ? No.

    .

    .

    ? . Sum=49.

    But . So 49 is not reached.

    Total = .

    Wait, did I miss any?

    Options are 12, 14, 16, 18. My count 20 is not an option.

    Let me re-read carefully. "Positive integers ".

    Did I calculate correctly?

    Base 6. Limiting factor 3.

    .

    Let's re-verify the "skipped" values.

    Jumps occur at multiples of 9 (jump +1 extra), 27 (jump +1 extra), 81 (jump +1 extra).

    Normal increase is +1 every 3 N.

    At , . Jumped 3.

    At , . Jumped 7.

    At , .

    ? No.

    .

    . Jumped 11, 12.

    Squares:

    0: . (2)

    1: . (3)

    4: . (3)

    9: . (3)

    16: . (3)

    25: . (3)

    36: . (3)

    Is it possible that some squares are skipped?

    Let's check 16 again.

    .

    ?

    . . . Sum=17.

    Ah! .

    .

    So 16 is SKIPPED.

    Let's check 25 again.

    ?

    . . . Sum=26.

    ?

    . . . Sum=26.

    ?

    . . . Sum=26.

    .

    So 24, 25 are SKIPPED.

    Let's check 36 again.

    .

    .

    .

    .

    .

    So 36 is HIT. (3 values: 78, 79, 80).

    Let's check 4, 9, 1, 0 again.

    0: Hit.

    1: Hit.

    4: Hit.

    9: Hit.

    16: Skipped.

    25: Skipped.

    36: Hit.

    Total = .

    Answer: 14

    More short notes in this unit

    chapter
    Number Theory and Pattern Puzzles Short Notes for XAT: Concepts, Formulas, Worked Examples & Practice

    Number Theory and Pattern Puzzles short notes for XAT: 1 study cards covering concepts, formulas, shortcuts and exam traps, plus solved practice questions.

    A question from this chapter

    Question 1

    For which of the following sets of three positive integers will the incorrect formula accidentally yield the correct product?

    Question 2

    Let be the number of trailing zeros of when expressed in base 6. How many positive integers satisfy the condition that is a perfect square?

    Free preview ends here

    Login to view the complete short notes

    Creating an account is free. You get the rest of this chapter, step-by-step solutions, and a study plan built around the topics you are actually weak at.

    Why MastersUp

    Personalised first. High quality throughout.

    Most platforms hand everyone the same content. Here the content moves with your performance, topic by topic.

    Built around you, not around a syllabus PDF

    Every answer you give moves your topic-level intelligence rate. The next question, the next revision card and tomorrow's plan all change with it.

    Revision that hits your weak spots

    We only revise topics you have actually attempted and are still below the safe bar on — never the same chapter on repeat.

    Questions calibrated to the real exam

    Each question carries a measured toughness. You are served a rung above your current level, so practice keeps stretching you.

    Notes written for recall, not for volume

    Full lesson cards for first study, curated short-note cards for the last mile — with derivations, traps and exam patterns marked.

    One place for everything

    Notes, chapter practice, previous-year questions, test series and full-length papers — all feeding one picture of your preparation.

    Honest progress

    No vanity streaks. Progress here means chapters mastered and accuracy that held up on harder questions.

    Unlock the whole course

    Full notes and short notes, the complete question bank with worked solutions, mock tests, full-length papers, and an adaptive plan that rebuilds itself as you improve.