English
Related papers

Related papers: On digital sequences associated with Pascal's tria…

200 papers

The aim of this paper is to find a general formula to generate any row of Pascal's triangle as an extension of the concept of $\left(11\right)^{n}$. In this study, the visualization of each row of Pascal's triangle has been presented by…

History and Overview · Mathematics 2021-08-24 Md. Shariful Islam , Md. Robiul Islam , Md. Shorif Hossan , Md. Hasan Kibria

This is an exposition, for pedagogical purposes, of the formal power series proof of Bostan, Christol and Dumas [3] of the result stated in the title (a corollary of the Christol theorem).

Combinatorics · Mathematics 2016-05-20 Martin Klazar

A classical problem in analytic number theory is to study the distribution of fractional part $\alpha p^k+\beta,\,k\ge 1$ modulo 1, where $\alpha$ is irrational and $p$ runs over the set of primes. For $k=2$ we consider the subsequence…

Number Theory · Mathematics 2024-04-05 T. L. Todorova

Let $pod_{\ell}(n)$ be the number of $\ell$-regular partitions of $n$ with distinct odd parts. In this article, prove that for any positive integer $k$, the set of non-negative integers $n$ for which $pod_{\ell}(n)\equiv 0 \pmod{p^{k}}$ has…

Number Theory · Mathematics 2021-09-22 Chiranjit Ray

If the list of binary numbers is read by upward-sloping diagonals, the resulting ``sloping binary numbers'' 0, 11, 110, 101, 100, 1111, 1010, ... (or 0, 3, 6, 5, 4, 15, 10, ...) have some surprising properties. We give formulae for the n-th…

Number Theory · Mathematics 2016-08-16 David Applegate , Benoit Cloitre , Philippe Deléham , N. J. A. Sloane

We generalize the geometric sequence $\{a^p, a^{p-1}b, a^{p-2}b^2,...,b^p\}$ to allow the $p$ copies of $a$ (resp. $b$) to all be different. We call the sequence $\{a_1a_2a_3\cdots a_p, b_1a_2a_3\cdots a_p, b_1b_2a_3\cdots a_p,\ldots,…

Commutative Algebra · Mathematics 2018-08-15 Claire Kiers , Christopher O'Neill , Vadim Ponomarenko

If $p$ is prime, a sequence of prime numbers $\{p, 2p+1, 4p+3,...,2^{n-1}(p+1)-1\}$ is called a Cunningham chain. These are finite sequences of prime numbers, for which each element but the last is a Sophie Germain prime. It is conjectured…

Number Theory · Mathematics 2023-11-23 Anand Bhardwaj , Luisa Degen , Radostin Petkov , Sidney Stanbury

Denote by p_k the k-th power sum symmetric polynomial n variables. The interpretation of the q-analogue of the binomial coefficient as Hilbert function leads us to discover that n consecutive power sums in n variables form a regular…

Commutative Algebra · Mathematics 2018-08-30 Aldo Conca , Christian Krattenthaler , Junzo Watanabe

We investigate certain finiteness questions that arise naturally when studying approximations modulo prime powers of p-adic Galois representations coming from modular forms. We link these finiteness statements with a question by K. Buzzard…

Number Theory · Mathematics 2017-05-17 Ian Kiming , Nadim Rustom , Gabor Wiese

The well-known expansion of rational integers in an arbitrary integer base different from $0, 1, -1$ is exploited to study relations between numerical monoids and certain subsemigroups of the multiplicative semigroup of nonzero integers.

Number Theory · Mathematics 2019-10-23 Horst Brunotte

Wolstenholme's type summations involve certain powers of all residues $k$ modulo some prime number $p$. We first consider the sums of double or triple products of certain powers of all residues, e.g., the sums of the terms $(a+k)^m(b+k)^n$…

Number Theory · Mathematics 2024-08-22 Zubeyir Cinkir

Let p be a prime = 3 (mod 4). A number of elegant number-theoretical properties of the sums T(p) = \sqrt{p}sum_{n=1}^{(p-1)/2} tan(n^2\pi/p) and C(p) = \sqrt{p}sum_{n=1}^{(p-1)/2} cot(n^2\pi/p) are proved. For example, T(p) equals p times…

Number Theory · Mathematics 2012-05-21 A. Laradji , M. Mignotte , N. Tzanakis

We consider the $k$-error linear complexity of binary sequences derived from Eluer quotients modulo $2p$ ($p>3$ is an odd prime), recently introduced by J. Zhang and C. Zhao. We adopt certain decimal sequences to determine the values of…

Cryptography and Security · Computer Science 2019-10-11 Chenhuang Wu , Vladimir Edemskiy , Chunxiang Xu

For a prime number p, we construct a generating set for the ring of invariants for the p+1 dimensional indecomposable modular representation of a cyclic group of order p^2. We then use the constructed invariants to describe the…

Commutative Algebra · Mathematics 2007-06-13 R. J. Shank , D. L. Wehlau

The Pascal rhombus is a variant of Pascal's triangle in which each term is a sum of four earlier terms. Klostermeyer et al. made four conjectures about the Pascal rhombus modulo 2. In this paper we show how exploration of the stealth shape…

Combinatorics · Mathematics 2015-04-20 Paul K. Stockmeyer

For a prime number p, we characterize the groups that may arise as torsion subgroups of an elliptic curve with complex multiplication defined over a number field of degree 2p. In particular, our work shows that a classification in the…

Number Theory · Mathematics 2022-06-09 Abbey Bourdon , Holly Paige Chaos

Consider a strongly $b$-multiplicative sequence and a prime $p$. Studying its $p$-rarefaction consists in characterizing the asymptotic behaviour of the sums of the first terms indexed by the multiples of $p$. The integer values of the…

Number Theory · Mathematics 2016-02-10 Alexandre Aksenov

Let $p$ be a prime and let $K$ be a finite extension of the field ${\bf Q}_p$ of $p$-adic numbers such that the group ${}_pK^\times$ has order $p$. The ${\bf F}_p$-space $K^\times\!/K^{\times p}$ carries a natural filtration coming from the…

Number Theory · Mathematics 2016-09-06 Chandan Singh Dalawat

It is well-known that for any non-constant polynomial $P$ with integer coefficients the sequence $(P(n))_{ n\in \mathbb N}$ has the property that there are infinitely many prime numbers dividing at least one term of this sequence.…

Number Theory · Mathematics 2016-02-08 Tigran Hakobyan

We estimate the frequency of singular matrices and of matrices of a given rank whose entries are parametrised by arbitrary polynomials over the integers and modulo a prime $p$. In particular, in the integer case, we improve a recent bound…

Number Theory · Mathematics 2023-10-20 Ali Mohammadi , Alina Ostafe , Igor Shparlinski