MHB What are the correcting words for matrices with equal integral entries?

[cbarker1]

Dear Everyone,

I am trying to figure what is the correct phrase in the bolden phrase. The article, where I am doing my research on, states: Let S be the set of all 2x2 matrices with equal positive integral entries. Let T be the set of all 2x2 matrices with equal integral entries. My professors are getting frustrated due to the circle effect that I am making the same error over many times. So what is the correcting words that fixed? Is it "having" or other words.

Beginning:

Different algebraic systems raise many questions. For instance, can the elements in a given system always be factored into primes? If so, what theorems can help factoring the elements? Are the factors unique? The poster will discuss the answers to these questions through examples and theorems for a class of $2\times2$ matrices with equal integers entries.
Let $S$ be the set of all $2\times2$ matrices with equal positive integers entries.

Conclusion:
The elements of the set $T$ can always be factored; however, most of the elements in the set $T$ are not uniquely factorable. There are theorems that can assist in determining the factorization of elements of $T$. Future investigation might include studying whether there are similar theorems for each class of $n\times n$ matrices with equal integers entries.
Thanks,
Cbarker1

 

[Greg]

Re: writing a correction phrase in a poster

Dear Fellow Members,

I am trying to figure out how to correct the bold phrases below. The article on which I am doing my research states: Let $S$ be the set of all 2x2 matrices with equal positive integral entries and let $T$ be the set of all 2x2 matrices with equal integral entries. My professors are getting frustrated due to the circular effect that I am creating. I am making the same error many times. So how do I fix these? Do I use "having" or another word?

Beginning:

Different algebraic systems raise many questions. For instance, can the elements in a given system always be factored into primes? If so, what theorems can help factor the elements? Are the factors unique? The poster will discuss the answers to these questions through examples and theorems for a class of 2x2 matrices with equal integer entries.

Let $S$ be the set of all 2x2 matrices with equal positive integer entries.

Conclusion:
The elements of the set $T$ can always be factored; however, most of the elements in the set $T$ are not uniquely factorisable. There are theorems that can assist in determining the factorisation of the elements of $T$. Future investigation might include studying whether there are similar theorems for each class of nxn matrices with equal integer entries.

Hi CBarker1.

Above is a corrected version of the material in your original post. Compare the two and ask questions about anything you need clarification on.