Abstract
Let R be a ring and let N denote the set of nilpotent elements of R. Let n be a nonnegative integer. The ring R is called a θn‐ring if the number of elements in R which are not in N is at most n. The following theorem is proved: If R is a θn‐ring, then R is nil or R is finite. Conversely, if R is a nil ring or a finite ring, then R is a θn‐ring for some n. The proof of this theorem uses the structure theory of rings, beginning with the division ring case, followed by the primitive ring case, and then the semisimple ring case. Finally, the general case is considered.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Mathematics and Mathematical Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
