₦airaland Forum

efedua:
for the formal we have;
a+a-(n-1)=2a-(n-1)
for the later we also have;
a-(n-1)+a=2a-(n-1)
NB:this constant value 2a-(n-1) will still occur for all added terms by position
prove:
from Tn 2nd term and Tn* 2nd term summation we get;
{a-1}+{a-(n-2)}= 2a-1-(n-2)=2a-1-n+2=2a-n+1=2a-(n-1)
.
.
.
.so therefore, the sum of Tn and Tn*, we give;
2Tn=2a-(n-1)+ 2a-(n-1)+ 2a-(n-1)+....+ 2a-(n-1)+ 2a-(n-1)+2a-(n-1)
By principle of addition; a+a+a+a=4a we have that;
***2Tn=n[2a-(n-1)]***
©
©
©
©
now substitute 'n-1' for 'a' as in the case. of highest possible shakes. we have;
2Tn=n[2(n-1)-(n-1)]=n[n-1] (NB: 2a-a=a)
.
2Tn=n(n-1)
finally divide L.H.S and R.H.S of the equation by 2 to have Tn, we get;
2Tn/2=[n(n-1)]/2
therefore; Tn=n/2(n-1)

©®
CREDIT to my:
cracking BRAIN

Nimen:
Morning peoples *yawns* *taps around the bed* wey CJPresh?

wizmikelo:
Good morning Marie, how your night.

50calibre:
Fuc*k you!! You won't be missed so you can deactivate now because Kulboy is going to win & nothing you and your horde of clowns can do about it.

50calibre:
@Kulboy where you at?

This naijaclown of a guy had 58 votes on you.., that shouldn't happen in a sane world.

However, I put a lot of that down to the fact that many people who voted you, also voted him in addition to his romance cronies who deliberately in defiance of common sense chose not to vote you.

I expect the final to be different though as given only a single choice, most discerning folks with functioning eyes & a brain will vote you ahead of the clown. This is no brainer

You should appreciate your fans though, your scarce presence isn't helping your cause.

Don't underestimate clowns, the circus thrives with numbers

efedua:
let n be the numbers of people placed on line to have a shakes with each others. obviously, the highest possible count of shakes,will be from the first person and must be given as 'n-1=a' and the lowest possible will be given as 'a-(n-2)=1'
however when we run a summation of shakes from nth term(being the first person shakes to others and left) to 1th term(being the last single person who will not shake any body and left) or a to 0 we will have an AP of a+a-1+a-2+....+a-(n-3)+a-(n-2)+a-(n-1)
.
(where a-(n-1)=0)
.
when we count the numbers of terms in the summation above we will get n numbers of terms.
prove:
when 3people have shakes, by the summation of a to 0, where n-1=a, we have the numbers of shakes as 2+1+0=3
now count the numbers of terms, we have 2,1 and 0 and they are three terms.

let write the summation from a to 0 as Tn, where Tn is the total numbers of shakes, we get;
Tn=a+a-1+a-2+....+a-(n-3)+a-(n-2)+a-(n-1)
.
Similarly, if we rewrite the summation from 0 to a as Tn*, we get;
Tn*=a-(n-1)+a-(n-2)+a-(n-3)+....+a-2+a-1+a. (where Tn*=Tn, Then Tn +Tn*=2Tn)
.
.
Now let add Tn to Tn* by adding there terms in the same position without affecting the n numbers of terms. that is, add Tn 'a' to Tn* 'a-(n-1)' and Tn 'a-(n-1)' to Tn* 'a' and do the same for all value that fall within them

for the formal we have;
a+a-(n-1)=2a+(n-1)
for the later we also have;
a-(n-1)+a=2a+(n-1)
NB:this constant value 2a+(n-1) will still occur for all added terms by position
prove:
from Tn 2nd term and Tn* 2nd term summation we get;
{a-1}+{a-(n-2)}= 2a-1-(n-2)=2a-1-n+2=2a-n+1=2a-(n-1)
.
.
.
.so therefore, the sum of Tn and Tn*, we give;
2Tn=2a-(n-1)+ 2a-(n-1)+ 2a-(n-1)+....+ 2a-(n-1)+ 2a-(n-1)+2a-(n-1)
By principle of addition; a+a+a+a=4a we have that;
2Tn=n[2a-(n-1)]
©
©
©
©
now substitute 'n-1' for 'a' as in the case. of highest possible shakes. we have;
2Tn=n[2(n-1)-(n-1)]=n[n-1] (NB: 2a-a=a)
.
2Tn=n(n-1)
finally divide L.H.S and R.H.S of the equation by 2 to have Tn, we get;
2Tn/2=[n(n-1)]/2
therefore; Tn=n/2(n-1)

©®
CREDIT to my:
cracking BRAIN

efedua:
let n be the numbers of people placed on line to have a shakes with each others. obviously, the highest possible count of shakes,will be from the first person and must be given as 'n-1=a' and the lowest possible will be given as 'a-(n-2)=1'
however when we run a summation of shakes from nth term(being the first person shakes to others and left) to 1th term(being the last single person who will not shake any body and left) or a to 0 we will have an AP of a+a-1+a-2+....+a-(n-3)+a-(n-2)+a-(n-1)
.
(where a-(n-1)=0)
.
when we count the numbers of terms in the summation above we will get n numbers of terms.
prove:
when 3people have shakes, by the summation of a to 0, where n-1=a, we have the numbers of shakes as 2+1+0=3
now count the numbers of terms, we have 2,1 and 0 and they are three terms.

let write the summation from a to 0 as Tn, where Tn is the total numbers of shakes, we get;
Tn=a+a-1+a-2+....+a-(n-3)+a-(n-2)+a-(n-1)
.
Similarly, if we rewrite the summation from 0 to a as Tn*, we get;
Tn*=a-(n-1)+a-(n-2)+a-(n-3)+....+a-2+a-1+a. (where Tn*=Tn, Then Tn +Tn*=2Tn)
.
.
Now let add Tn to Tn* by adding there terms in the same position without affecting the n numbers of terms. that is, add Tn 'a' to Tn* 'a-(n-1)' and Tn 'a-(n-1)' to Tn* 'a' and do the same for all value that fall within them

for the formal we have;
a+a-(n-1)=2a+(n-1)
for the later we also have;
a-(n-1)+a=2a+(n-1)
NB:this constant value 2a+(n-1) will still occur for all added terms by position
prove:
from Tn 2nd term and Tn* 2nd term summation we get;
{a-1}+{a-(n-2)}= 2a-1-(n-2)=2a-1-n+2=2a-n+1=2a-(n-1)
.
.
.
.so therefore, the sum of Tn and Tn*, we give;
2Tn=2a-(n-1)+ 2a-(n-1)+ 2a-(n-1)+....+ 2a-(n-1)+ 2a-(n-1)+2a-(n-1)
By principle of addition; a+a+a+a=4a we have that;
2Tn=n[2a-(n-1)]
©
©
©
©
now substitute 'n-1' for 'a' as in the case. of highest possible shakes. we have;
2Tn=n[2(n-1)-(n-1)]=n[n-1] (NB: 2a-a=a)
.
2Tn=n(n-1)
finally divide L.H.S and R.H.S of the equation by 2 to have Tn, we get;
2Tn/2=[n(n-1)]/2
therefore; Tn=n/2(n-1)

©®
CREDIT to my:
cracking BRAIN

Rilwayne001:
Me i no gree for this result oooo

I'm appealing this.

Abeeg which way to the court of appeal

KingsleyJay:
lafing hard at the emboldened.........

buh on a more serious note
if it were all about popularity the current MISS NL would have been
between ROZZAY N ROKIATU

buh we all know how that went

Emperorking20:
Yeah! Who cares! Thanks a lot! Ah! Kelechimarie ati Neldrizzy ati VICTORCIZA to try!

Unluvable:
Please can the name of this contest be changed to 'Most Popular Male on Nairaland (Romance Section)'...so that people will know what it really entails.

Thank you

Emperorking20:
u made it happen Ade! for that I'm grateful.
Meso who was d one on uniben thread that said I had no hope? I want to specially thank him


Kelechimarie I made it

efedua:
let n be the numbers of people placed on line to have a shakes with each others. obviously, the highest possible count of shakes,will be from the first person and must be given as 'n-1=a' and the lowest possible will be given as 'a-(n-2)=1'
however when we run a summation of shakes from nth term(being the first person shakes to others and left) to 1th term(being the last single person who will not shake any body and left) or a to 0 we will have an AP of a+a-1+a-2+....+a-(n-3)+a-(n-2)+a-(n-1)
.
(where a-(n-1)=0)
.
when we count the numbers of terms in the summation above we will get n numbers of terms.
prove:
when 3people have shakes, by the summation of a to 0, where n-1=a, we have the numbers of shakes as 2+1+0=3
now count the numbers of terms, we have 2,1 and 0 and they are three terms.

let write the summation from a to 0 as Tn, where Tn is the total numbers of shakes, we get;
Tn=a+a-1+a-2+....+a-(n-3)+a-(n-2)+a-(n-1)
.
Similarly, if we rewrite the summation from 0 to a as Tn*, we get;
Tn*=a-(n-1)+a-(n-2)+a-(n-3)+....+a-2+a-1+a. (where Tn*=Tn, Then Tn +Tn*=2Tn)
.
.
Now let add Tn to Tn* by adding there terms in the same position without affecting the n numbers of terms. that is, add Tn 'a' to Tn* 'a-(n-1)' and Tn 'a-(n-1)' to Tn* 'a' and do the same for all value that fall within them

for the formal we have;
a+a-(n-1)=2a+(n-1)
for the later we also have;
a-(n-1)+a=2a+(n-1)
NB:this constant value 2a+(n-1) will still occur for all added terms by position
prove:
from Tn 2nd term and Tn* 2nd term summation we get;
{a-1}+{a-(n-2)}= 2a-1-(n-2)=2a-1-n+2=2a-n+1=2a-(n-1)
.
.
.
.so therefore, the sum of Tn and Tn*, we give;
2Tn=2a-(n-1)+ 2a-(n-1)+ 2a-(n-1)+....+ 2a-(n-1)+ 2a-(n-1)+2a-(n-1)
By principle of addition; a+a+a+a=4a we have that;
2Tn=n[2a-(n-1)]
©
©
©
©
now substitute 'n-1' for 'a' as in the case. of highest possible shakes. we have;
2Tn=n[2(n-1)-(n-1)]=n[n-1] (NB: 2a-a=a)
.
2Tn=n(n-1)
finally divide L.H.S and R.H.S of the equation by 2 to have Tn, we get;
2Tn/2=[n(n-1)]/2
therefore; Tn=n/2(n-1)

©®
CREDIT to my:
cracking BRAIN

Neldrizzy:
Pls what's going on here....... Hope you guys are aware we lost against SA, and we aint going for Nations Cup anyway... Its none of My business!!

MizRachel:
1 – Do that thing where you kiss them and act
like you’re stuck. Even say, “I’m stuck! And I
won’t unstick until you accept my apology!” It
will sound hilarious because your lips will be…
stuck!



2 – Write a ridiculous poem. Make sure it
rhymes. Search for words that rhyme with
“sorry”.



3 – Make a list of the top 100 reasons you love
them. What’s not on the list: the fact that they
are forgiving. What is on the list: their sexy
voice, how their eyes look when they’re tired,
how hot they look shirtless… The more odd, tiny
and specific, the better.



4 – Stick a picture of you two together in their
bag and write on it “I LOVE YOU” — or the secret
password you two have for “I love you,” or your
nickname for them, or a reference to a random
inside joke they probably had forgotten about but
will laugh at now.



5 – Seriously just buy them something they’ve
been wanting. This works especially for ladies



6 – Write “I’m sorry” somewhere unexpected.
Like, on a note on your fridge, on the mirror in
lipstick, on your stomach, etc.



7 – Bake a big cake or cookie and write “I’m
sorry” on it with icing. WHO can remain mad
over a giant delicious cookie?



8 – Breakfast in bed.



9 – A single flower with a nice note. Did you
know white violets symbolise “let’s take a
chance on happiness”?


.
10 – if
they’re over it, stay for a nice little lunch for two!

Mickey7:
Hello! It's been a while

Suley316:


Resting for 1000

efedua:
efe

wizmikelo:
I hail una for this thread.

chue:
ntooooooooooor lol see boys dey vex dem wan open page 800

kulkatty:
LOL
Elaaaaa ohhhh