Related papers: An explicit generating function arising in countin…

Counting functions are constructed for sums of integers raised to a fixed positive rational power. That is, given values formed by $u_1^{j/k} + u_2^{j/k} + ... + u_l^{j/k}$, $u_i \in \mathbb{Z}^+$, the number of values less than or equal to…

For a positive integer $n$ let $\mathfrak{P}_n=\prod_{s_p(n)\ge p} p,$ where $p$ runs over all primes and $s_p(n)$ is the sum of the base $p$ digits of $n$. For all $n$ we prove that $\mathfrak{P}_n$ is divisible by all "small" primes with…

For an odd prime $p$ and an integer $w\ge 1$, polynomial quotients $q_{p,w}(u)$ are defined by $$ q_{p,w}(u)\equiv \frac{u^w-u^{wp}}{p} \bmod p ~~ \mathrm{with}~~ 0 \le q_{p,w}(u) \le p-1, ~~u\ge 0, $$ which are generalizations of Fermat…

We study the asymptotics and fine-scale behavior of quantitative combinatorial measures of infinite words and related dynamical and algebraic structures. We construct infinite recurrent words $w$ whose complexity functions $p_w(n)$ are…

We show that for every $r \geq 1$, and all $r$ distinct (sufficiently large) primes $p_1,..., p_r > p_0(r)$, there exist infinitely many integers $n$ such that ${2n \choose n}$ is divisible by these primes to only low multiplicity. From a…

By using the Newton interpolation formula, we generalize the recent identities on the Catalan triangle obtained by Miana and Romero as well as those of Chen and Chu. We further study divisibility properties of sums of products of binomial…

Rowland found a matrix product formula for generating functions counting binomial coefficients by their $p$-adic valuations. A natural generalization of binomial coefficients was introduced by Knuth and Wilf defined by a sequence $C$. We…

This paper examines the recursive sequence of polynomials $p_n(x)$, defined by $p_0(x) = x^2 - 2$ and $p_n(x) = p_{n-1}(x)^2 - 2$ for $n \geq 1$. It describes the field-theoretic motivations behind this sequence, derives a recursive formula…

In this article we present applications of smooth numbers to the unconditional derandomization of some well-known integer factoring algorithms. We begin with Pollard's $p-1$ algorithm, which finds in random polynomial time the prime…

We prove a conjecture of Bourn and Willenbring (2020) regarding the palindromicity and unimodality of a certain family of polynomials $N_n(t)$. These recursively defined polynomials arise as the numerators of generating functions in the…

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…

Finding an irreducible factor, of a polynomial $f(x)$ modulo a prime $p$, is not known to be in deterministic polynomial time. Though there is such a classical algorithm that {\em counts} the number of irreducible factors of $f\bmod p$. We…

Let $C(n,p)$ be the set of $p$-compositions of an integer $n$, i.e., the set of $p$-tuples $\bm{\alpha}=(\alpha_1,...,\alpha_p)$ of nonnegative integers such that $\alpha_1+...+\alpha_p=n$, and $\mathbf{x}=(x_1,...,x_p)$ a vector of…

Given $k, \ell \in {\bf N}^+$, let $x_{i,j}$ be, for $1 \le i \le k$ and $0 \le j \le \ell$, some fixed integers, and define, for every $n \in {\bf N}^+$, $s_n := \sum_{i=1}^k \prod_{j=0}^\ell x_{i,j}^{n^j}$. We prove that the following are…

In this paper we consider polynomial representability of functions defined over $Z_{p^n}$, where $p$ is a prime and $n$ is a positive integer. Our aim is to provide an algorithmic characterization that (i) answers the decision problem: to…

Given a sequence of polynomials $(p_n)_n$, an algebra of operators $\mathcal{A}$ acting in the linear space of polynomials and an operator $D_p\in \mathcal{A}$ with $D_p(p_n)=np_n$, we form a new sequence of polynomials $(q_n)_n$ by…

In this article, we consider the problem of determining formulas for the number of representations of a natural number $n$ by a sum of figurate numbers with certain positive integer coefficients. To achieve this, we prove that the…

In this article, we give explicit formulas for the $p$-adic valuations of the Fibonomial coefficients ${p^a n \choose n}_F$ for all primes $p$ and positive integers $a$ and $n$. This is a continuation from our previous article extending…

We consider the generating polynomial of the number of rooted trees on the set $\{1,2,\dots,n\}$ counted by the number of descending edges (a parent with a greater label than a child). This polynomial is an extension of the descent…

We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…