olymmath

HMMT November 2008 U26

  • Guts
  • Answer

John M. is sitting at ( 0,0 ), looking across the aisle at his friends sitting at (i,j)(i, j) for each 1≤i≤101 \leq i \leq 10 and 0≤j≤50 \leq j \leq 5. Unfortunately, John can only see a friend if the line connecting them doesn't pass through any other friend. How many friends can John see?

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

36

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator hmnt/2008/u26 · Tag VEBJ45KFCR · Edit this page on GitHub · Keys: j next, k previous