Matrix over Z7 needs revision please

  • Thread starter Thread starter JPanthon
  • Start date Start date
  • Tags Tags
    Matrix Revision
JPanthon
Messages
20
Reaction score
0

Homework Statement



Solve

-x1 + 6x2 -2x3 = 0
5x1 + x2 + 2x3 = 0

over Z7

Additional Question: How can we immediately tell there is more than one solution?

Homework Equations

Don't know.

The Attempt at a Solution



[-1 6 -2 0]_________[ (-1mod7) 6 (-2mod7) 0]
[5 1 2 0] _____=> [____5_____1____2_____0]=> [1 6 2 0] (-5R1 + R2) => [1_____6__________2_____0]
____[5 1 2 0] ________________[0___-29mod7___-8mod7___0]

=> [1 6 2 0]________(-6R2 + R1) => [1 0 4 0]
____[0 1 1 0]______________________[0 1 1 0]
So the solution set is {(-4x3, -x3, x3) : x3 element of Z7}How does this look?
Sorry if it's messy! I did my best
 
Physics news on Phys.org
Just realized how ugly it looks!
Sorry, just ignore the underscores and pretend that they are spaces.
Or if you could tell me how to make better matrices on the computer I would be happy to redo my post!
 
JPanthon said:
Just realized how ugly it looks!
Sorry, just ignore the underscores and pretend that they are spaces.
Or if you could tell me how to make better matrices on the computer I would be happy to redo my post!

Post #3 in this LaTeX thread shows a matrix. You can use the "Quote" button on it to see the LaTeX source that was used to make it.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top