* 🌐 Update Chinese translation for `docs/zh/docs/contributing.md`. PR [#10887](https://github.com/tiangolo/fastapi/pull/10887) by [@Aruelius](https://github.com/Aruelius).
* 🌐 Add Azerbaijani translation for `docs/az/docs/fastapi-people.md`. PR [#11195](https://github.com/tiangolo/fastapi/pull/11195) by [@vusallyv](https://github.com/vusallyv).

to preserve the larger prime power of each prime factor, so we can // right-shift the number with the fewest trailing zeros until it's odd. // For odd a, b and m >= n, lcm(a×2ᵐ, b×2ⁿ) = lcm(a×2ᵐ, b). az, bz := a.TrailingZeroBitsVarT(), b.TrailingZeroBitsVarT() if az < bz { a = a.ShiftRightVarTime(az) } else { b = b.ShiftRightVarTime(bz) } gcd, err := bigmod.NewNat().GCDVarTime(a, b) if err != nil { return nil, err } if gcd.IsOdd() == 0 { return nil, errors.New("rsa: internal error: gcd(a, b) is even")...