{"title":"Brocard-Ramanujan problem for polynomials over finite fields","authors":"Wataru Takeda","doi":"10.1016/j.ffa.2025.102731","DOIUrl":null,"url":null,"abstract":"<div><div>The Brocard-Ramanujan problem is an unsolved number theory problem to find integer solutions <span><math><mo>(</mo><mi>x</mi><mo>,</mo><mi>n</mi><mo>)</mo></math></span> to <span><math><msup><mrow><mi>x</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>−</mo><mn>1</mn><mo>=</mo><mi>n</mi><mo>!</mo></math></span>. In this paper, we consider this problem over polynomial rings <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub><mo>[</mo><mi>T</mi><mo>]</mo></math></span>, where <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub></math></span> is a finite field with <em>q</em> elements. We find all solutions to the equation <span><math><msup><mrow><mi>X</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>−</mo><mn>1</mn><mo>=</mo><msub><mrow><mi>Π</mi></mrow><mrow><mi>C</mi></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo></math></span>, where <span><math><msub><mrow><mi>Π</mi></mrow><mrow><mi>C</mi></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo></math></span> denotes the Carlitz factorial. More precisely, we characterize all solutions and prove that there are infinitely many solutions if and only if <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub></math></span> is an extension of <span><math><msub><mrow><mi>F</mi></mrow><mrow><mn>4</mn></mrow></msub></math></span>. This characterization is achieved without using the Mason-Stothers theorem, analogous to the abc conjecture for integers.</div></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"110 ","pages":"Article 102731"},"PeriodicalIF":1.2000,"publicationDate":"2025-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Finite Fields and Their Applications","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1071579725001613","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
The Brocard-Ramanujan problem is an unsolved number theory problem to find integer solutions to . In this paper, we consider this problem over polynomial rings , where is a finite field with q elements. We find all solutions to the equation , where denotes the Carlitz factorial. More precisely, we characterize all solutions and prove that there are infinitely many solutions if and only if is an extension of . This characterization is achieved without using the Mason-Stothers theorem, analogous to the abc conjecture for integers.
期刊介绍:
Finite Fields and Their Applications is a peer-reviewed technical journal publishing papers in finite field theory as well as in applications of finite fields. As a result of applications in a wide variety of areas, finite fields are increasingly important in several areas of mathematics, including linear and abstract algebra, number theory and algebraic geometry, as well as in computer science, statistics, information theory, and engineering.
For cohesion, and because so many applications rely on various theoretical properties of finite fields, it is essential that there be a core of high-quality papers on theoretical aspects. In addition, since much of the vitality of the area comes from computational problems, the journal publishes papers on computational aspects of finite fields as well as on algorithms and complexity of finite field-related methods.
The journal also publishes papers in various applications including, but not limited to, algebraic coding theory, cryptology, combinatorial design theory, pseudorandom number generation, and linear recurring sequences. There are other areas of application to be included, but the important point is that finite fields play a nontrivial role in the theory, application, or algorithm.