2014Wiley StatsRef: Statistics Reference OnlineOpen access

Combinatorics

Lajos Takács

Open full text 0 citations

Abstract

The oldest combinatorial problems of any importance are connected with the notion of binomial coefficients.For any a the kth (k = 1, 2, . ..) binomial coefficient is defined as

Open-access reader

About this research paper

What this paper is about

The oldest combinatorial problems of any importance are connected with the notion of binomial coefficients.For any a the kth (k = 1, 2, . ..) binomial coefficient is defined as

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The oldest combinatorial problems of any importance are connected with the notion of binomial coefficients.For any a the kth (k = 1, 2, . ..) binomial coefficient is defined as

Key concepts: Combinatorics, Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Combinatorics — Research Paper | ScholarLens