{"title":"Reverse engineered Diophantine equations","authors":"Stevan Gajović","doi":"10.1016/j.exmath.2024.125545","DOIUrl":null,"url":null,"abstract":"<div><p>We answer a question of Samir Siksek, asked at the open problems session of the conference “Rational Points 2022”, which, in a broader sense, can be viewed as a reverse engineering of Diophantine equations. For any finite set <span><math><mi>S</mi></math></span> of perfect integer powers, using Mihăilescu’s theorem, we construct a polynomial <span><math><mrow><msub><mrow><mi>f</mi></mrow><mrow><mi>S</mi></mrow></msub><mo>∈</mo><mi>Z</mi><mrow><mo>[</mo><mi>x</mi><mo>]</mo></mrow></mrow></math></span> such that the set <span><math><mrow><msub><mrow><mi>f</mi></mrow><mrow><mi>S</mi></mrow></msub><mrow><mo>(</mo><mi>Z</mi><mo>)</mo></mrow></mrow></math></span> contains a perfect integer power if and only if it belongs to <span><math><mi>S</mi></math></span>. We first discuss the easier case where we restrict to all powers with the same exponent. In this case, the constructed polynomials are inspired by Runge’s method and Fermat’s Last Theorem. Therefore we can construct a polynomial–exponential Diophantine equation whose solutions are determined in advance.</p></div>","PeriodicalId":50458,"journal":{"name":"Expositiones Mathematicae","volume":null,"pages":null},"PeriodicalIF":0.8000,"publicationDate":"2024-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Expositiones Mathematicae","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0723086924000124","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
We answer a question of Samir Siksek, asked at the open problems session of the conference “Rational Points 2022”, which, in a broader sense, can be viewed as a reverse engineering of Diophantine equations. For any finite set of perfect integer powers, using Mihăilescu’s theorem, we construct a polynomial such that the set contains a perfect integer power if and only if it belongs to . We first discuss the easier case where we restrict to all powers with the same exponent. In this case, the constructed polynomials are inspired by Runge’s method and Fermat’s Last Theorem. Therefore we can construct a polynomial–exponential Diophantine equation whose solutions are determined in advance.
期刊介绍：
Our aim is to publish papers of interest to a wide mathematical audience. Our main interest is in expository articles that make high-level research results more widely accessible. In general, material submitted should be at least at the graduate level.Main articles must be written in such a way that a graduate-level research student interested in the topic of the paper can read them profitably. When the topic is quite specialized, or the main focus is a narrow research result, the paper is probably not appropriate for this journal. Most original research articles are not suitable for this journal, unless they have particularly broad appeal.Mathematical notes can be more focused than main articles. These should not simply be short research articles, but should address a mathematical question with reasonably broad appeal. Elementary solutions of elementary problems are typically not appropriate. Neither are overly technical papers, which should best be submitted to a specialized research journal.Clarity of exposition, accuracy of details and the relevance and interest of the subject matter will be the decisive factors in our acceptance of an article for publication. Submitted papers are subject to a quick overview before entering into a more detailed review process. All published papers have been refereed.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
