Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

a. Define the matrix 2 M=| 1 1-1 1 3 -3 1 21. 5 Verify (by computing both ways) that inverting M, then reducing modulo

image text in transcribed
a. Define the matrix 2 M=| 1 1-1 1 3 -3 1 21. 5 Verify (by computing both ways) that inverting M, then reducing modulo 2, gives the same result as reducing modulo 2, then computing the mod-2 inverse. (Hint: you can ensure you are getting the mod-2 inverse by casting the matrix entries into IntegerModRing (2).) In [ ]: b. Find all primes p for which the reduction of M modulo p does not have an inverse. Justify your answer. In [ ]: c. Test your answer to b by reducing M modulo each prime p that you listed and confirming that the result does not have a mod-p inverse. In [ ]: a. Define the matrix 2 M=| 1 1-1 1 3 -3 1 21. 5 Verify (by computing both ways) that inverting M, then reducing modulo 2, gives the same result as reducing modulo 2, then computing the mod-2 inverse. (Hint: you can ensure you are getting the mod-2 inverse by casting the matrix entries into IntegerModRing (2).) In [ ]: b. Find all primes p for which the reduction of M modulo p does not have an inverse. Justify your answer. In [ ]: c. Test your answer to b by reducing M modulo each prime p that you listed and confirming that the result does not have a mod-p inverse. In [ ]

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

More Books

Students also viewed these Databases questions

Question

identify current issues relating to equal pay in organisations

Answered: 1 week ago