MathDB
n-tuple (a_k) to represent any (b_k) as m∙b_k = c_k^a_k

Source: Czech-Polish-Slovak Match, 2009

August 25, 2011
number theory unsolvednumber theory

Problem Statement

The nn-tuple (a1,a2,,an)(a_1,a_2,\ldots,a_n) of integers satisfies the following: (i) 1a1<a2<<an501\le a_1<a_2<\cdots < a_n\le 50 (ii) for each nn-tuple (b1,b2,,bn)(b_1,b_2,\ldots,b_n) of positive integers, there exist a positive integer mm and an nn-tuple (c1,c2,,cn)(c_1,c_2,\ldots,c_n) of positive integers such that mbi=ciaifor i=1,2,,n.mb_i=c_i^{a_i}\qquad\text{for } i=1,2,\ldots,n. Prove that n16n\le 16 and determine the number of nn-tuples (a1,a2,,an(a_1,a_2,\ldots,a_n) satisfying these conditions for n=16n=16.