## Mikhail Khovanov at Kvant

Strictly speaking Misha is not my brother, but rather a half-brother. His full name is Mikhail Khovanov and he is a math professor at Columbia. The signed issue he gave me contains his math problem published in the journal. He invented this problem when he was a 10th grader. Here it is:

In a convex n-gon (n > 4), no three diagonals are concurrent (intersect at the same point). What is the maximum number of the diagonals that can be drawn inside this polygon so that all the parts they divide into are triangles?

He designed other problems while he was in high school. All of them are geometrical in nature. The journal is available online, and a separate document with all the math problems is also available (in Russian). His problems are M1038, M1103, M1108 (above), M1119, M1153, M1204. I like his other problems too. M1153 (below) is the shortest problem on his list: as usual I am guided by my laziness.

What’s the greatest number of turns that a rook’s Hamiltonian cycle through every cell on an 8 by 8 chessboard can contain?

I wanted to accompany this post with a picture of my brother at the age he was when he invented these problemsâ€”about 16. Unfortunately, I don’t have a quality picture from that period. I do have a picture that is slightly off: by about ten years.