616 reputation
416
bio website
location Reno, NV
age 23
visits member for 2 years, 11 months
seen 5 hours ago

I'm a math/programming teacher and freelance programmer. My first language was Scheme, and I have a major soft spot for functional programming. I read SICP every year and do all of the exercises (so I'm pretty good at hw-type problems.)


Oct
31
awarded  Nice Question
Oct
5
comment A more subtle marble drawing problem.
Already done. I have numbers through Monte Carlo simulation. The problem is, I need this to run quickly because it's the basis of another computer program, specifically an evolutionary algorithm that needs to redo numbers every time it makes a mutation.
Sep
16
revised A more subtle marble drawing problem.
added 35 characters in body
Sep
16
asked A more subtle marble drawing problem.
Sep
15
awarded  Tumbleweed
Jun
25
comment Preparing for Spivak
I should rephrase. There are other books that helped me develop a "repertoire" of techniques for using those inequalities in proofs. None of the books I'm referring to are textbooks. I have a smorgasbord of contest problem solving books, which I found to be far more helpful than Spivak in the inequality department.
Jun
24
comment Preparing for Spivak
I know. They are covered better elsewhere.
Feb
4
comment Help with old Mu Alpha Theta Question. (Geometry)
Thank you. Today was not my best day... I knew I was missing something dumb.
Feb
4
accepted Help with old Mu Alpha Theta Question. (Geometry)
Feb
4
asked Help with old Mu Alpha Theta Question. (Geometry)
Jan
29
accepted Calculating Total Field Goals Using Poisson
Jan
21
asked Calculating Total Field Goals Using Poisson
Jan
12
answered Preparing for Spivak
Jan
4
awarded  Notable Question
Jan
3
comment Prove that all combinators must fulfill A x = x for some x, given that M x = x x and composability of any two combinators
I just solved this. Funnily enough, I went this direction when I first attacked the problem and then failed to see it through.
Jan
3
accepted Prove that all combinators must fulfill A x = x for some x, given that M x = x x and composability of any two combinators
Jan
2
revised Prove that all combinators must fulfill A x = x for some x, given that M x = x x and composability of any two combinators
Fixed grammar
Jan
2
revised Prove that all combinators must fulfill A x = x for some x, given that M x = x x and composability of any two combinators
added 35 characters in body
Jan
2
comment Prove that all combinators must fulfill A x = x for some x, given that M x = x x and composability of any two combinators
Yes, that's the definition of fond. I can't believe I neglected to add that.
Jan
2
asked Prove that all combinators must fulfill A x = x for some x, given that M x = x x and composability of any two combinators