Related papers: The Ongoing Binomial Revolution
The binomial convolution of two sequences $\{a_n\}$ and $\{b_n\}$ is the sequence whose $n$th term is $\sum_{k=0}^{n} \binom{n}{k} a_k b_{n-k}$. If $\{a_n\}$ and $\{b_n\}$ have rational generating functions then so does their binomial…
In 1837, Dirichlet proved that there are infinitely many primes in any arithmetic progression in which the terms do not all share a common factor. Modern presentations of the proof are explicitly higher-order, in that they involve…
In 1965 Buchberger defined Gr\"obner bases and an algorithm to compute them. Despite a slow start, already in the eighties Gr\"obner bases had become the main device for symbolic computations involving polynomials as well as a theoretical…
The great innovation of the Generalized Theorem is that it gives us the philosophy to work out the knowledge that the number of roots of an equation depends on the subfields of the functional terms of the equation they generate. Thus, the…
We study the properties of different type of transforms by means of operational methods and discuss the relevant interplay with many families of special functions. We consider in particular the binomial transform and its generalizations. A…
Schinzel's Hypothesis H is a general conjecture in number theory on prime values of polynomials that generalizes, e.g., the twin prime conjecture and Dirichlet's theorem on primes in arithmetic progression. We prove an arithmetic analog of…
The classical Pythagoras theorem, binomial theorem, de Moivre's formula, and numerous other deductions are made using the uniqueness theorem for the initial value problems in linear ordinary differential equations.
Starting from the Riemann-Liouville derivative, many authors have built their own notion of fractional derivative in order to avoid some classical difficulties like a non zero derivative for a constant function or a rather complicated…
The trinomial transform of a sequence is a generalization of the well-known binomial transform, replacing binomial coefficients with trinomial coefficients. We examine Pascal-like triangles under trinomial transform, focusing on the ternary…
Let $\lambda (n)$ denote the Liouville function. Complementary to the prime number theorem, Chowla conjectured that \vspace{1mm} \noindent {\bf Conjecture (Chowla).} {\em \begin{equation} \label{a.1} \sum_{n\le x} \lambda (f(n)) =o(x)…
The power sum $1^n + 2^n + \cdots + x^n$ has been of interest to mathematicians since classical times. Johann Faulhaber, Jacob Bernoulli, and others who followed expressed power sums as polynomials in $x$ of degree $n+1$ with rational…
The notion of multiplicity of a module first arose as consequence of Hilbert's work on commutative algebra, relating the dimension of rings with the degree of certain polynomials. For noncommutative rings, the notion of multiplicity first…
The understanding of probability can be difficult for a few young scientists. Consequently, this new mathematical symbol, related to binomial coefficients and simplicial polytopic numbers, could be helpful to science education. Moreover,…
We give a new proof of Fatou's theorem: {\em if an algebraic function has a power series expansion with bounded integer coefficients, then it must be a rational function.} This result is applied to show that for any non--trivial completely…
For a prime p and nonnegative integers n,k, consider the set A_{n,k}^{(p)}={x is in [0,1,...,n]: p^k||binom {n} {x}}. Let the expansion of n+1 in base p be: n+1=alpha_{0} p^{\nu}+alpha_{1}p^{nu-1}+...+alpha_{nu}, where 0<=alpha_{i}<=…
This paper shows an elementary and direct proof of the Fundamental Theorem of Algebra, via Bolzano-Weierstrass Theorem on Minima and the Binomial Formula, that avoids: any root extraction other than the one used to define the modulus…
In this paper, we introduce the polynomial continued fraction, a close relative of the well-known simple continued fraction expansions which are widely used in number theory and in general. While they may not possess all the intriguing…
Certain triples of power series, considered by I. Macdonald, give a natural framework for many combinatorial and number theoretic sequences, such as the Stirling, Bernoulli and harmonic numbers and partitions of different kinds. The power…
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…
The main purpose of this paper is to obtain Leibniz's rule for generalized types of derivations via Newton's binomial formula. In fact, we provide a short formula to calculate the nth power of any kind of derivations.