(i) Let the side have n tiles. Then the total is n×n=n2. If n is a multiple of 3, then n=3k for a whole number k, and
n2=9k2=3×3k2
which is a multiple of 3. For Courtyard 1, 6×6=36=3×12. So P is true.
(ii) Converse: "If the total number of tiles is a multiple of 3, then the number of tiles along one side is a multiple of 3."
Suppose the side n is not a multiple of 3. Then n=3k+1 or n=3k+2, and
(3k+1)2=9k2+6k+1=3(3k2+2k)+1
(3k+2)2=9k2+12k+4=3(3k2+4k+1)+1
In both cases the total leaves remainder 1 when divided by 3, so it is not a multiple of 3 (Courtyard 2: 5×5=25). So a total that is a multiple of 3 can only come from a side that is a multiple of 3. The converse is true, and P and its converse imply each other.