I Question about simplifying Sigma notation

AI Thread Summary
The discussion centers on simplifying the expression ∑i=1log(n) 1(log(n) - i), which the original poster struggles to understand. Participants clarify that the sum involves adding the value 1 a total of log(n) times. This leads to the realization that the simplified result is log(n), as repeatedly adding 1 log(n) times yields log(n). The conversation also touches on the general properties of summation and exponentiation, emphasizing that raising 1 to any power remains 1. Ultimately, the poster gains clarity on the simplification process.
RoboNerd
Messages
410
Reaction score
11
Hello everyone!

I have this expression which I have to simplify:
i=1log(n) 1(log(n) - i)

And my book apparently simplifies it to being log(n).
I am struggling to figure out why this is the case. Could anyone help?

Thanks!
 
Physics news on Phys.org
What is ##e_i=1^{\text{ insert any integer }}## and what is ##\sum_{i=1}^{n} a_i## if you write it out with dots? And finally set ##a_i=e_i##.
 
Firstly, how many terms are there in the sum - ie how many things are being added together?

Secondly, what is the value of each term? What do you get when you raise 1 to the power of any other real number?

EDIT: Uh oh - Jinxed again!
 
Ohh, I see thanks!

We add 1 log(n) times over and over again!

Thanks for the help everyone!
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top