Tsz Ho Chan
University of Memphis
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Tsz Ho Chan.
European Journal of Combinatorics | 2011
Tsz Ho Chan
This paper is a continuation of previous work by Gyori, Sarkozy, and the author, concerning the maximal number of integers that can be selected from {1,2,...,N} so that none of them divides the product of k others.
International Journal of Number Theory | 2013
Tsz Ho Chan; Kai Man Tsang
In this paper, we study squarefull numbers in arithmetic progressions. We find the least such squarefull number by Dirichlets hyperbola method as well as Burgess bound on character sums. We also obtain a best possible almost all result via a large sieve inequality of Heath-Brown on real characters.
Integers | 2010
Tsz Ho Chan
Abstract An almost square of type 2 is an integer n that can be factored in two different ways as n = a 1 b 1 = a 2 b 2 with a 1, a 2, b 1, . In this paper, we continue the study of almost squares of type 2 in short intervals and improve the 1/2 upper bound. We also draw connections with almost squares of type 1.
International Journal of Number Theory | 2017
Tsz Ho Chan
In this paper, we study products of consecutive integers and prove an optimal bound on their greatest common factors. In contrast, we obtain a modest upper bound for the greatest common factor in the perfect square situation. Using this and an upper bound on the size of solutions to hyperelliptic curves, we prove a gap principle when a2(a2 + 1) divides b2(b2 + 1) with some additional restrictions. We also obtain a stronger gap principle under the abc conjecture.
International Journal of Number Theory | 2015
Tsz Ho Chan
In this paper, we consider a conjecture of Erdos and Rosenfeld and a conjecture of Ruzsa when the number is an almost square. By the same method, we consider lattice points of a circle close to the x-axis with special radii.
Journal of The Australian Mathematical Society | 2012
Tsz Ho Chan
A number is squareful if the exponent of every prime in its prime factorization is at least two. In this paper, we give, for a fixed
International Journal of Number Theory | 2006
Tsz Ho Chan
l
International Journal of Number Theory | 2017
Tsz Ho Chan
, the number of pairs of squareful numbers
Mathematika | 2016
Tsz Ho Chan
n
International Journal of Number Theory | 2013
Tsz Ho Chan
,