olymmath

OMCC 2001 Problem 6

  • Day 2

In a circumference of a circle, 1000010000 points are marked, and they are numbered from 11 to 1000010000 in a clockwise manner. 50005000 segments are drawn in such a way so that the following conditions are met:

  1. Each segment joins two marked points.
  2. Each marked point belongs to one and only one segment.
  3. Each segment intersects exactly one of the remaining segments.
  4. A number is assigned to each segment that is the product of the number assigned to each end point of the segment.

Let SS be the sum of the products assigned to all the segments.

Show that SS is a multiple of 44 .

Dataset text AI-MO AoPS. Quoted with source.

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 centro/2001/p6 · Tag 41D4J9PXNP · Edit this page on GitHub · Keys: j next, k previous