Pleaseeeeeeeeee Don't read it!!!!!!

Its really difficult to handle people too. But as i have already stated that i find that i am also difficult to be handled by myself, it becomes two times difficult. The complexity of handling the things around me and things within me is twice of that of other people, as others find only other people difficult to handle. :D

Now i will trouble the reader of this post (who, at the end of this blog, is going to feel like shoving in a valley )with some statements of static and randomeness of behaviours of people (and that of me). :D

Assumption:
Everyone on this earth keeps generating some random numbers, with a function say generateMyBehaviourNumber(). Its return type is int. If the number returned by person A's generateMyBehaviourNumber() is same as that of B, then can handle each other very well. In normal language they can communicate to each other very well. This generated number also has a lifespan. Suppose this lifespan is also an integer. And that is also a random. So one more random function - say generateLlifeSpanOfCommunication(). :P.
If you are bored here itself, please leave the post and read something else. There are millions of blogs which are really interesting and worth reading than this. ;)

So now coming back to my theory. :D

Oh i explaind i guess. Now its the time to bluff of theorem:

1)Phase I: When A meets B for the first time -
If they want to communicate *OR* if they happen to communicate,

A's function :
generateMyBehaviourNumber(){
int n = findBehaviourNumberOfB();
return n;
}

B's function :
generateMyBehaviourNumber(){
int n = findBehaviourNumberOfA();
return n;
}

As these two functions are trying to get equal number, though after stumbling up, they get some equal number.


generateLlifeSpanOfCommunication(){
// This function generates small numbers.
}


So as per the theory, A and B can communicate well as they have equal behavior numbers and short lifespan of communication.


(I'd still suggest you to stop here and to read something else.) :)


2)Phase II: When they start knowing each other well -
generateMyBehaviourNumber(){
return 1;
}

It is the same for both A and B.

generateLlifeSpanOfCommunication(){
return p++; // p is static.
}

Again they can communicate very well. Good communication. :)

3)Phase III: A and B know each other properly -
generateMyBehaviourNumber(){
return math.random();
}

It is the same for both A and B.
But now, its not possible always that behaviour numbers of both are equal.

In fact probabilty of matching them is millionth fraction of 1. Or may be lesser than that. In fact its a luck.


So you know the result. :)


And hence the definition of function
generateLlifeSpanOfCommunication() becomes -

generateLlifeSpanOfCommunication(){
return p--; //p is static again.
}

This is my crappy theory. :)

Sometimes A enters first in phase II. And hence B has to do the same. :)

Pranali, Get lost. :P (Who said that? ) :D

IF you want to ask me questions.... Please look at the title of this post!! :)