Identities for combinatorial sums involving trigonometric functions
arXiv:2212.14841
Abstract
Let and where and are integers and is a real number. We present two proofs for the following results: (i) If $2m+1 \equiv 0 \, (\mbox{mod} \, n)$, then (ii) If $2m+1 \not\equiv 0 \, (\mbox{mod} \, n)$, then . (iii) If $2(m+1) \equiv 0 \, (\mbox{mod} \, n)$, then (iv) If $2(m+1) \not\equiv 0 \, (\mbox{mod} \, n)$, then .