Color the positive integers by four colors c1,c2,c3,c4.
(1)Prove that there exists a positive integer n and i,j∈{1,2,3,4},such that among all the positive divisors of n, the number of divisors with color ci is at least greater than the number of divisors with color cj by 3.
(2)Prove that for any positive integer A,there exists a positive integer n and i,j∈{1,2,3,4},such that among all the positive divisors of n, the number of divisors with color ci is at least greater than the number of divisors with color cj by A. combinatoricsRamsey Theory