17,925 reputation
31648
bio website
location
age
visits member for 2 years, 4 months
seen Jul 24 at 17:31

Jul
19
awarded  soft-question
Jul
5
comment How to prove that these are the only type inhabitants?
Well, I know that. My problem is that I have trouble with formalizing it.
Jul
4
comment How to prove that these are the only type inhabitants?
You prove this for some particular types $A$ and $B$, but that doesn't exclude the fact that some other type $C$ for which $\mathrm{boolean} C$ is neither $\mathrm{tt}$ nor $\mathrm{ff}$.
Jul
2
awarded  Curious
Jun
24
asked How to prove that these are the only type inhabitants?
Jun
23
comment Cutting a chessboard into domino pieces!
Could you please reformulate the problem? It's quite hard to parse in its current form.
Jun
21
reviewed Approve suggested edit on Max Function Notation
Jun
21
answered Create a configuration - graph theory
Jun
21
comment map if-then-else to probability
@SebastianBaltes This all boils down to how the transition graph looks like. You say that it's already a data structure, so I would suspect that structure has a form quite similar to the transition graph (you have to describe the flow somehow). If it's a tree, or if the loops are only at the final nodes, then it's easy. If there are other loops, but they don't cross too much (e.g. cycles are independent), then it's still ok. However, for general graph you would need to solve equations, because interdependencies might create arbitrary transfers of probabilities.
Jun
21
comment map if-then-else to probability
@SebastianBaltes That significantly complicates the problem. You could translate your code into state-based system and calculate the probabilities via linear algebra (similarly to Markov chains), but it is going to be both slow and complicated.
Jun
21
comment map if-then-else to probability
You don't have to use Monte Carlo, with the above dice there are $8*10*12 = 960$ possibilities, you could check them all and get the precise result. This is exponential in the number of dice, but it's hard to make it faster. If you want to optimize, group the dice results, there is a nice simple approach using continuation passing style for backtracking.
Jun
6
comment Do only certain people exceed at math well?
This question would be a great fit for math educators stackexchange.
Jun
5
comment Prove $|\det A| \leq \prod_{j=1}^n ||a_j||$
Something's wrong $$\det(2\cdot I) = 2^n > n\cdot 2^2 = \sum_j \|a_j\|$$ for large $n$ (perhaps product instead of sum?).
Jun
5
answered is MST a Steiner tree?
Jun
5
answered Equivalence between $\neg\neg\bot$ and $\bot$ in intuitionistic logic.
Jun
5
comment how to get a power law distribution function from a barabasi albert graph?
An easy approach is to eyeball if the log-log plot looks like a straight line.
Jun
5
comment Math Olympiad Algebra Question
I like your answer, particularly because it aligns with my intuitions. Using asymptotical approach one can guess that the maximum of $|x|$ and $|y|$ is approximated by $\frac{406}{133}\simeq 3.05 \approx 3$ and its coefficient by $\frac{406}{3^4}\simeq 5.01 \approx 5$.
Jun
5
comment Math Olympiad Algebra Question
@snivysteel Thank you very much!
Jun
5
comment Math Olympiad Algebra Question
Then maybe some kind of reference: organization that organized it (what country), dates and level (e.g. high school), etc.?
Jun
5
comment Math Olympiad Algebra Question
You have posted quite a number of contest math questions recently, do you have a link to this problem set?