Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 134 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 23 tok/s Pro
GPT-5 High 32 tok/s Pro
GPT-4o 101 tok/s Pro
Kimi K2 179 tok/s Pro
GPT OSS 120B 435 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

On irreducible polynomials over finite fields (1210.1562v2)

Published 4 Oct 2012 in math.NT and math.CO

Abstract: For n=1,2,3,... let N_n(q) denote the number of monic irreducible polynomials over the finite field F_q. We mainly show that the sequence N_n(q){1/n} (n>e{3+7/(q-1)2}) is strictly increasing and the sequence N_{n+1}(q){1/(n+1)}/N_n(q){1/n} (n>=5.835*10{14}) is strictly decreasing. We also prove that if q>8 then N_{n+1}(q)/N_n(q) (n=1,2,3,...) is strictly increasing.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.