Quadratic sequences with prime power discriminators

09/07/2022
by   Sajed Haque, et al.
0

The discriminator of an integer sequence s = (s(i))_i ≥ 0, introduced by Arnold, Benkoski, and McCabe in 1985, is the function D_s (n) that sends n to the least integer m such that the numbers s(0), s(1), …, s(n - 1) are pairwise incongruent modulo m. In this note, we try to determine all quadratic sequences whose discriminator is given by p^⌈log_p n ⌉ for prime p, i.e., the smallest power of p which is ≥ n. We determine all such sequences for p = 2, show that there are none for p ≥ 5, and provide some partial results for p = 3.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/11/2019

On the 2-Adic Complexity of the Ding-Helleseth-Martinsen Binary Sequences

We determine the 2-adic complexity of the Ding-Helleseth-Martinsen (DHM)...
research
01/17/2022

On digital sequences associated with Pascal's triangle

We consider the sequence of integers whose nth term has base-p expansion...
research
09/19/2022

Natural Wave Numbers, Natural Wave Co-numbers, and the Computation of the Primes

The paper exploits an isomorphism between the natural numbers N and a sp...
research
10/09/2019

Implementation of irreducible Sobol sequences in prime power bases

We present different implementations for the irreducible Sobol (IS) sequ...
research
05/23/2011

A Tool for Integer Homology Computation: Lambda-At Model

In this paper, we formalize the notion of lambda-AT-model (where λ is a ...
research
06/23/2020

Discrete correlations of order 2 of generalised Rudin-Shapiro sequences: a combinatorial approach

We introduce a family of block-additive automatic sequences, that are ob...
research
03/16/2023

The Membership Problem for Hypergeometric Sequences with Quadratic Parameters

Hypergeometric sequences are rational-valued sequences that satisfy firs...

Please sign up or login with your details

Forgot password? Click here to reset