Prove or disprove:
Let
Then s(n) differs from an integral multiple of by a rational number just in case the ternary representation of has at least one in it.
For instance for integer is always of the form , where a and b are rational numbers, but for is an integer.
That is, for in ternary (base 3) form b is an integer.
Source: http://answers.yahoo.com/question/index?qid=20140131085034AA68jaX
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
Hey that smart guy in Yahoo Answers may be onto something with the divisibility of (2n-2)! ./ (n-1)!(n-1)! by 3.
Log in to reply
Thanks for notifying ;-) I am glad that you notified about that smart guy