I have noticed the following curiosity for a product of integers. Given an ordered (decreasing) sequence of strictly positive integers $(a_i)_{i=1 \ldots n}$, that is to say, such that:
$$\forall\ i\ a_{i+1} \ge a_i,$$
I've noticed in concrete examples this surprising relation: $$\Pi_{i=1}^n a_i \le \Pi_{i=1, i \neq j, i \neq k}^n a_i (a_j-1)(a_k+1)\ \forall\ j \le k$$
In other words, for two positive integers $a$ and $b$ with $b \ge a$ it seems that $ab \le (b-1)(a+1)$.
Is this relation always true ? Where can I find content related to this thing ?
Thank you.
$$(b-1)(a + 1) = ba + b - a - 1$$
So you'll want $b > a$ for this to be bigger than $ab$.
For example where it fails without the strict inequality, just notice $$(2-1)(2 + 1) = 3 < 2\cdot 2 = 4$$