olymmath

CN-TST 2012 Problem 16

  • Test 3

Given an integer n≥4n\ge 4 . S={1,2,…,n}S=\{1,2,\ldots,n\} . A,BA,B are two subsets of SS such that for every pair of (a,b),a∈A,b∈B,ab+1(a,b),a\in A,b\in B, ab+1 is a perfect square. Prove that min⁡{∣A∣,∣B∣}≤log⁡2n.\min \{|A|,|B|\}\le\log _2n.

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 cn-tst/2012/p16 · Tag 7V7V7GMXK3 · Edit this page on GitHub · Keys: j next, k previous