2 citations · 4 across the 4 of their papers we have counts for
4 papers
Finding Prime Numbers as Fixed Points of Sequences
Enrique Navarrete, Daniel Orellana
In this note we describe a method for finding prime numbers as fixed points of particularly simple sequences. Some basic calculations show that success rates for identifying primes…
Forbidden Substrings In Circular K-Successions
Enrique Navarrete
In this note we define circular k-successions in permutations in one-line notation and count permutations that avoid substrings j(j+k) and j(j+k) (mod n). We also count circular pe…
Forbidden Patterns and the Alternating Derangement Sequence
Enrique Navarrete
In this note we count linear arrangements that avoid certain patterns and show their connection to the derangement numbers. We discuss the sequence Dn, which counts linear arrangem…
Generalized K-Shift Forbidden Substrings in Permutations
Enrique Navarrete
In this note we continue the analysis of permutations that avoid substrings j(j+k), 1 <= j <= n-k, k < n, as well as substrings j(j+k) (mod n), 1 <= j <= n. In the first case the n…