Hi
Equation 1
The sum is a sum of consecutive terms of a geometric series
Equation 2
It is the sum of (k-1) terms all equal to therefore it is
Hi,
Can someone please explain on how the below equations were summarised?
I can see in the above equation that 3 is common to all the elements so that can go outside the bracket – the rest catches me a bit though.
Same in equation 2 – I can see 3/2 and are (2 + square root(2)) are common to every element ..its the rest I don’t get.
Thanks in advance
Hello, kerrymaid!
These problems are formatted badly and have typos.
And the second one is downright silly.
.[1]
The series has:
. . first term , common ratio , and terms.
It sum is: .
. .
Therefore, [1] become: .
. . . .
. . This is really silly!
The second term has: .
The third term has: .
The last term has: .
. . . . . . . . . . . . .
Edit: Too slow . . . again!
Hi,
As an extension to the above question, I'm hoping someone can help me to understand the following (sorry for the long email and my rubbish use of proper notation - havent figured out how to easily do that in this editor yet). I’m not sure if this is strictly a pure algebra question but I’m hoping someone can help just the same.
I’ve attached a diagram which shows a square divided into a grid hierarchy h=3.
Four of the smallest squares make up an order 1 square, four order 1 squares make up an order 2 square, four order 2 squares make up an order 3 square and so on.
The side length of an order 1 square is L which is the transmission range of a device i.e. 200m. A device has a server in each sibling square at each hierarchy level i.e. a device has 3 servers in its order 1 square, 3 in the order 2 square and so on. A device updates its servers in order i sibling squares after movement of 2i-1.d where d is the update threshold.
Therefore , the number of hops travelled by all update packets per interval ends up being Equation 2 above(Thanks again to soroban and running-gag for helping me to understand this)
I understand the (2 + sqrt(2)) comes from the number of hops travelled to the 3 servers within an order 1 square (1 + 1 + sqrt(2) for the diagonal sibling square). The 2^0 + 2^1 + 2^2 … + 2^k-2 comes from the side length L i.e. 200m of a square which doubles as the hierarchy increases. The 1 + ½ + ¼ … + 1/(2^k-2) comes from the number of updates sent per one interval (As stated above, the frequency of updates gets progressively less for servers in more remote squares). What I can’t grasp is where the 3/2 comes from.
I’ve included below the explanation from the paper I’m reading which I cannot fathom as I would have thought the above equation (without adding an additional factor of 3/2) would adequately cover an equation to approximate the “number of hops travelled by all update packets per interval”.
If anyone can grasp what is meant by this and why it should be included in the equation I would really appreciate the help.The factor of 3/2 for each term is explained as follows. Let the lowest-order sibling squares containing the destination and the server be order-k squares X and Y, respectively. The update packet is first forwarded in a straight line towards Y while inside X. Once crossing the boundary between X and Y, it is forwarded in a sequence of steps in traversing up the hierarchy starting from an order-1 square and reaching the order-(k - 1) square containing the server. Since the sequence of steps are directionless and the expected distances
they travel are recursively doubled, they incur an approximate factor of 2 overhead compared to the direct distance between the starting point and finishing point inside square Y. The factor of 2 overhead while traversing inside Y and the straight line path inside X together contribute to the factor of 3/2 for each term in the above average hop count formula for update packets.
Many thanks in advance.
Kerrymaid