汕头大学数学系

学术报告

当前位置: 首页 >> 科学研究 >> 学术报告 >> 正文
Big prime factors of linear recurrent sequences
日期: 2024-04-02      信息来源:      点击数:

走向现代数学学术报告 - 洪豪杰博士(No. 691)

报告题目: Big prime factors of linear recurrent sequences

报告人:洪豪杰 博士(法国波尔多大学)

报告时间:2024年4月3日 16:00

腾讯会议ID:855-913-468

报告摘要: Lucas sequences Un are the second-order simple non-degenerated linear recurrent sequences with the first two terms being U0=0 and U1=1. The Fibonacci sequence is a typical example. The divisibility properties of such sequences have been studied by Euler, Lagrange, Gauss, Dirichlet and others. Let Pn be the largest prime factor of Un. In 2013, Stewart proved that Pn grows faster than n. In this talk, I will present Stewart's theorem and some results we have obtained.

报告人简介:洪豪杰,法国波尔多大学在读博士生,研究方向为数论。目前主要从事线性递推序列、丢番图方程方面的研究,在Acta Arithmetica、Publicationes Mathematicae Debrecen等期刊上发表论文三篇。

广东省汕头市翠峰路5号,汕头大学数学系 515821,Email:math@stu.edu.cn

Copyright 2003-2023 汕头大学数学系