Hi all,
Here is a counting formula that has been derived using some recursion formulas but I think it should have a much more elegant form. Any help writing it in " a nicer form " would be really appreciated.
Here is the formula :
where
is the the remainder of n mod 3,
is the the remainder of m mod 2,
is the integer part of the rational number k.
I expect this function (if derived correctly) is symmetric s.t. P(n,m) = P(m,n) but its no obvious in this current form.
Thanks and enjoy...
EDIT : I found a mistake in the derivation, please ignore :)
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
There are no comments in this discussion.