160 reputation
4
bio website
location
age
visits member for 3 years, 4 months
seen Jun 5 '12 at 6:58

Feb
15
comment How to solve $n < 2^{n/8}$ for $n$?
looks fine to me
Feb
6
comment How to solve $n < 2^{n/8}$ for $n$?
ok, well that certainly explains why I was puzzling over this for a long time. I was trying to solve the wrong problem. Thanks
Feb
6
awarded  Supporter
Feb
6
accepted How to solve $n < 2^{n/8}$ for $n$?
Feb
6
comment How to solve $n < 2^{n/8}$ for $n$?
That looks fine to me, and reminds me that I was trying to solve something outside the problem specification, namely the exact value of n where $2^n = n^8$. As a point of curiosity, can an exact number be calculated for that?
Feb
6
asked How to solve $n < 2^{n/8}$ for $n$?
Dec
17
awarded  Scholar
Dec
17
comment Proof of clockwise towers of Hanoi variant recursive solution
Thanks, that seems to make sense to me. However one thing I remain unsure of is that this proof depends on the strategy of moving $R_k$ followed by 1 followed by $R_k$. While by "common sense" this makes sense, it isn't actually proved as the best strategy to move a stack $K_{n+1}$ or is it?
Dec
17
accepted Proof of clockwise towers of Hanoi variant recursive solution
Dec
16
awarded  Student
Dec
16
awarded  Editor
Dec
16
revised Proof of clockwise towers of Hanoi variant recursive solution
added 127 characters in body; edited title
Dec
16
asked Proof of clockwise towers of Hanoi variant recursive solution