$11^{-1}$ modulo $91$ is $58$. Why? I am reading wiki article about Quadratic Sieve and it says
$11^{-1}$ modulo $91$ is $58$ 
Why? How is it been calculated?

The reason $58 = 11^{-1} \pmod{91}$ is 
$$58 \cdot 11 = 638 = 7 \cdot 91 + 1 \implies 58 \cdot 11 \equiv 638 \equiv 1 \pmod{91}$$
The reason $11$ has an inverse $\pmod{91}$ is that $\gcd(11, 91) = 1$.  
To calculate the inverse, we use the extended Euclidean algorithm. First, we use the Euclidean Algorithm to solve for $\gcd(11, 91)$.
\begin{align*}
91 & = 8 \cdot 11 + 3\\
11 & = 3 \cdot 3 + 2\\
3 & = 1 \cdot 2 + 1\\
2 & = 2 \cdot 1
\end{align*}
Working backwards, we express $1$ as a linear combination of $11$ and $91$.
\begin{align*}
1 & = 3 - 1 \cdot 2\\
  & = 3 - 1(11 - 3 \cdot 3)\\
  & = 4 \cdot 3 - 1 \cdot 11\\
  & = 4(91 - 8 \cdot 11) - 1 \cdot 11\\
  & = 4 \cdot 91 - 33 \cdot 11
\end{align*}
Hence, 
$$-33 \cdot 11 = 1 - 4 \cdot 91 \implies -33 \cdot 11 \equiv 1 \pmod{91}$$
Thus, $-33 \equiv 11^{-1} \pmod{91}$.  Moreover, any number of the form $-33 + 91t$ is an inverse of $11 \pmod{91}$ since 
$$
11(-33 + 91t) = -363 + 11t \cdot 91 = 1 - 364 + 11t \cdot 91 = 1 + 91(11t - 4)$$ 
Thus, $11(-33 + 91t) \equiv 1 \pmod{91} \implies -33 + 91t \equiv 11^{-1} \pmod{91}$.
In particular, if $t = 1$, we obtain 
$$11^{-1} \equiv -33 + 91 \equiv 58 \pmod{91}$$ 
