Today we continue reading the book triggers. We were discussing how environment tends to bring out the behaviour we don't intend to put on and how we can overcome it with active questions. The power of active questions has been studied on a set of participants where each one of them strive to answer six questions for positive thinking each day. There was an overwhelming response that it worked. A question that begins with 'Did I do my best to ...' triggers trying which changes everything. These questions for behavior change list can be anything we want. The objective for many people include health, family, relationships, money, enlightenment, and discipline. At the start, we may want to hit upon many improvements but the secret power of daily self questioning is that we either abandon our goals or we push ourselves into action.
The daily questions should be scored and reported to someone. That someone is a coach. A coach is a followup mechanism that instills accountability. Eventually we become our own coach

AIWATT is a principle recommended by the book based on the above discussion. It will reduce your daily volume of stress, conflict, debate and wasted time. It stands for Am I willing at this time to make the required investment to make a positive change on this topic ?

Like the physician's principle it requires you first to do no harm. It is a delaying mechanism and it should be deployed in the interval between the trigger and the behavior. It gives us time to consider a more positive response.

"Am  I willing" implies that we have a choice. "At this time" reminds us that it is about the present.
The only question is whether we are ready to engage in the efforts and spend some time.
The time we spend on topics where we can't make a positive difference is stolen from topics where we can.

More structure Is always helpful. Especially when we think I need help with this.

#codingexercise
List <int> GetFactors (int n)
{
Var ret = new List <int>();
// Pollard
Int I = 1;
Var r = new Random  ();
Int x = r.Next (n-1);
Int y = x;
Int k = 2;
For (;;)
{
I = I +1;
x = (x × x -1) % n;
D = gcd (y-x, n);
If d != 1 and d != n
     Ret.Add (d);
If ( I == k)
{
Y = x;
K = 2k;
}
If ( I > n )
     Break;
}
Return ret;
}