Jineon Baek
Reputation
504
Top tag
Next privilege 1,000 Rep.
Create new tags
 Aug 21 asked A separable locally compact metric space is compact iff all of its homeomorphic metric spaces are bounded Aug 19 awarded Commentator Aug 19 comment Prove convexity/concavity of a complicated function Is $f$ the function you wanted to optimize in your previous question? :D Edit: Oh no I didn't realized that $f$ is one-variable here! Aug 17 comment How to prove that this sequence converges? ($a_n=a_{a_{n-1}}+a_{n-a_{n-1}}$) I think the sequence is Hofstadter-Conway $10000 Sequence! mathworld.wolfram.com/… Aug 15 answered Prove that$|S|< \frac{2p}{k+1}$Aug 11 comment Prove that$\frac4{abcd} \geq \frac a b + \frac bc + \frac cd +\frac d a\$ Brilliant! This solution covers the equality case (a, b, c, d) = (2, 0, 1, 1)! I thought only using dirty techniques would give that. Aug 9 awarded Editor Aug 9 awarded Teacher Aug 1 comment Math notation for location of the maximum en.wikipedia.org/wiki/Arg_max Jul 26 comment Combined AM GM QM inequality @picakhu: Really interesting inequallity. Did you found a "not interesting" proof? (like expanding all terms and using Muirhead or Schur technically). Jul 24 accepted Deterministic algorithm for matching variables by only using restricted comparison Jul 24 comment Deterministic algorithm for matching variables by only using restricted comparison @Ilmari Karonen Sorry for confusion again. YES :-) Jul 24 comment Deterministic algorithm for matching variables by only using restricted comparison @joriki "deterministic" algorithm never uses a pure "ideal" random number generator. So it can use PRNG or whatsoever. However its efficiency is measured by the maximum of efficiency for all inputs can be made(efficiency for a input is measured by just time taken for that input). Jul 24 comment Deterministic algorithm for matching variables by only using restricted comparison @joriki Sorry for confusion. What I mean by randomized algorithm is that it uses pure "ideal" random number generator and its efficiency for a input is measured by the expected value of the time taken by the algorithm. The "randomized" algorithm's efficiency is the maximum of efficiency for all inputs can be made. Jul 24 asked Deterministic algorithm for matching variables by only using restricted comparison Jul 18 accepted A stronger version of discrete “Liouville's theorem” Jul 17 awarded Nice Question Jul 17 awarded Supporter Jul 17 awarded Scholar Jul 17 awarded Student