Linear Combinations: Will Two Always Produce b=(0,1)?

porschedude
Messages
11
Reaction score
0
Will there always be two different combinations that produce b=(0,1) of three vectors: u, v, and w?

I'm pretty certain that the answer is no, but am I right in saying that with three vectors, assuming they are not all parallel, will always have at least one combination that produces (0,1)
 
Physics news on Phys.org
You've got that right. If you have three vectors in R^2 then either there are no combinations that produce (0,1) (if they are all parallel and not parallel to (0,1)) or there are an infinite number.
 
How can there be an infinite number?
 
porschedude said:
How can there be an infinite number?

Say u=(0,1), v=(1,0) and w=(1,1). There are an infinite number of solutions to the equation a*u+b*v+c*w=(0,1). You should be able to show that. It's maybe a little harder to show that if there is one solution, then there are an infinite number.
 
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