Hagen von Eitzen's answer gives a neat theoretical approach of this problem. However, I would like to expose a constructive and computational way to find the radius and center of the $(n-1)$-sphere determined by $n+1$ suitable points in $\mathbb{R}^n$.
Let $n$ be an integer greater than $1$ and let say $x_i:=(x_{i,j})_{j\in\{1,\cdots,n\}},i\in\{0,\cdots,n\}$ are $n+1$ given points. Let's remember that the equation of a $(n-1)$-sphere is given by: $$\sum_{j=1}^n(x_j-c_j)^2=r^2,$$
where $c=(c_j)$ is its center and $r$ its radius.
Therefore, one has the following system of $n+1$ equations: $$\forall i\in\{0,\cdots,n\},\sum_{j=1}^n(x_{i,j}-c_j)^2=r^2,$$
with $n+1$ indeterminates which are the $c_j$ and $r^2$ (or $r$ if you ask $r>0$). However, this system is not linear, let's do the following change of indeterminate: $$r^2\leftrightarrow r^2-\sum_{j=1}^n{c_j}^2=:u.$$
Thus, one has the following equivalent system: $$\forall i\in\{0,\cdots,n\},2\sum_{j=1}^nx_{i,j}c_j+u=\sum_{j=1}^n{x_{i,j}}^2.$$
Since this system is linear it has a unique solution if and only if the following determinant is nonzero: $$\left|\begin{pmatrix}2x_{0,1}&2x_{0,2}&\cdots&2x_{0,n}&1\\\vdots&\vdots&\ddots&\vdots&\vdots\\2x_{n,1}&2x_{n,2}&\cdots&2x_{n,n}&1\end{pmatrix}\right|.$$
Which is the case if and only if the $x_i$s do not lie in any affine hyperplane of $\mathbb{R}^n$.