Reputation
830
Top tag
Next privilege 1,000 Rep.
Create tags
Badges
6 23
Impact
~34k people reached

Feb
22
awarded  Notable Question
Feb
11
awarded  Notable Question
Dec
29
awarded  Yearling
Dec
8
awarded  Caucus
Sep
24
awarded  Autobiographer
Sep
5
awarded  Popular Question
Jul
2
awarded  Curious
Jul
2
awarded  Inquisitive
May
31
comment Algorithm for redistributing wealth
I thought of something like that too, but it seems that I can't prove it is THE optimal way, and there certainly are pathological cases showing it is NOT the optimal way...
May
31
asked Algorithm for redistributing wealth
May
25
awarded  Popular Question
May
19
awarded  Notable Question
Feb
19
awarded  Popular Question
Feb
12
accepted Greedy algorithm to make change “getting stuck”
Feb
12
asked Greedy algorithm to make change “getting stuck”
Feb
8
comment True, false and meaningless statements in math.
The language seems to be Georgian. Nkoreli is typing Georgian in the Latin alphabet.
Jan
23
accepted How to make recursive computation of $I_n=\int_0^1 \frac{x^n}{x+\alpha}\,dx$ stable?
Jan
23
comment How to make recursive computation of $I_n=\int_0^1 \frac{x^n}{x+\alpha}\,dx$ stable?
Thanks! That really helped.
Jan
23
comment How to make recursive computation of $I_n=\int_0^1 \frac{x^n}{x+\alpha}\,dx$ stable?
Umm, we know already what $I_0$ is. We want a formula for $I_n$. I know, for large $n$, $I_0$ is easily calculated, but we are given $I_0$ and asked to find a stable algo for $I_n$. With the recurrence I derived this would involve subtracting something very close to $I_0$ from $I_0$, a classic invite for massive instability.
Jan
23
comment How to make recursive computation of $I_n=\int_0^1 \frac{x^n}{x+\alpha}\,dx$ stable?
I seem to get $I_0=f(1)-\frac{1}{\alpha}f(2)+\frac{1}{\alpha ^2}f(3)...\frac{1}{\alpha ^ n}I_n$. Is this remotely correct? How on earth is this of any use, especially since I don't know if $n$ is even or odd? This also doesn't look very stable, with the alternating up and down of small quantities...