Answer
11
Work Step by Step
Use the Euclidean algorithm, we have:
1. $a:=1188, b:=385, r:=385$
2. as $b\ne0$, we have $r:=a\ mod\ b=1188\ mod\ 385=33$
3. set $a:=385, b:=33$
4. as $b\ne0$, we have $r:=a\ mod\ b=385\ mod\ 33=22$
5. set $a:=33, b:=22$
6. as $b\ne0$, we have $r:=a\ mod\ b=33\ mod\ 22=11$
7. set $a:=22, b:=11$
8. as $b\ne0$, we have $r:=a\ mod\ b=22\ mod\ 11=0$
9. set $a:=11, b:=0$
10. output: gcd=11
