#math - Sat 14 Apr 2007 between 00:03 and 04:31

Steve|OfficeIf I have an n-dimensional parallelpiped with volume greater than d^n *vol(unit hypersphere), how do I show that there is a point inside the parallelpiped such that the distance from the point to all of the vertices is greater than d?
_kmh_Kasadkad : still there ?
_kmh_Kasadkad : i figured a rather easy way for my problem earlier 10^(log_10(100!)-floor(log_10(100!)))
jadenbaneIs this an integral in a form I don't recognize: lim n->oo pi/n * (sin(pi/n) + sin(2pi/n) + sin(3pi/n) + ... + sin((n-1)pi/n)
Kasadkad_kmh_: yeah, that's why I was suggesting taking the log
_kmh_Kasadkad : i hadn't thought of logs before since i was tinkering with integer computations
actually it is floor(10^(log_10(100!)-floor(log_10(100!))))
SeveredCrossHow many odd numbers between 1 and 123?
I'm too lazy to figure it out.
HiLanderhalf of the numbers in 1,2,3,...,122 are odd
that's 61.
add 1 for 123
to get 62
My brain is in shut-off mode right now.
HiLanderit happens
Steve|OfficeI think I got it.
_kmh_Steve|Office : congrats
jadenbaneIs there a relationship between null(A^t) and the other fundamental subspaces?
SeveredCrossCan someone recommend a good book to read to learn Haskell?
john_sheuSeveredCross: try this: http://www.imdb.com/name/nm0368125/bio
ailndxhttp://www.amazon.com/Programming-Haskell-Graham-Hutton/dp/0521692695/ref=pd_bbs_sr_1/103-9101360-4690251?ie=UTF8&s=books&qid=1176525228&sr=8-1 this one maybe, but ask in #haskell
there is some descent web resources i think also
SeveredCrossThe Wikibook seems like a good very basic intro.
That book looks pretty good...I may see if the university library has it
ailndxits pretty new
but yes the wikibook should be a descent start
chadmaynardhi. What would the method be to find a GCD between a set of numbers with more than 2 elements?
trying to write a function to do this but can't think of the actual method
i mean i know what induction is but i don't have a great grasp on the conept
john_sheujust iteratively find the GCD between element 1 and 2, then between that and 3, then that and 4, etc...
as for the GCD algorithm itself, I think you're looking for Euclid's algorithm
chadmaynardjohn_sheu: thanks. I just figured it out. Should have played more before askin. Thanks a lot though!
AnotherIndividuahello all
john_sheuI don't see this "all" character you refer to

Page: 2 9 16 23 30