Start Learning Free

Before You Begin

Question #41237

Difficulty: 8/10 | 🟢 Free

The Question

Let MM be a 50×5050 \times 50 matrix whose entries are given by Mi,j=∑k=1min⁡(i,j)(2k)!k!(ik)(jk)M_{i,j} = \sum_{k=1}^{\min(i,j)} \frac{(2k)!}{k!} \binom{i}{k} \binom{j}{k} for 1≤i,j≤501 \le i, j \le 50. Find the maximum integer EE such that 3E3^E divides det⁡(M)\det(M).

Options

  • A.

    623

  • B.

    552

  • C.

    1175

  • D.

    601

Check Your Answer

Correct Answer

Step-by-Step Solution

Explanation

How the Examiner Thinks

Specialist

Targeted practice for niche, high-difficulty concepts that frequently appear in JEE Advanced exams.

Concepts Behind This Question

Inversion and Determinant Product|Sigma Notation Properties|Exponent of Prime in n!

Why This Question Is Tricky

Common Mistakes

This question constructs a 'Lethal Collision' between Linear Algebra and Number Theory.

The primary trap lies in the summation definition of the matrix entries, which students often attempt to simplify using row operations or telescopic sums, leading to a massive time sink.

The intended path requires recognizing the matrix as a product ADATA D A^T, where AA is a lower triangular Pascal matrix with determinant 1.

Once reduced to the determinant of the diagonal matrix DD, the problem shifts to Number Theory.

A secondary trap occurs when applying Legendre's formula: students frequently miscalculate the exponent of a prime in a product of factorials by incorrectly swapping summations or miscounting the modulo remainders for ⌊2k/3j⌋\lfloor 2k/3^j \rfloor.

Quick Facts About This Question

Question Information

SubjectMathematics
ChapterMatrices - Class 12
ConceptInversion and Determinant Product
Difficulty8
Cognitive Load7
Target Solve Time160 sec
AccessFree