Related papers: Tabulating Absolute Lucas Pseudoprimes
Let $\Gamma\subset \bar{\Q}^{\times}$ be a finitely generated multiplicative group of algebraic numbers, let $\alpha_1,\ldots,\alpha_m$ be non-zero algebraic numbers, and let $\varepsilon >0$ be fixed. In this paper, we prove that there…
Randomized algorithms are often enjoyed for their simplicity, but the hash functions employed to yield the desired probabilistic guarantees are often too complicated to be practical. Here we survey recent results on how simple hashing…
This (partly expository) paper originated from the study of Hankel determinants of convolution powers of Catalan numbers and of Narayana polynomials. This led to some Hankel determinants of signed Catalan numbers whose values are multiples…
In 1977 Pohst conjectured a certain inequality for $n$ variables and give a computer-assisted proof for $n\leq 10$. We give a proof for all $n$ using a combinatorial argument. This inequality yields a better bound for the regulator in terms…
Let $(L_n)_{n \geq 1}$ be the sequence of Lucas numbers, defined recursively by $L_1 := 1$, $L_2 := 3$, and $L_{n + 2} := L_{n + 1} + L_n$, for every integer $n \geq 1$. We determine the asymptotic behavior of $\log \operatorname{lcm} (L_1…
We will describe an algorithm to arrange all the positive and negative integer numbers. This array of numbers permits grouping them in six different Classes, $\alpha$, $\beta$, $\gamma$, $\delta$, $\epsilon$, and $\zeta$. Particularly,…
We study the existence of primes and of primitive divisors in classical divisibility sequences defined over function fields. Under various hypotheses, we prove that Lucas sequences and elliptic divisibility sequences over function fields…
We describe an explicit generalized Lucasian test to determine the primality of numbers $h\cdot2^n\pm1$ when $h\nequiv0\pmod{17}$. This test is by means of fixed seeds which depend only on $h$. In particular when $h=16^m-1$ with $m$ odd,…
A pair of probability distributions over $\{0,1\}^n$ is said to be $(k,\delta)$-wise indistinguishable if all of the size $k$ marginals are within statistical distance at most $\delta$. Previous works introduced this concept and study when…
In this paper, we extend the $p$-adic valuations of the M\"obius duals of Lucas sequences, originally obtained by Carmichael for regular Lucas sequences to irregular Lucas sequences. We conclude with a brief observation about the…
In this paper we prove three conjectures on congruences involving central binomial coefficients or Lucas sequences. Let $p$ be an odd prime and let $a$ be a positive integer. We show that if $p\equiv 1\pmod{4}$ or $a>1$ then $$…
Together with David Schlang we computed the discriminants of the invariant Hermitian forms for all indicator $o$ even degree absolutely irreducible characters of the ATLAS groups supplementing the tables of orthogonal determinants computed…
A total prime labeling of a graph of order $n$ is an extension of a prime labeling in which we distinctly label the vertices and edges. The goal of the labeling is for adjacent vertex labels to be relatively prime, and for each vertex of…
An explicit Dirichlet series is obtained, which represents an analytic function of $s$ in the half-plane $\Re s>1/2$ except for having simple poles at points $s_j$ that correspond to exceptional eigenvalues $\lambda_j$ of the non-Euclidean…
In previous work on Clebsch-Gordan coefficients, certain remarkable hexagonal arrays of integers are constructed that display behaviors found in Pascal's Triangle. We explain these behaviors further using the binomial transform and discrete…
Prime numbers have attracted the attention of mathematiciansand enthusiasts for millenniums due to their simple definition and remarkable properties. In this paper, we study primorial numbers (the product of the first prime numbers) to…
Hierarchical Archimedean copulas (HACs) are multivariate uniform distributions constructed by nesting Archimedean copulas into one another, and provide a flexible approach to modeling non-exchangeable data. However, this flexibility in the…
The Baillie-PSW primality test combines Fermat and Lucas probable prime tests. It reports that a number is either composite or probably prime. No odd composite integer has been reported to pass this combination of primality tests if the…
This paper first proves what the author called the Eight Levels Theorem and then highlights a new explicit expansion approach to Lucas-Lehmer primality test for Mersenne primes and gives a new criterion for Mersenne compositeness. Also, we…
Repdigits are natural numbers formed by the repetition of a single digit. In this paper, we study the problem of writing repdigits as the difference of two balancing or Lucas-balancing numbers. The method of proof involves the application…