a) Let N be a nice number, i.e. N=d12+d22+d32, where d1,d2,d3 are distinct divisors of N. If some divisor of N is divisible by 3, then N is divisible by 3.
So we suppose that d1,d2,d3 are not divisible by 3. Then their squares are congruent to 1 modulo 3, i.e. d12=3k1+1, k1∈N, i=1,2,3. Therefore
N=d12+d22+d32=3(k1+k2+k3)+3,
and so N is divisible by 3.
b) There exists a nice number N′. For example, if N=30 and its divisors are d1=1, d2=2, d3=5, then
d12+d22+d32=12+22+52=1+4+25=30=N,
i.e. N is nice.
Consider N(p)=Np2, where p is some positive integer and p>1. If d1,d2,d3 are distinct divisors of N, then it is obvious that d1p,d2p,d3p are distinct divisors of N(p), and
N(p)=Np2=[N=d12+d22+d32]=(d12+d22+d32)p2=(d1p)2+(d2p)2+(d3p)2.
From this equality it follows that N(p) is nice too. Since any positive integer can be used as p, there are infinitely many nice numbers N(p).