need help...!!! There is a set with N element, the N element consist of k type of object. that is n1 of first type object, n2 second type object, ..., n(k-1) (k-1)th object and the remainder is zero. How many possible way to arrange the element of this set in a row such that the different between two row that we arrange is exactly d element, specially for d=2. "sorry for my english"
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
any one help me please...
--_-- ; :D