Explore BrainMass
Share

Solving Congruences

This content was STOLEN from BrainMass.com - View the original, and get the already-completed solution here!

Solve the congruence of 2x ≡ 7 (mod 17)

© BrainMass Inc. brainmass.com October 24, 2018, 8:40 pm ad1c9bdddf
https://brainmass.com/math/discrete-optimization/solving-congruences-103789

Solution Preview

Solution: As 2x ≡ 7 (mod 17) , we can have
2x=7+17k
where k is any ...

Solution Summary

A congruence is solved in this solution.

$2.19
See Also This Related BrainMass Solution

Discrete Mathematics : Integer Algorithms, GCD, Solving Congruences and Diagonal Matrices

4. Describe an algorithm that takes as input a list of n integers and produces as output the largest difference between consecutive integers in the list.

Integers
28. What is the greatest common divisors of these pairs of integers?
a) 22 * 33 * 55, 25 * 33 * 52
b) 2 * 3 * 5 * 7 * 11 * 13, 211 * 39 * 11 * 1714
c) 17, 1717
d) 22 * 7, 53 * 13
e) 0, 5
f) 2 * 3 * 5 * 7, 2 * 3 * 5 * 7

Number Theory
18. Find all solutions to the system of congruences.
x = 2(mod 3)
x = 1(mod 4)
x = 3(mod 5)

Matrices
14. The n x n matrix A = [aij] is called a diagonal matrix if aij = 0 when i ≠ j. Show that the product of two n x n diagonal matrices is again a diagonal matrix. Give a simple rule for determining this product.

For each topic, demonstrate a knowledge and capability by giving the following information:

1) Problem Solution: (solution for an even number problem) see below...

2) Personal Observation: (personal comment on the topic including advice to others on how to study and understand it).

View Full Posting Details