To find the greatest common divisor (GCD), or "größter gemeinsamer Teiler (ggT)" in German, of the numbers 935935 and 396, we can use the Euclidean algorithm. The Euclidean algorithm involves repeated division and taking the remainder until the remainder is zero. The last non-zero remainder is the GCD.

Steps of the Euclidean Algorithm:

1. Divide 935935 by 396 and find the remainder.
2. Divide 396 by the remainder from step 1.
3. Continue this process until the remainder is 0.
4. The last non-zero remainder is the GCD.

Let's go through the steps:

1. 935935 ÷ 396 gives a quotient of 2363 and a remainder of 367. $935935 = 2363 \times 396 + 367$

2. 396 ÷ 367 gives a quotient of 1 and a remainder of 29. $396 = 1 \times 367 + 29$

3. 367 ÷ 29 gives a quotient of 12 and a remainder of 19. $367 = 12 \times 29 + 19$

4. 29 ÷ 19 gives a quotient of 1 and a remainder of 10. $29 = 1 \times 19 + 10$

5. 19 ÷ 10 gives a quotient of 1 and a remainder of 9. $19 = 1 \times 10 + 9$

6. 10 ÷ 9 gives a quotient of 1 and