Subcontests
(4)pable numbers
Let k>2 be an integer. A positive integer l is said to be k−pable if the numbers 1,3,5,...,2k−1 can be partitioned into two subsets A and B in such a way that the sum of the elements of A is exactly l times as large as the sum of the elements of B.
Show that the smallest k−pable integer is coprime to k. combinatorial nT in 2n-gon
Let n≥4 be an integer. Consider a regular 2n−gon for which to every vertex, an integer is assigned, which we call the value of said vertex. If four distinct vertices of this 2n−gon form a rectangle, we say that the sum of the values of these vertices is a rectangular sum.
Determine for which (not necessarily positive) integers m the integers m+1,m+2,...,m+2n can be assigned to the vertices (in some order) in such a way that every rectangular sum is a prime number. (Prime numbers are positive by definition.) disks in combinatorics
Let n be a positive integer. Suppose that we have disks of radii 1,2,...,n. Of each size there are two disks: a transparent one and an opaque one. In every disk there is a small hole in the centre, with which we can stack the
disks using a vertical stick. We want to make stacks of disks that satisfy the following conditions:
i) Of each size exactly one disk lies in the stack.
ii) If we look at the stack from directly above, we can see the edges of all of the n disks in the stack. (So if there is an opaque disk in the stack,no smaller disks may lie beneath it.)
Determine the number of distinct stacks of disks satisfying these conditions.
(Two stacks are distinct if they do not use the same set of disks, or, if they do use the same set of disks and the orders in which the disks occur are different.) Trivial NT in TST
Let a,b,c be distinct positive integers, and suppose that p=ab+bc+ca is a prime number.
(a) Show that a2,b,c2 give distinct remainders after division by p.
(b) Show that a3,b3,c3 give distinct remainders after division by p.