{"title":"具有两个斐波那契分量的马尔可夫三元组","authors":"F. Luca","doi":"10.4171/rsmup/99","DOIUrl":null,"url":null,"abstract":"In this paper, we prove that there are at most finitely many pairs of Fibonacci numbers (x, y) = (Fm, Fn) with the property that m ≤ n and the pair (m,n) 6∈ {(1, 2r− 1), (1, 2), (2, 2r+ 1), (2r+ 1, 2r+ 3) : r ≥ 1} such that (x, y, z) is a Markov triple for some integer z. Mathematics Subject Classification (2010). Primary: 11B39; Secondary: 11D61.","PeriodicalId":20997,"journal":{"name":"Rendiconti del Seminario Matematico della Università di Padova","volume":"40 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Markov triples with two Fibonacci components\",\"authors\":\"F. Luca\",\"doi\":\"10.4171/rsmup/99\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we prove that there are at most finitely many pairs of Fibonacci numbers (x, y) = (Fm, Fn) with the property that m ≤ n and the pair (m,n) 6∈ {(1, 2r− 1), (1, 2), (2, 2r+ 1), (2r+ 1, 2r+ 3) : r ≥ 1} such that (x, y, z) is a Markov triple for some integer z. Mathematics Subject Classification (2010). Primary: 11B39; Secondary: 11D61.\",\"PeriodicalId\":20997,\"journal\":{\"name\":\"Rendiconti del Seminario Matematico della Università di Padova\",\"volume\":\"40 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Rendiconti del Seminario Matematico della Università di Padova\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4171/rsmup/99\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Rendiconti del Seminario Matematico della Università di Padova","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4171/rsmup/99","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, we prove that there are at most finitely many pairs of Fibonacci numbers (x, y) = (Fm, Fn) with the property that m ≤ n and the pair (m,n) 6∈ {(1, 2r− 1), (1, 2), (2, 2r+ 1), (2r+ 1, 2r+ 3) : r ≥ 1} such that (x, y, z) is a Markov triple for some integer z. Mathematics Subject Classification (2010). Primary: 11B39; Secondary: 11D61.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
