#
Rankmult
--- Introduction ---

Rankmult
is an exercise on the multiplication of matrices:
one knows that if *C* is a matrix of size and
of rank *r*, then there exist two matrices *A* and *B*, of sizes
and respectively, such that *C* = *A* *B*.
**Remark.**
It's normal if you don't know a formula allowing you to ``compute''
*A* and *B* from *C*, as the solution
is not unique (in fact there are infinitely many solutions for each *C*).
What you need is a good dose of reflexion. Try first the case where
rank=1, which is rather easy.
For bigger ranks, computations of linear combinations of vectors will be
necessary in general.
The most recent version

**This page is not in its usual appearance because WIMS is unable to recognize your
web browser.**
Please take note that WIMS pages are interactively generated; they are not ordinary
HTML files. They must be used interactively ONLINE. It is useless
for you to gather them through a robot program.

- Description: find two matrices whose product is a given matrix. Serveur Wims de l'ESPE-Nice-Toulon - Université de Nice - Sophia Antipolis
- Keywords: interactive mathematics, interactive math, server side interactivity, algebra, linear_algebra, matrix, rank, vectors