Hello everyone!
I came across a strange question today. Consider a number say 10, we will try to express it as a sum of positive integers say
\[ 10 = \underbrace{1+1+1+\cdots + 1}_{\text{ten 1's}} = 2 + 4 + 4 = 2 + 3 + 5 = \cdots \]
We find the maximum possible lowest common multiple of these numbers and call it , so .
Other examples are .
Is there a way to find for all positive integers ?
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
@Calvin Lin
Log in to reply
Yes there is a way.
What have you tried?
Log in to reply
Not much ,I did it by hit and trial for small numbers( as most questions asked only about them) .I have no idea on how to proceed with large numbers.
Log in to reply
smoothing an inequality.
Try