Steve|Office | If 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 ? |

Kasadkad | yeah |

_kmh_ | Kasadkad : i figured a rather easy way for my problem earlier 10^(log_10(100!)-floor(log_10(100!))) |

jadenbane | Is 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!)))) |

SeveredCross | How many odd numbers between 1 and 123? I'm too lazy to figure it out. |

HiLander | half of the numbers in 1,2,3,...,122 are odd that's 61. add 1 for 123 to get 62 |

SeveredCross | Thanks. My brain is in shut-off mode right now. |

HiLander | it happens |

Steve|Office | I think I got it. |

_kmh_ | Steve|Office : congrats |

jadenbane | Is there a relationship between null(A^t) and the other fundamental subspaces? |

WILDSTYLE | Hi. |

Steve|Office | thanks. |

SeveredCross | Can someone recommend a good book to read to learn Haskell? |

john_sheu | SeveredCross: try this: http://www.imdb.com/name/nm0368125/bio |

ailndx | http://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 |

SeveredCross | The Wikibook seems like a good very basic intro. That book looks pretty good...I may see if the university library has it |

ailndx | its pretty new but yes the wikibook should be a descent start |

chadmaynard | hi. 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 |

_llll_ | induction |

chadmaynard | heh? i mean i know what induction is but i don't have a great grasp on the conept |

john_sheu | just 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 |

chadmaynard | john_sheu: thanks. I just figured it out. Should have played more before askin. Thanks a lot though! |

AnotherIndividua | hello all |

john_sheu | I don't see this "all" character you refer to |