You are not logged in.
I don't think your question is correct.
let V be a real n-dimensional vector space and let T:V-->V be a LT saisfying T(v)= - v for all v belongs to V.
1. show n is even
Have you left something out? This statement does not follow from just what you have stated.
PS: I found your mistake. You want T[sup]2[/sup](v)= −v for all v ∈ V.
I don't know if this method is acceptable but I suppose we could argue like this.
As the expression is now antisymmetrical in
and , we can let (so is as large as possible); thus we haveNow you can maximize
using normal calculus methods.
Then
This suggests that a basis for
is .All you have to do is to prove it.
NB: I've just shown that the set spans W; it remains for you to prove that it's linearly independent.
JUST TELL ME IF THERE IS ANYTHING WRONG IN THIS PROOF
Your proof looks fine to me.
(1)
Then
is an matrix. For , the th column of is and the th column of is . Hence any two columns of are linearly dependent. As is a nonzero matrix, it follows that its rank is 1.(2)
This is harder to prove. It is called Sylvester's inequality: http://www.artofproblemsolving.com/Foru … hp?t=43691.
My teacher gave me this problem and I can't figure it out.
Jn= J(n-1) + n, j1=2
I've gotten:
j1 = 2
j2 = 2 + 2
j3 = 2+3+2
j4 = 2+4+3+2
J5 = 2+5+4+3+2Did I do this right so far and is if so, where do I go from here?
So the equation has no real solutions in x (let alone integer ones).
Since the partial derivatives are continuous for all
and satisfy the CauchyRiemann equations and , is holomorphic on the complex plane.What is C?
Shouldn't it be
?I have a very weird solution; you probably won't like it but I'll have a go anyway.
Then
because .Let
.We find
(just). It follows that since the quadratic function is strictly increasing for positive x.The LHS is
and so we are done.Prove the following:
If:
where p are distinct prime numbers
Then:
It's obvious that if
and have no factor in common other than ±1, then .Also the factors of
are and so .Combining the two observations above gives the required solution.
Thanks for pointing out.
I've corrected the error in my post.
Hence the conjugacy class containing
is .Any n linearly independent vectors will span a subspace of dimension n.
Let's call the men A, B, C, and D. Their plan is as follows: A will go to Room 1, B to Room 2, C to Room 3, and D to Room 4. If a man does not see his own wife in the first room, he will then go to the room corresponding to the man whose wife he sees in the first room e.g. if A sees B's wife in Room 1, he opens Room 2 next; if it's C's wife he sees, he goes to Room 3 next, etc.
This strategy will improve their chances of finding the right wives in two attempts or fewer from 1/16 = 6.25% to 10/24 ≈ 41.67%.
I actually got help from quickmath.com, and then checked what did the result mean. The idea is to use what is called the Lambert W function, which, by definition (Wikipedia) allows to express any complex number as:
Then, for your equation you have to do:
But any number can be written using the W function, so:
By equating both expressions, then:
which actually has |z| = 1.3745, so the condition is satisfied.
This only proves that a solution exists. I think the OP wants to find all complex solutions of the equation.
This can be proved by induction. For the inductive step, note that
Hence, for this problem,