Please solve the following modular operations. 113 (mod 7) = Enter the prime factorisation (in exponent...

   

Transcribed Image Text:

Please solve the following modular operations. 113 (mod 7) = Enter the prime factorisation (in exponent form) of 600. Using the information above, enter the gcd and the lcm of 600 and 13125. gcd (600,13125)= Icm (600,13125) = Show steps (You will lose 1 mark.) Convert 5454 from base 9 to base 10. 54549 = 10 Modular Arithmetics Please solve the following modular operations. -116 (mod 12) = Show steps (Your score will not be affected.) Modular Arithmetics Please solve the following modular operations. Modular Arithmetic Find a number between 297 and 305 which satisfies this equation: (mod 9) = 2 Show steps (Your score will not be affected.) Modular Arithmetics Please solve the following modular operations. Modular Arithmetic Find a number which satisfies this equation: 98 (mod )=3 Euclidean Algorithm Apply the Euclidean algorithm to find the greatest common denominator between 1148 and 364 Part a) Algorithm Enter the matrix Rows: 1 + Part b) gcd gcd (1148,364)= Part c) LCM Lowest Common Multiple Use the information above to calculate the lowest common multiple between 1148 and 364. Icm(1148,364)= Show steps (You will lose 1 mark.) Answer: Submit all parts Unanswered Submit part Unanswered Submit part Unanswered Please solve the following modular operations. 113 (mod 7) = Enter the prime factorisation (in exponent form) of 600. Using the information above, enter the gcd and the lcm of 600 and 13125. gcd (600,13125)= Icm (600,13125) = Show steps (You will lose 1 mark.) Convert 5454 from base 9 to base 10. 54549 = 10 Modular Arithmetics Please solve the following modular operations. -116 (mod 12) = Show steps (Your score will not be affected.) Modular Arithmetics Please solve the following modular operations. Modular Arithmetic Find a number between 297 and 305 which satisfies this equation: (mod 9) = 2 Show steps (Your score will not be affected.) Modular Arithmetics Please solve the following modular operations. Modular Arithmetic Find a number which satisfies this equation: 98 (mod )=3 Euclidean Algorithm Apply the Euclidean algorithm to find the greatest common denominator between 1148 and 364 Part a) Algorithm Enter the matrix Rows: 1 + Part b) gcd gcd (1148,364)= Part c) LCM Lowest Common Multiple Use the information above to calculate the lowest common multiple between 1148 and 364. Icm(1148,364)= Show steps (You will lose 1 mark.) Answer: Submit all parts Unanswered Submit part Unanswered Submit part Unanswered