# Thread:

1. ## Consistency of a matrix

Hi guys,

My problem states:

Let $A$ be an augmented matrix of size m x m+1 (that is to say, the coefficient matrix of the system is square and of size m x m), and $A$ has all non-zero entires. Prove or disprove that this system is consistent and, in fact, has one and only one solution.

Any quick hints as to how to start this problem?

Thanks!
James

2. Originally Posted by james121515
Hi guys,

My problem states:

Let $A$ be an augmented matrix of size m x m+1 (that is to say, the coefficient matrix of the system is square and of size m x m), and $A$ has all non-zero entires. Prove or disprove that this system is consistent and, in fact, has one and only one solution.

Any quick hints as to how to start this problem?

Thanks!
James
If you are unsure whether or not a result is true, the best way to start is by experimenting with simple examples. In this case, take m=2, so that you are looking at 2x3 matrices. If such a matrix has all nonzero entries, does it necessarily represent a consistent system with only one solution?
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 4, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9451779723167419, "perplexity_flag": "head"}