1 – Taking a Vacation: Congratulations, consider it your Sabbatical Leave: http://www.yourdictionary.com/sabbatical-leave

2 – Marriage Circular Dependency: Plz don’t insert Marriage within the Dependency, the Only thing I would have ever done from the things I haven’t done, was getting Married

Always remember this sentence

3 – Marriage the Goal vs. Marriage the Tool
I can’t find Marriage in neither…
I prefer “Marriage the Journey”
We can get rid of tools, we can let Goals go away, but we can’t do this with Marriage

Best Wishes, Wanna C U Next Week Plz

Prime numbers are odd numbers
For any prime number it shouldn’t be divisible by any of the previous prime numbers.

Technically:
>The first function is generating the next odd number exactly like xrange except that xrange has upper limit and this one doesn’t.

>I used 2,3,5 and 7 to initialize the primesList
>I initialized oddNumbers iterator with [7] and I used it in the for loop, so it’s going to generate 9, 11, 13, ..
>Another loop, the inner loop is doing the following
>>it’s looping on the primeNums list length.
>>it’s checking if the current number isn’t divisible by all numbers then it:
>>> counts it (as we only need 1000 primes)
>>> add it to the summation
>>> add it to the primeNums list so next time it should be included in the checking process.
>>else it will change the isPrime flag to false and will skip it to the next odd number

Note: I know count =3,sum= 17, if count=999 are all magic numbers and they should be commented to let you know what I’m doing
>>3 is the start index 2->0, 3->1, 5->2, 7->3
>>17 is the summation or 2,3,5,7
>>999 is the limit

clear enough ?

@esl4m:
أيوه أصل الحاجات دي كلها في آخر شهر بس
عشان تعرف بس إني صنديد ..
بالنسبة لعزاب أنا عندي اللي يملى ٣ ٤ مواقع كده كلام بس حاسس إني مش في الـ mood لسه