{"title":"关于阶乘和s单位的皮莱问题的一个变体","authors":"Bernadette Faye, Florian Luca, Volker Ziegler","doi":"10.1007/s11139-023-00787-1","DOIUrl":null,"url":null,"abstract":"Abstract Let S be a finite, fixed set of primes. In this paper, we show that the set of integers c which have at least two representations as a difference between a factorial and an S -unit is finite and effectively computable. In particular, we find all integers that can be written in at least two ways as a difference of a factorial and an S -unit associated with the set of primes $$\\{2,3,5,7\\}$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mo>{</mml:mo> <mml:mn>2</mml:mn> <mml:mo>,</mml:mo> <mml:mn>3</mml:mn> <mml:mo>,</mml:mo> <mml:mn>5</mml:mn> <mml:mo>,</mml:mo> <mml:mn>7</mml:mn> <mml:mo>}</mml:mo> </mml:mrow> </mml:math> .","PeriodicalId":54511,"journal":{"name":"Ramanujan Journal","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On a variant of Pillai’s problem with factorials and S-units\",\"authors\":\"Bernadette Faye, Florian Luca, Volker Ziegler\",\"doi\":\"10.1007/s11139-023-00787-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract Let S be a finite, fixed set of primes. In this paper, we show that the set of integers c which have at least two representations as a difference between a factorial and an S -unit is finite and effectively computable. In particular, we find all integers that can be written in at least two ways as a difference of a factorial and an S -unit associated with the set of primes $$\\\\{2,3,5,7\\\\}$$ <mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\"> <mml:mrow> <mml:mo>{</mml:mo> <mml:mn>2</mml:mn> <mml:mo>,</mml:mo> <mml:mn>3</mml:mn> <mml:mo>,</mml:mo> <mml:mn>5</mml:mn> <mml:mo>,</mml:mo> <mml:mn>7</mml:mn> <mml:mo>}</mml:mo> </mml:mrow> </mml:math> .\",\"PeriodicalId\":54511,\"journal\":{\"name\":\"Ramanujan Journal\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ramanujan Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s11139-023-00787-1\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ramanujan Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s11139-023-00787-1","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
On a variant of Pillai’s problem with factorials and S-units
Abstract Let S be a finite, fixed set of primes. In this paper, we show that the set of integers c which have at least two representations as a difference between a factorial and an S -unit is finite and effectively computable. In particular, we find all integers that can be written in at least two ways as a difference of a factorial and an S -unit associated with the set of primes $$\{2,3,5,7\}$$ {2,3,5,7} .
期刊介绍:
The Ramanujan Journal publishes original papers of the highest quality in all areas of mathematics influenced by Srinivasa Ramanujan. His remarkable discoveries have made a great impact on several branches of mathematics, revealing deep and fundamental connections.
The following prioritized listing of topics of interest to the journal is not intended to be exclusive but to demonstrate the editorial policy of attracting papers which represent a broad range of interest:
Hyper-geometric and basic hyper-geometric series (q-series) * Partitions, compositions and combinatory analysis * Circle method and asymptotic formulae * Mock theta functions * Elliptic and theta functions * Modular forms and automorphic functions * Special functions and definite integrals * Continued fractions * Diophantine analysis including irrationality and transcendence * Number theory * Fourier analysis with applications to number theory * Connections between Lie algebras and q-series.