I did that. he gave us a couple test examples, and they worked.
ALl we are to do is setup the main part of the program, and send the matrices to the functions.
i did tell you how i attempted it. I put it in the program, gave it the function, and that is what i got?
A = matrix of:
0 0
0 0
B = matrix of:
1 -1
0 3
a = matrix:
-2
4
b = matrix:
-1
7
and i solved for x,y . (which is done by passing the matrices to the functions that...
well, problem is, my work, is done by the computer.
my assignment is to do write the main program, use matrices, and get the answer, with given functions (that teacher provided).
all we have to do, is pass the functionthe matrices, and get the PA=LU factorization, and the solve using front and...
I have 2 equations, imaginary ones, and 2 unknowns....trying to solve for them..but the answer i got, works with one, but not the other:
i*Z1 - i*Z2 = -2 - i
Z1 + 3i*Z2 = 4 + 7i
where i is the imaginary number, and Z1 and Z2 are the 2 unknowns
the answer i got:
Z1 : 1.33333 +...
so maybe I can use the fact that if I can draw a geometric dual graph, then it is planar ... so I Just have to prove that I can't draw one?
man, i HATE proofs
ok, here is the question:
Let G be a graph with minimal degree \delta(G) = 5, but suppose there exists only one vertex v\in V_{G} such that d(v) = \delta(G). Prove that G is not planar.
ok, i can do this visually. if i draw the vertex v and its edges to its points, and then draw points...
strong primality test ... ??
ok, bear with me ...
we learned weak primality tests (given n and base a,::: a^(n-1) mod n ::: if it does not equal 1, then its composite, if it equals 1, then MAYBE prime) ...
then we learned strong primes .... think of n-1 = m2^k when m is odd. test ::: a^m...
another question.
what is the independent number/set ?
http://mathworld.wolfram.com/IndependentSet.html
looking at that, and a problem from my homework which the answer is 4:
http://www.nevada.edu/%7Ebaragar/courses/MAT351ex2sample.pdf [Broken]
problem # 1b finding the...