Chai Wah Wu

collaborators

4 papers

math.NT2026

Faulhaber's formula, Bernoulli numbers, power sums of natural numbers and totatives and the functional equation $f (x) + x^{k} = f (x + 1)$

Chai Wah Wu

In modern usage the Bernoulli numbers and Bernoulli polynomials follow Euler's approach and are defined using generating functions. Originally, they were derived by Bernoulli while…

math.NT2026

Computing the Greatest Common Divisor of Binomial Coefficients $(mk mn)$

Chai Wah Wu

The greatest common divisor (GCD) of $(2 k 2 n)$ for $1 \leq k < n$ is known to be some power of 2 times the product of all odd primes p such that $2 n = p^{i} + p^{j}$ . We complete the a…

math.NT2025

Algorithms for complementary sequences

Chai Wah Wu

Finding the $n$ -th positive square number is easy, as it is simply $n^{2}$ . But how do we find the complementary sequence, i.e., the $n$ -th positive non-square number? For this case…

math.GM2025

Pandigital and penholodigital numbers

Chai Wah Wu

Pandigital and penholodigital numbers are numbers that contain every digit or nonzero digit respectively. We study properties of pandigital or penholodigital numbers that are also…

Faulhaber's formula, Bernoulli numbers, power sums of natural numbers and totatives and the functional equation f(x)+xk=f(x+1)

Computing the Greatest Common Divisor of Binomial Coefficients (mkmn​)

Algorithms for complementary sequences

Pandigital and penholodigital numbers

Faulhaber's formula, Bernoulli numbers, power sums of natural numbers and totatives and the functional equation $f (x) + x^{k} = f (x + 1)$

Computing the Greatest Common Divisor of Binomial Coefficients $(mk mn)$