A Graph Theory Olympiad Question Whose Answer is 1015056

Pela blogosfera: divulgo uma questão difícil das Olimpíadas de Matemática

Singapore Maths Tuition

April’s Math Olympiad Question was a particularly tough one, only four people in the world solved it! One from Japan, one from Slovakia, one from Ankara, and one from Singapore!

The question starts off seemingly simple enough:

In a party attended by 2015 guests among any 7 guests at most 12 handshakes had been
exchanged. Determine the maximal possible total number of handshakes.

However, when one starts trying out the questions, one quickly realizes the number of handshakes is very large, possibly even up to millions. This question definitely can’t be solved by trial and error!

This question is ideally modeled by a graph, and has connections to the idea of a Turán graph.

My solution presented is here: April 2015 Solution

The official solution can be accessed here: http://www.fen.bilkent.edu.tr/~cvmath/Problem/1504a.pdf

april 2014 math olympiad

Turan 13-4.svg The Turán graph T(13,4)

To read more about Math Olympiad books, you may check out my earlier post…

View original post mais 8 palavras

Sobre Américo Tavares

eng. electrotécnico reformado / retired electrical engineer
Esta entrada foi publicada em Matemática. ligação permanente.

Deixe uma Resposta

Preencha os seus detalhes abaixo ou clique num ícone para iniciar sessão:

Logótipo da WordPress.com

Está a comentar usando a sua conta WordPress.com Terminar Sessão /  Alterar )

Google photo

Está a comentar usando a sua conta Google Terminar Sessão /  Alterar )

Imagem do Twitter

Está a comentar usando a sua conta Twitter Terminar Sessão /  Alterar )

Facebook photo

Está a comentar usando a sua conta Facebook Terminar Sessão /  Alterar )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.