Share this thread: 
#1
Apr1305, 10:03 AM

Emeritus
Sci Advisor
PF Gold
P: 11,155

A Q&A game is simple: One person asks a relevant question (it can be research, calculation, a curiosity, something offthetopofthehead, anything ... as long as it's a math question) and other people try to answer. The person who posts the first correct answer (as recognized by s/he who asked the question) gets to ask the next question, and so on.
Let me start this off with a simple number theory problem : What is the least number than must be multiplied to 100! (that's a factorial) to make it divisible by [itex]12^{49} [/itex] ? (throw in a brief couple of lines or so explanation with the answer) 


#2
Apr1305, 12:12 PM

P: 617

1/(99!*50)



#3
Apr1305, 12:22 PM

Emeritus
Sci Advisor
PF Gold
P: 11,155

Not correct. "Multiplying" by your number gives a "product" of 2 (=100!/50*99!), and 2 is not divisible by 12^{49}.



#4
Apr1305, 12:24 PM

P: 617

Math Q&A Game
i think i read it backwards...



#5
Apr1305, 12:36 PM

Sci Advisor
HW Helper
P: 9,398

There are 50 factors of 100 divisibile by 2, 25 by 4, 12 by 8, 6 by 16, 3 by 32 1 by 64 so the power of two in 100! is 97.
similiarly there are 33 div by 3, 11 by 9, 3 by 27 and 1 by 81 making 48 times 3 divides, so i guess 2*3^50 will do 


#6
Apr1305, 01:09 PM

Emeritus
Sci Advisor
PF Gold
P: 11,155

You've shown that 100! has 2^{97} * 3^{48}. And what happened after that ? In any case : Next question is yours ... 


#7
Apr1305, 01:15 PM

Sci Advisor
HW Helper
P: 9,398

Duh, do i feel stupid from typing too quickly whilst someone is talking to me. should have been 6.
Willl think of a question later tonight. 


#8
Apr1305, 01:35 PM

Sci Advisor
HW Helper
P: 9,398

Ok, here's one that I hope isn't too tricky.
Let A be an nxn matrix over C, the complexes. Suppose that Tr(A^r)=0 for all r. Show A is nilpotent. All the other ones I could think of were too easily looked up. 


#9
Apr1305, 03:45 PM

Sci Advisor
HW Helper
P: 3,684




#10
Apr1305, 03:54 PM

Emeritus
Sci Advisor
PF Gold
P: 11,155

Yes, CRG : matt clarified this in his subsequent post. Thanks !
Back to matt's question : 


#11
Apr1305, 04:09 PM

Sci Advisor
HW Helper
P: 9,398

If there's no progress on this after a couple of days i'll post hints. perhaps people should post what they think they need to do. i like tyhe question cos it uses lots of bits from here there and everywhere.



#12
Apr1305, 06:08 PM

P: 127

Well it seems that first you need to show that such a matrix does not have n distinct eigenvectors and then show that not having n distinct eigenvectors implies nilpotents.
The first question relates to the fact that if a matrix had a full set of Eigenvectors then diagonalization gives us that [tex]\sum \lambda_i^n =0 [/tex] for all n>0. For the second half I would gather you need to consider the vectors not in the span of the Eigenvectors and consider where they may be mapped. hmmm... that may not be enough for the first half. You may need to also show that any vector that is a eigenvector is in fact in the kernel. Experimentally it appears like we are dealing with upper or lower triangular matrix if you just assume Tr(A^r) =0 for r=1..n. But that could just be maple not returning all possible answers which it sometimes does. That's what I've been thinking 


#13
Apr1305, 06:32 PM

Emeritus
Sci Advisor
PF Gold
P: 16,099

Hrm.
If a matrix A is diagonalizable, then I claim that there exists an n such that all of the nonzero eigenvalues of A^{n} lie in the right halfplane. The requirement that Tr(A^{n}) = 0, forces all the eigenvalues to be 0, and thus A is zero... clearly nilpotent! So the trick, then, is when the matrix is not diagonalizable. Then again, this only works for complex valued matrices. 


#14
Apr1405, 04:08 AM

Sci Advisor
HW Helper
P: 9,398

I did state the matrix was over C, though this is largely for conveniece.
And, snobel, the matrix 0 has a full set of eigen values and is certainly nilpotent an satisfies the criterion. 


#15
Apr1405, 07:40 AM

P: 127

Oops... of course that is the sole matrix with a full set of 0 eigenvalues and [tex]\lambda_i=0[/tex] is the sole set of solutions in C satisfying my condition.



#16
Apr1405, 10:12 AM

Sci Advisor
P: 2,751

Ok so here's my QA puzzle : Why is it that mathematicians are worse than the general layperson when it comes to not specifying that they require a whole number solution when that is the case. :p 


#17
Apr1405, 10:59 AM

Sci Advisor
HW Helper
P: 9,398

If you're going to take that attitude, there is no answer; think negatives.



#18
Apr1405, 11:04 AM

Sci Advisor
HW Helper
P: 1,995




Register to reply 
Related Discussions  
Help with game theory (specific knowledge in game theory probably not required)  Calculus & Beyond Homework  4  
Fun math game  General Discussion  20  
Math guessing game.  General Math  33  
GROOVY math game  General Discussion  17 