We say a positive integer $ n$ is [i]good[/i] if there exists a permutation $ a_1, a_2, \ldots, a_n$ of $ 1, 2, \ldots, n$ such that $ k \plus{} a_k$ is perfect square for all $ 1\le k\le n$. Determine all the good numbers in the set $ \{11, 13, 15, 17, 19\}$.
To determine which numbers in the set \(\{11, 13, 15, 17, 19\}\) are good, we need to check if there exists a permutation \(a_1, a_2, \ldots, a_n\) of \(\{1, 2, \ldots, n\}\) such that \(k + a_k\) is a perfect square for all \(1 \leq k \leq n\).

1. **Check \(n = 11\):**
   - We need to find a permutation \(a_1, a_2, \ldots, a_{11}\) such that \(k + a_k\) is a perfect square for all \(1 \leq k \leq 11\).
   - Consider \(k = 4\). For \(k + a_k\) to be a perfect square, \(4 + a_4\) must be a perfect square. The possible values for \(a_4\) are 5, 12, etc. Since \(a_4\) must be in \(\{1, 2, \ldots, 11\}\), \(a_4 = 5\).
   - Consider \(k = 11\). For \(k + a_k\) to be a perfect square, \(11 + a_{11}\) must be a perfect square. The possible values for \(a_{11}\) are 5, 14, etc. Since \(a_{11}\) must be in \(\{1, 2, \ldots, 11\}\), \(a_{11} = 5\).
   - This leads to a contradiction because \(a_4\) and \(a_{11}\) cannot both be 5. Therefore, 11 is not a good number.

2. **Check \(n = 13\):**
   - We need to find a permutation \(a_1, a_2, \ldots, a_{13}\) such that \(k + a_k\) is a perfect square for all \(1 \leq k \leq 13\).
   - One possible permutation is \(8, 2, 13, 12, 11, 10, 9, 1, 7, 6, 5, 4, 3\).
   - Verify:
     - \(1 + 8 = 9\) (perfect square)
     - \(2 + 2 = 4\) (perfect square)
     - \(3 + 13 = 16\) (perfect square)
     - \(4 + 12 = 16\) (perfect square)
     - \(5 + 11 = 16\) (perfect square)
     - \(6 + 10 = 16\) (perfect square)
     - \(7 + 9 = 16\) (perfect square)
     - \(8 + 1 = 9\) (perfect square)
     - \(9 + 7 = 16\) (perfect square)
     - \(10 + 6 = 16\) (perfect square)
     - \(11 + 5 = 16\) (perfect square)
     - \(12 + 4 = 16\) (perfect square)
     - \(13 + 3 = 16\) (perfect square)
   - Therefore, 13 is a good number.

3. **Check \(n = 15\):**
   - We need to find a permutation \(a_1, a_2, \ldots, a_{15}\) such that \(k + a_k\) is a perfect square for all \(1 \leq k \leq 15\).
   - One possible permutation is \(15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1\).
   - Verify:
     - \(1 + 15 = 16\) (perfect square)
     - \(2 + 14 = 16\) (perfect square)
     - \(3 + 13 = 16\) (perfect square)
     - \(4 + 12 = 16\) (perfect square)
     - \(5 + 11 = 16\) (perfect square)
     - \(6 + 10 = 16\) (perfect square)
     - \(7 + 9 = 16\) (perfect square)
     - \(8 + 8 = 16\) (perfect square)
     - \(9 + 7 = 16\) (perfect square)
     - \(10 + 6 = 16\) (perfect square)
     - \(11 + 5 = 16\) (perfect square)
     - \(12 + 4 = 16\) (perfect square)
     - \(13 + 3 = 16\) (perfect square)
     - \(14 + 2 = 16\) (perfect square)
     - \(15 + 1 = 16\) (perfect square)
   - Therefore, 15 is a good number.

4. **Check \(n = 17\):**
   - We need to find a permutation \(a_1, a_2, \ldots, a_{17}\) such that \(k + a_k\) is a perfect square for all \(1 \leq k \leq 17\).
   - One possible permutation is \(3, 7, 6, 5, 4, 10, 2, 17, 16, 15, 14, 13, 12, 11, 1, 9, 8\).
   - Verify:
     - \(1 + 3 = 4\) (perfect square)
     - \(2 + 7 = 9\) (perfect square)
     - \(3 + 6 = 9\) (perfect square)
     - \(4 + 5 = 9\) (perfect square)
     - \(5 + 4 = 9\) (perfect square)
     - \(6 + 10 = 16\) (perfect square)
     - \(7 + 2 = 9\) (perfect square)
     - \(8 + 17 = 25\) (perfect square)
     - \(9 + 16 = 25\) (perfect square)
     - \(10 + 15 = 25\) (perfect square)
     - \(11 + 14 = 25\) (perfect square)
     - \(12 + 13 = 25\) (perfect square)
     - \(13 + 12 = 25\) (perfect square)
     - \(14 + 11 = 25\) (perfect square)
     - \(15 + 1 = 16\) (perfect square)
     - \(16 + 9 = 25\) (perfect square)
     - \(17 + 8 = 25\) (perfect square)
   - Therefore, 17 is a good number.

5. **Check \(n = 19\):**
   - We need to find a permutation \(a_1, a_2, \ldots, a_{19}\) such that \(k + a_k\) is a perfect square for all \(1 \leq k \leq 19\).
   - One possible permutation is \(8, 7, 6, 5, 4, 3, 2, 1, 16, 15, 14, 13, 12, 11, 10, 9, 19, 18, 17\).
   - Verify:
     - \(1 + 8 = 9\) (perfect square)
     - \(2 + 7 = 9\) (perfect square)
     - \(3 + 6 = 9\) (perfect square)
     - \(4 + 5 = 9\) (perfect square)
     - \(5 + 4 = 9\) (perfect square)
     - \(6 + 3 = 9\) (perfect square)
     - \(7 + 2 = 9\) (perfect square)
     - \(8 + 1 = 9\) (perfect square)
     - \(9 + 16 = 25\) (perfect square)
     - \(10 + 15 = 25\) (perfect square)
     - \(11 + 14 = 25\) (perfect square)
     - \(12 + 13 = 25\) (perfect square)
     - \(13 + 12 = 25\) (perfect square)
     - \(14 + 11 = 25\) (perfect square)
     - \(15 + 10 = 25\) (perfect square)
     - \(16 + 9 = 25\) (perfect square)
     - \(17 + 19 = 36\) (perfect square)
     - \(18 + 18 = 36\) (perfect square)
     - \(19 + 17 = 36\) (perfect square)
   - Therefore, 19 is a good number.

The final answer is \( \boxed{ \{13, 15, 17, 19\} } \).