We need to find 599mod11.
By Fermat's Little Theorem, since 11 is prime and gcd(5,11)=1:
510≡1(mod11)
Dividing the exponent: 99=10×9+9
599=(510)9×59≡19×59=59(mod11)
Computing 59mod11 step by step:
51≡5
52≡25≡3(mod11)
54≡32=9(mod11)
58≡92=81≡4(mod11)
59=58×5≡4×5=20≡9(mod11)
The remainder is 9.