On other two representations of the C-recursive integer sequences by terms in modular arithmetic

2024/06/10 by Mihai Prunescu, Prunescu, Mihai · 2 citations
Computer Science · Mathematics · #11B37 #11Y55 #39A06 #Benford’s Law and Fraud Detection #Computability, Logic, AI Algorithms #FOS: Mathematics #Mathematical and Theoretical Analysis #Number Theory (math.NT)

paper · pdf · doi:10.48550/arxiv.2406.06436

openalex publication_date 2024/06/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

An integer sequence that is defined by initial values and a linear recurrence with constant integer coefficients, can be represented by the difference of two arithmetic terms containing exponentiation. All constants occuring in the term are integers. While in the paper "On the representation of C-recursive integer sequences by arithmetic terms" by Prunescu and Sauras-Altuzarra, the terms consist of the remainder operation, applied on a division; the representations shown here are a division applied to a remainder operation, respectively the composition of two remainder operations.

Cited by

• Arithmetic closed forms count the Mersenne primes, the Fermat primes and the twin-prime pairs
• A Minimal Substitution Basis for the Kalmar Elementary Functions

Related

• On the representation of C-recursive integer sequences by arithmetic terms
• On modular representations of C-recursive integer sequences
• Arithmetic-Term Representations for the Greatest Common Divisor
• Recurrence Relations for Some Integer Sequences Related to Ward Numbers
• Integers represented by binary recursive sequences