David Nachuan Chen
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
Matthew Cochran
Low-diameter Networks for Applications on High Performance Computing and Communication Networks
