Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Number Theory
Exact Formulas For Restricted Coprime Representations Of Even Integers, Andres Mauricio Salazar
Exact Formulas For Restricted Coprime Representations Of Even Integers, Andres Mauricio Salazar
Communications on Number Theory and Combinatorial Theory
Let p ≥ 5 be prime, and let g(2n,p) denote the number of unordered representations by positive integers 2n = h + k, with h ≤ k and gcd(h,6p) = gcd(k,6p) = 1. Every positive integer coprime to 6 belongs to exactly one of the families 6z + 1 and 6z + 5. In each family, divisibility by p excludes one explicit residue class of z modulo p. We use these two excluded classes to derive an exact formula for g(2n,p) from finite residue counts and nonnegative lift counts. The formula is valid for every positive integer n, including all …
Meertens Number And Its Variations, Chai Wah Wu
Meertens Number And Its Variations, Chai Wah Wu
Communications on Number Theory and Combinatorial Theory
In 1998, Bird introduced Meertens numbers as numbers that are invariant under a map similar to the Gödel encoding. In base 10, the only known Meertens number is 81312000. We look at some properties of Meertens numbers and consider variations of this concept. In particular, we consider variations of Meertens numbers where there is a finite time algorithm to decide whether such numbers exist, exhibit infinite families of these variations and provide bounds on parameters needed for their existence.
Generating B-Nomial Numbers, Ji Young Choi
Generating B-Nomial Numbers, Ji Young Choi
Communications on Number Theory and Combinatorial Theory
This paper presents three new ways to generate each type of b-nomial numbers: We develop ordinary generating functions, we find a whole new set of recurrence relations, and we identify each b-nomial number as a single binomial coefficient or as an alternating sum of products of two binomial coefficients.