olymmath

AMO-Bench 2025 Problem 47

  • Answer

Assume that graph GG has 5050 vertices, and for any two non-adjacent vertices, they have exactly two common neighbors. Vertices v1v_1 and v2v_2 are adjacent and have no common neighbors, the degree of v1v_1 is d(v1)=11d(v_1)=11. The parameter MM is defined as: if such a graph GG exists, then M=max(d(v2)−d(v1))M=max(d(v_2)-d(v_1)); otherwise, M=0M=0. Let aa be the smallest positive real root of the equation x6−4x5+7x4−25x3+38x2−6x+34=M(2x3−4x2+3x−19−M)x^{6}-4x^{5}+7x^{4}-25x^{3}+38x^{2}-6x+34=M(2x^3-4x^2+3x-19-M), find the remainder of the closest integer to a25a^{25} divided by 10001000.

Dataset text AMO-Bench. Open licence.

Show the answer

72

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 amo-bench/2025/p47 · Tag WBNN6YB678 · Edit this page on GitHub · Keys: j next, k previous