find the smallest integer k such that every k-element subset of {1, 2, 3, ......., 50} contains two distinct elements a , b such that (a + b) divides ab.
Subscribe to:
Post Comments (Atom)
Define
-
In an idle moment, Vedansi Chakraborty picked up two numbers x and y such that 0<x<y<1. She wondered how to combine these simply...
-
1. Boddhi places some counters onto the squares of an 8 by 8 chessboard so that there is at most one counter in each of the 64 squares. Det...
No comments:
Post a Comment