HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Python Labs
  2. /Matrix powers against a formula
MathematicsMediumHigh School (11–12)Mathematical Induction

Matrix powers against a formula

You will multiply 2×22 \times 22×2 matrices with plain Python, raise a matrix to a power, and test the formula

(3−41−1)n=(1+2n−4nn1−2n)\displaystyle \begin{pmatrix} 3 & -4 \\ 1 & -1 \end{pmatrix}^n = \begin{pmatrix} 1 + 2n & -4n \\ n & 1 - 2n \end{pmatrix}(31​−4−1​)n=(1+2nn​−4n1−2n​)

for many values of nnn. The lesson proves it by induction.

The idea. A matrix is a list of two rows, such as [[3, -4], [1, -1]]. The entry in row i and column j of a product PQPQPQ is the sum of P[i][t] * Q[t][j] over t = 0, 1.

Your tasks.

  1. Finish mult(P, Q). Return the product of two 2×22 \times 22×2 matrices.
  2. Finish power(A, n). Start from the identity matrix [[1, 0], [0, 1]] and multiply by A exactly n times.
  3. Finish formula(n). Return the matrix of the formula above.

Run it first, just as it is. The checker at the end prints FAIL for each task. Then do the tasks one at a time, and run the program again after each one. A Hint appears under every check that still fails.

When every line says PASS, test your own guess for the powers of [[1, 1], [1, 1]]. Print the first five powers and write the pattern.

StemPy LabContributed by StemPy Lab
python
Loading Python runtime…

A worked solution

Run your code once to unlock the worked solution.

Have you tried it?

Do the tasks in the editor first, and run the checker after each one. Its hints help when a check fails. When you are ready, compare your code with this solution.

Log in to save
← All Labs
← Fibonacci identities by computerThe Tower of Hanoi, move by move →
More onMathematical Induction

Discussion (0)

Log in to join the discussion.

Loading…

More labs on this topic

  1. The Tower of Hanoi, move by moveMedium
  2. Fibonacci identities by computerMedium
  3. Where an inequality starts to holdMedium
  4. Divisibility, value by valueMedium
  5. Test a formula, then find where a pattern breaksMedium
All labs on this topic →