Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Q&A

Post History

#1: Initial revision by user avatar celtschk‭ · 2021-07-30T08:11:31Z (over 2 years ago)
The *informal* expression stands for the *formal* expression
$$\prod_{j=1}^k (n-j+1)$$
where, since it is a formal expression, you indeed can insert $k=1$, to get
$$\prod_{j=1}^1 (n-j+1) = (n-1+1) = n$$
as the text states.

Now the author of the text obviously wanted to avoid the product notation, either to accomodate those who don't know about the product notation, or alternatively on the assumption that it is more easily understandable that way.

The formal definition of the product (ignoring the special case of the empty product, as it is not relevant here) is:
\begin{align}
\prod_{j=m}^m f(j) &= f(m)\\\\
\prod_{j=m}^{n+1} f(j) &= \left(\prod_{j=m}^n f(j)\right)f(n+1)
\end{align}

Let's apply this to the product above:
\begin{align}
\prod_{j=1}^1 (n-j+1) &= (n-1+1) = n\\\\
\prod_{j=1}^2 (n-j+1) &= (n-1+1)(n-2+1) = n(n-1)\\\\
\prod_{j=1}^3 (n-j+1) &= (n-1+1)(n-2+1)(n-3+1) = n(n-1)(n-2)
\end{align}
and so on. As you see, the number of factors equals exactly $k$. Now how to write the right hand side for an unspecified $k$? Well, we can't write it down formally since the number of factors depends on $k$. But assuming $k$ is large enough, we know that the first two factors are $n(n-1)$, the last factor id $(n-k+1)$, and the factors are all of the same form, which can be easily derived from the last factor (just replace $k$ by $j$ for the $j$-th factor). Therefore we can *informally* write that product as
$$n(n-1)\ldots (n-k+1)$$
where the missing terms are to be inferred by the reader, and crucially, it is also expected that the reader understands that if $k<3$, there are *less* terms than are explicitly written.

The author obviously expected the reader to understand this for the case $k=2$ (where the term after the dots equals the second term), but felt  the need to explicitly point it out for $k=1$ where also the second term, the one immediately preceding the dots, goes away, so you are left with just the first factor, $n$, which is therefore the value of the full product.