Find all primes $p \ge 3$ such that $p- \lfloor p/q \rfloor q$ is a square-free integer for any prime $q<p$.
To solve the problem, we need to find all prime numbers \( p \geq 3 \) such that \( p - \lfloor p/q \rfloor q \) is a square-free integer for any prime \( q < p \).

1. **Check small primes:**
   - For \( p = 3 \):
     \[
     p - \lfloor p/q \rfloor q = 3 - \lfloor 3/q \rfloor q
     \]
     For \( q = 2 \):
     \[
     3 - \lfloor 3/2 \rfloor \cdot 2 = 3 - 1 \cdot 2 = 1 \quad (\text{square-free})
     \]
     Thus, \( p = 3 \) works.

   - For \( p = 5 \):
     \[
     p - \lfloor p/q \rfloor q = 5 - \lfloor 5/q \rfloor q
     \]
     For \( q = 3 \):
     \[
     5 - \lfloor 5/3 \rfloor \cdot 3 = 5 - 1 \cdot 3 = 2 \quad (\text{square-free})
     \]
     Thus, \( p = 5 \) works.

   - For \( p = 7 \):
     \[
     p - \lfloor p/q \rfloor q = 7 - \lfloor 7/q \rfloor q
     \]
     For \( q = 5 \):
     \[
     7 - \lfloor 7/5 \rfloor \cdot 5 = 7 - 1 \cdot 5 = 2 \quad (\text{square-free})
     \]
     Thus, \( p = 7 \) works.

   - For \( p = 11 \):
     \[
     p - \lfloor p/q \rfloor q = 11 - \lfloor 11/q \rfloor q
     \]
     For \( q = 7 \):
     \[
     11 - \lfloor 11/7 \rfloor \cdot 7 = 11 - 1 \cdot 7 = 4 \quad (\text{not square-free, as } 4 = 2^2)
     \]
     Thus, \( p = 11 \) does not work.

   - For \( p = 13 \):
     \[
     p - \lfloor p/q \rfloor q = 13 - \lfloor 13/q \rfloor q
     \]
     For \( q = 11 \):
     \[
     13 - \lfloor 13/11 \rfloor \cdot 11 = 13 - 1 \cdot 11 = 2 \quad (\text{square-free})
     \]
     Thus, \( p = 13 \) works.

2. **Assume \( p > 13 \):**
   - We need \( p - 4 = 3^n \) and \( p - 8 \) or \( p - 9 \) to be divisible by just \( 2, 5, 7 \).

3. **Case analysis:**
   - \( p - 9 = 2^m \):
     \[
     3^n = 2^m + 5
     \]
     This is impossible modulo 8 because \( 3^n \equiv 3, 1 \pmod{8} \) and \( 2^m + 5 \equiv 5, 6, 1, 2 \pmod{8} \).

   - \( p - 8 = 7^m \):
     \[
     3^n = 7^m + 4
     \]
     This is impossible modulo 3 because \( 7^m \equiv 1 \pmod{3} \) and \( 3^n \equiv 1 \pmod{3} \).

   - \( p - 8 = 5^m \):
     \[
     3^n = 5^m + 4
     \]
     Writing as:
     \[
     3^2(3^{n-2} - 1) = 5(5^{m-1} - 1)
     \]
     From \( 3^2 \mid 5^{m-1} - 1 \), we need \( 6 \mid m-1 \). But then:
     \[
     2^3 \cdot 3^2 \cdot 7 \cdot 31 = 5^6 - 1 \mid 5^{m-1} - 1
     \]
     So we need \( 5 \cdot 7 \mid 3^{n-2} - 1 \), thus \( 12 \mid n-2 \). But then:
     \[
     2^4 \cdot 5 \cdot 7 \cdot 13 \cdot 73 = 3^{12} - 1 \mid 3^{n-2} - 1
     \]
     So we need \( 73 \mid 5^{m-1} - 1 \), forcing \( 72 \mid m-1 \). Then:
     \[
     3^3 \mid 5^{72} - 1 \mid 5^{m-1} - 1
     \]
     Thus, \( 3^3 \mid 3^2(3^{n-2} - 1) \), which is impossible.

Therefore, no other solutions exist.

The final answer is \( \boxed{ \{3, 5, 7, 13\} } \).