Multiplicative dependence in linear recurrences

We seek to estimate the number of s-tuples (i.e. a set of s numbers) from linear recurrences such that they are multiplicatively dependent.

David Nachuan Chen

The University of New South Wales

David Nachuan Chen is a third-year student at the University of New South Wales, majoring in Advanced Mathematics (Honours) and Computer Science. He has an extensive background in competitive mathematics, having competed in many national-level maths competitions such as the AIMO, AMO, ToT and AMOC Senior Contest. From these experiences, he has developed a special interest in number theory. Specifically, he specialises in linear recurrences, Diophantine equations and modular arithmetic. He will commence his honours year in 2027.

Outside of university, David tutors bright high school students who are seeking to enter mathematical olympiads. He also enjoys partaking in competitive programming competitions and playing badminton in his spare time.

You may be interested in

Tran Khanh Hung Giang

Tran Khanh Hung Giang

Design and analysis of bilevel optimisation algorithms
Sophie Giraudo

Sophie Giraudo

Statistical Analysis of Complex Proteomics Mass Spectrometry Data
Nelly Tucker

Nelly Tucker

Long memory random walks
Jack Mills

Jack Mills

Supercritical Percolation Cluster of Independent Bond Percolation of the Hypercube.
Contact Us

We're not around right now. But you can send us an email and we'll get back to you, asap.

Not readable? Change text.