Abstract
We obtain a lower bound for e( n), the least integer (greater than or equal to 5) that is not the exponent of any nX n primitive, nearly reducible matrix. The main result is that under certain hypotheses about the distance between n and the nearest prime number we have that e( n)> n 2⧸3.
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 callDisclaimer: 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.
