543 reputation
48
bio website
location
age
visits member for 2 years
seen 16 hours ago

Jan-Dvorak @ Miaou
Honnza @ gmail.com

"Haven't you heard? Crowdsourcing to stackOverflow is the new trend in basic debugging."

-- Jan Dvorak

"There are only two hard things in Computer Science: cache invalidation, naming things and off-by-one errors"

-- variation of Phil Karlton's quote


1d
comment Integration problem
@pushpen.paul I've seen formula screenshot before. I haven't seen hand-drawn integral signs before yet, though.
1d
comment Integration problem
@PedroArbizu I've never seen it before either
1d
comment binomial- theorem
en.wikipedia.org/wiki/Binomial_theorem
2d
comment SEVEN - NINE= EIGHT
f x = if .. -- Learn to use guards!!! f x | cond = .... Also, x in the first pattern is unused - use _. Also, remove1 seems like it only makes sense in the context of remove. Perhaps use the where syntax. Also, the remove function seems suspiciously similar to \\ from Data.List. Also, since you don't do any branch elimination, Data.List.permutation seems useful here. Also, consider using digits instead of integers and read instead of a hand-rolled base conversion function. Also, the guard statement could use a $.
Nov
25
awarded  Pundit
Nov
18
awarded  Yearling
Nov
13
comment Computing a limit using a Maclaurin series
@Integrator how many marks would require $500$ rep?
Nov
4
comment Does limit of $x_n=(1+\frac{1}{2})*(1+\frac{1}{4})*…*(1+\frac{1}{2^n})$ exist?
an increasing function is always monotonic...
Oct
28
comment Are the hyperreal numbers densely ordered?
What happens if you try to look at ${x+y}\over2$ as a number strictly between $x$ and $y$?
Oct
23
comment Best strategy for this game. [Nintendo Wii game]
"the optimal strategy involves some randomness." - as I said in the comments. But what's the optimal set of probabilities, if there is any?
Oct
23
comment Best strategy for this game. [Nintendo Wii game]
The strategy to always choose 5 sounds good if other players choose uniformly randomly (which is a bad strategy if yours clearly outperforms it). At each step you have a 8/27 ~ 1/3 chance of moving forwards, and you only need to move twice. An opponent that calls either 1 or 3 has a 4/9 ~ 1/2 chance of being uncontested, but they have to succeed 4 resp. 10 times. BUT if two different players choose that, one of the other two is sure to win.
Oct
23
comment Best strategy for this game. [Nintendo Wii game]
There is no winning pure strategy - if everyone plays the same, noone moves. And I'm not sure if there's a single dominating probabilistic strategy. Anyone willing to do the maths?
Oct
16
comment improper integrals: Need help please
@mm-aops I guess you meant for $a>1$?
Oct
16
comment improper integrals: Need help please
My first guess is that it converges because its dominant term is $1/x^2$. My second guess is that it converges because it drops asymptotically faster than the harmonic series $1/x$
Oct
8
comment Does the supremum is finite?
The supremum always exists in any totally ordered set, and the set of reals is totally ordered...
Oct
8
comment Finite State Automata for (0+11+01)*(0)*(01)*
The graph above looks suspiciously like a nondeterministic finite automaton ;-)
Oct
8
comment The Real Part of an Imaginary Number
hint: $f(x)=x+i$
Oct
7
comment Slowly varying function without limit at infinity
@MaartenHilferink I solemnly swear I can see no such answer of yours.
Sep
28
comment Is this rule for graph isomorphism true?
another example, from chemistry: 2-methyl-pentene (isohexane) and 3-methyl-pentene (with the methyl group sitting in the middle)
Sep
28
comment Is this rule for graph isomorphism true?
- are edges, and + represents three vertices and four edges. Unfortunately, it's hard to draw a branching structure in ASCII