中文
相关论文

相关论文: The Binomial Theorem for (N + n)^r (where Nf(n)=f(…

200 篇论文

We derive two formulae for (A + B)^n, where A and B are elements in a non-commutative, associative algebra with identity.

环与代数 · 数学 2017-11-28 Walter Wyss

As is well-known, a generalization of the classical concept of the factorial $n!$ for a real number $x\in {\mathbb R}$ is the value of Euler's gamma function $\Gamma(1+x)$. In this connection, the notion of a binomial coefficient naturally…

组合数学 · 数学 2022-06-08 Tatiana I. Fedoryaeva

In this article, using generalized derivations, we obtain a simple idea to prove the non-commutative Newton binomial formula in unital algebras and then, we extend that formula to non-unital algebras. Additionally, we establish the…

泛函分析 · 数学 2019-03-01 A. Hosseini , M. Mohammadzadeh Karizaki

A weight-dependent generalization of the binomial theorem for noncommuting variables is presented. This result extends the well-known binomial theorem for q-commuting variables by a generic weight function depending on two integers. For a…

量子代数 · 数学 2012-03-19 Michael J. Schlosser

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

数论 · 数学 2012-04-10 Victor J. W. Guo , Jiang Zeng

We state a general formula for the number of binomial coefficients $n$ choose $k$ that are divided by a fixed power of a prime $p$, i.e., the number of binomial coefficients divided by $p^j$ and not divided by $p^{j+1}$.

综合数学 · 数学 2008-03-10 William B. Everett

The notion of binomial coefficients $T \choose S$ of finite planar, reduced rooted trees $T, S$ is defined and a recursive formula for its computation is shown. The nonassociative binomial formula $$(1 + x)^T = \displaystyle \sum_S {T…

环与代数 · 数学 2007-05-23 Lothar Gerritzen

In this paper, we derive formal general formulas for noncommutative exponentiation and the exponential function, while also revisiting an unrecognized, and yet powerful theorem. These tools are subsequently applied to derive counterparts…

组合数学 · 数学 2024-10-14 Kei Beauduin

For $n\ge 3$ let $f(n)$ be the least positive integer $k$ such that $\binom nk>\frac{2^n}{n+1}$. In this paper we investigate the properties of $f(n)$.

组合数学 · 数学 2013-10-01 Daeyeoul Kim , Ayyadurai Sankaranarayanan , Zhi-Hong Sun

In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…

综合数学 · 数学 2019-07-25 K. K. Kataria

Let k and n be positive integers. We mainly show that $$(ln+1) | k\binom{kn+ln}{kn},$$ $$2\binom{kn}n | \binom {2n}{n}C_{2n}^{(k-1)}$$, $$\binom{kn}n | (2k-1)C_n\binom{2kn}{2n},$$ $$\binom{2n}n | (k+1)C_n^{(k-1)}\binom{2kn}{kn},$$…

数论 · 数学 2010-06-01 Zhi-Wei Sun

Combinatorial number system represents a non-negative natural numbers as sum of binomial coefficients. This paper presents an induction proof that there exists unique representation of every non-negative natural number $m$ as sum of $r$…

组合数学 · 数学 2016-01-25 Abu Bakar Siddique , Saadia Farid , Muhammad Tahir

Euler's theorem asserts that $A(n)=B(n)$ where $A(n)$ is the number of partitions of $n$ into distinct parts and $B(n)$ is the number of partitions of $n$ into odd parts. In this paper, it is proved that for $n>0$, \begin{align*}…

组合数学 · 数学 2025-11-07 George E. Andrews , Rahul Kumar , Ae Ja Yee

The undecidability of the additive theory of primes (with identity) as well as the theory Th(N,+, n -> p\_n), where p\_n denotes the (n+1)-th prime, are open questions. As a possible approach, we extend the latter theory by adding some…

逻辑 · 数学 2007-05-23 Patrick Cegielski , Denis Richard , Maxim Vsemirnov

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}<=…

数论 · 数学 2009-07-31 Vladimir Shevelev

We state analogs of the binomial theorem and the exponential function for variables $x$, $y$ commuting as $yx=qxy$.

量子代数 · 数学 2009-01-14 A. V. Stoyanovsky

The object of this paper is to generalize a theorem on the binomial coefficient [4] to the case in an arithmetic progression. We will also give a slightly stronger result than Langevin's [2].

综合数学 · 数学 2009-09-15 Shaohua Zhang

Fillmore Theorem says that if $A$ is a nonscalar matrix of order $n$ over a field $\mathbb{F}$ and $\gamma_1,\ldots,\gamma_n\in \mathbb{F}$ are such that $\gamma_1+\cdots+\gamma_n=\text{tr} \, A$, then there is a matrix $B$ similar to $A$…

组合数学 · 数学 2017-04-27 Alberto Borobia

We prove two generalisations of the Binomial theorem that are also generalisations of the q-binomial theorem. These generalisations arise from the commutation relations satisfied by the components of the co-multiplications of non-simple…

量子代数 · 数学 2007-05-23 Sacha C. Blumen

We establish two general identities for Bernoulli and Euler polynomials, which are of a new type and have many consequences. The most striking result in this paper is as follows: If $n$ is a positive integer, $r+s+t=n$ and $x+y+z=1$, then…

数论 · 数学 2007-05-23 Zhi-Wei Sun , Hao Pan
‹ 上一页 1 2 3 10 下一页 ›