Challenge: Show that any positive natural number \(a\) can be written as the sum of numbers in the form \(\dfrac{1}{2^n}\) where \(n \in \mathbb{N}\) and a number can be used any number of times, but ALL numbers -- \(\left\{\dfrac{1}{2^n}:n\in\mathbb{N}\right\}\) -- are to be used.
a= 1/2 +1/2 +1/2 + ...
I have a solution, but it may just be because I'm interpreting the problem incorrectly.
where there are 2a numbers of 1/2
Right. Same thought here, Suaravshakya.
n=1
lol, I'd add something to my problem.
But there are many solutions. Instead of summing up halves, you could sum up quarters or eighths or sixteenths, or some random combination of those.
yep
Well show that any integer cannot be expressed as sum of 1/2^n where n cannotbe repeated
Same logic will help
Ah, much more interesting question =) It's fairly intuitive, but to prove it rigorously may be difficult.
It's not really rigorous.
Well, actually Suar, it's not just that any integer cannot be expressed if you disallow n to be repeated. In fact, the sum cannot reach or exceed 1.
Actually, if you read the question, I've written "positive number". =/
Oh hey. Did you edit it? I could have sworn this said integers before.
Heh, edited this a minute before you commented that. Any solutions?
I'm confused by "A number can be used any number of times but all numbers are to be used" How can all numbers be used? If you want all numbers to be used, then I suppose this is not a finite sum, but an infinite sum.
And I believe this calls not for a proof but for a disproof.
So now is the final edit. Take a look at the question.
@Hero: Because my homework problems look like\[2x + 3x = 10, \text{ solve for }x.\]
lololol truefacts
So assuming you are allowing infinite sums, this is not difficult. \[\Large \sum_{n=1}^{\infty} \frac{1}{2^n} = 1\] Therefore, \[\Large a\sum_{n=1}^{\infty} \frac{1}{2^n} = a\]
\[a=\frac{1}{2}k+0\left(1+\sum_{i >1}\frac{1}{2^i}\right), \quad \text{ where } k: a=\frac{1}{2}k.\]
@SmoothMath Infinite sums are stated explicitly to be used in the definition of all numbers. Your answer is on par with mine in terms of Smart Alec material. This is a compliment.
Yes! Just a little note: Use\[\sum_{n =1}^{\infty} \dfrac{1}{2^n} + \sum_{n =1}^{\infty} \dfrac{1}{2^n}+ \sum_{n =1}^{\infty} \dfrac{1}{2^n} \cdots(a \ \text{times}) = a\]because you aren't allowed to use the number \(a\) since it is strictly not in the form shown above...
\[\sum_{n =1}^{\infty} \dfrac{1}{2^n} + \sum_{n =1}^{\infty} \dfrac{1}{2^n}+ \sum_{n =1}^{\infty} \dfrac{1}{2^n} \cdots(a \ \text{times}) = a\sum_{n \ge 1}2^{-n}\]
It is a good thing to point out, and I almost did fix it but was too lazy. Another way to satisfy the requirement is by the property of sums: \(\Large a\sum_{n=1}^{\infty} \frac{1}{2^n} = \sum_{n=1}^{\infty} a*\frac{1}{2^n}\)
Ah, and Limitless said the same thing =)
@ParthKohli Why don't you prove that this works for _only_ \(x=\dfrac{1}{2}\) in \[\sum_{n \ge 1}x^{n}?\]
or something similar.
@SmoothMath To be rough with you, Smooth, I simply demonstrated that I am a bit of a smart alec for the second time in this thread in an attempt to be humorous.
@Limitless: What does?
@ParthKohli Show that \[a=a\sum_{n \ge 1}x^n \iff x=\frac{1}{2}.\]
Hmm, that's just another example of infinite geometric series.
\[S_n = \dfrac{a}{1 - r} ~ \iff r > |1| \]
Oops, I meant\[r < |1|\]
That's close. Be specific.
OK, do you need the derivation of it?
Join our real-time social learning platform and learn together with your friends!