# Josh

less info
reputation
213
bio website location age member for 2 years, 2 months seen Oct 16 at 8:10 profile views 169

In house web designer for small tech company. Does some PHP stuff and hates it. Pretty good with Python.

# 101 Actions

 Nov21 awarded Popular Question Nov5 awarded Self-Learner Oct31 awarded Nice Question Oct5 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. Sep16 revised A more subtle marble drawing problem. added 35 characters in body Sep16 asked A more subtle marble drawing problem. Sep15 awarded Tumbleweed Sep8 revised Optimizing a population to maximize probability of achieving certain samples. added 246 characters in body Sep8 asked Optimizing a population to maximize probability of achieving certain samples. Jun25 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. Jun24 comment Preparing for Spivak I know. They are covered better elsewhere. Feb4 comment Help with old Mu Alpha Theta Question. (Geometry) Thank you. Today was not my best day... I knew I was missing something dumb. Feb4 accepted Help with old Mu Alpha Theta Question. (Geometry) Feb4 asked Help with old Mu Alpha Theta Question. (Geometry) Jan29 accepted Calculating Total Field Goals Using Poisson Jan21 asked Calculating Total Field Goals Using Poisson Jan12 answered Preparing for Spivak Jan4 awarded Notable Question Jan3 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. Jan3 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