bio | website | gottwurfelt.com |
---|---|---|
location | Atlanta | |
age | 31 | |
visits | member for | 5 years, 6 months |
seen | 2 days ago | |
stats | profile views | 4,410 |
I earned my PhD at the University of Pennsylvania, working in combinatorics and probability. Within mathematics, I'm particularly interested in what large random structures look like. I think generating functions are awesome, which is probably pretty clearly reflected in the questions I answer.
Now I work as a data scientist, which is what they call statisticians when they want to pay them more and sound modern.
Mar 26 |
awarded | Good Answer |
Feb 6 |
awarded | Nice Answer |
Jan 24 |
awarded | Popular Question |
Dec 15 |
awarded | Custodian |
Dec 15 |
reviewed | Reject Models of intuitionistic linear logic that reflect the resource interpretation |
Dec 15 |
reviewed | Approve A question on intuitionistic propositional logic |
Dec 15 |
comment |
Numbers with all N-digit prefixes divisible by N
I like this heuristic, but it seems to miss some essential feature of the problem - the number of good orders for all the bases looked at is less than $n - 1$. |
Oct 15 |
awarded | Favorite Question |
Oct 11 |
awarded | Yearling |
Aug 31 |
awarded | Nice Question |
Jul 2 |
awarded | Curious |
May 5 |
awarded | Enlightened |
May 5 |
awarded | Nice Answer |
Jan 31 |
comment |
Distribution of digits of $pq$-adic idempotents (aka “automorphic numbers”)
Out of curiosity, since you have the code to do this: does the distribution appear to be uniform for some of the other all small cases, when, say, pq = 6, or 14, or 15? |
Jan 6 |
awarded | Nice Answer |
Nov 2 |
comment |
Sequences with integral means
I would just like to confirm that I've calculated this sequence and got the same result. |
Oct 10 |
awarded | Yearling |
Sep 30 |
awarded | Caucus |
Sep 13 |
awarded | Notable Question |
Aug 27 |
awarded | Good Question |