# Stéphane Gimenez

less info
reputation
49
bio website location Innsbruck, Austria age member for 2 years, 5 months seen Mar 1 at 17:45 profile views 56

Some advertising for new sites and Area51 proposals:

# 26 Actions

 Jan27 revised Is the Look and Say Sequence a “proper” maths problem? added 104 characters in body Jan27 revised Is the Look and Say Sequence a “proper” maths problem? added 104 characters in body Jan27 answered Is the Look and Say Sequence a “proper” maths problem? Jan9 awarded Critic Sep14 awarded Yearling Jun6 awarded Good Answer Jun1 awarded Nice Answer May31 revised My son's Sum of Some is beautiful! But what is the proof or explanation? edited body May31 answered My son's Sum of Some is beautiful! But what is the proof or explanation? May17 awarded Constituent May13 awarded Caucus Oct13 awarded Nice Answer Oct13 awarded Yearling Jun8 awarded Caucus Apr22 revised First order logic. This was probably the intended solution (fixed names and variables), and TeXified it. Apr22 suggested suggested edit on First order logic. Nov28 revised How do you factor $x^3-3x^2+3x-1$? adding capital letter and latex makeup in the title Nov28 suggested suggested edit on How do you factor $x^3-3x^2+3x-1$? Oct3 comment How to prove the optimal Towers of Hanoi strategy? Finding the worst strategy (free of internal cycles) is much more fun ;-) Oct2 comment In Towers of Hanoi (with 3 sticks and n disks without backtracking), do all legal sequences of moves reach the solution? I was confused by the title because “A deadlock would never occur” and “The problem always has a solution” are different statements to me… However, defining deadlock as a reachable position where no more moves are available (or alternatively as a position from which the goal cannot be reached anymore), it's obvious that deadlocks cannot occur in the TH game: every step along the reverse path (of a path containing valid moves) is a valid move.