Blag @feureau.com

iPhone Magic

feureau@yahoo.com (Feureau) — Fri, 05 Mar 2010 06:20:01 PST

Project Euler - Problem 16

feureau@yahoo.com (Feureau) — Fri, 05 Mar 2010 04:34:21 PST

Given the Problem:

2¹⁵ = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.
What is the sum of the digits of the number 2¹⁰⁰⁰?

Given the Solution in Python to get 2¹⁰⁰⁰:

>>> 2**1000
107150860718626732094842504 906000181056140481170553360 744375038837035105112493612 249319837881569585812759467 291755314682518714528569231 404359845775746985748039345 677748242309854210746050623 711418779541821530464749835 819412673987675591655439460 770629145711964776865421676 604298316526243868372056680 69376

Moving on to Java, we can now solve:

package projecteuler16;
public class Main {
public static void main(String[] args) {
String S="
107150860718626732094842504 906000181056140481170553360 744375038837035105112493612 249319837881569585812759467 291755314682518714528569231 404359845775746985748039345 677748242309854210746050623 711418779541821530464749835 819412673987675591655439460 770629145711964776865421676 604298316526243868372056680 69376

";
   int positionToAdd=0;
   int total=0;
   for (int i=0;i
   {
   total+=Integer.parseInt(S.substring(i, i+1));
   }
   System.out.println(total);
   }
}

The Solution in numerical value:

1366

Project Euler - Problem 15

feureau@yahoo.com (Feureau) — Fri, 05 Mar 2010 04:02:50 PST

Given the Problem:

Starting in the top left corner of a 22 grid, there are 6 routes (without backtracking) to the bottom right corner.

How many routes are there through a 2020 grid?

Given the Solution in Java:

package projecteuler15;
public class Main {
   public static void main(String[] args)
   {
   double n=40;
   double k=20;
   double c=getCombination(n,k);
   System.out.println(c);
   }
   public static double getCombination(double n, double k)
   {

   double x=Factorial(n);
   double y=(Factorial(k));
   double z=(Factorial(n-k));
   System.out.println(x);
   System.out.println(y);
   System.out.println(z);
   return x/(y*z);
   }

   public static double Factorial(double x)
   {
   double numberToReturn=1;
   for (double i=x;i>0;i--)
   {
   numberToReturn=numberToReturn*i;
   }
   //System.out.println(numberToReturn);
   return numberToReturn;
   }
}

Or, given the solution in Google:

(click to enlarge)

The Solution in numerical value:

1.3784652882000003E11 or in normalspeak:

137846528820

Project Euler - Problem 14

feureau@yahoo.com (Feureau) — Fri, 05 Mar 2010 03:56:24 PST

Given the Problem:

The following iterative sequence is defined for the set of positive integers:

n  n/2 (n is even)
n  3n + 1 (n is odd)
Using the rule above and starting with 13, we generate the following sequence:

13  40  20  10  5  16  8  4  2  1
It can be seen that this sequence (starting at 13 and finishing at 1) contains 10 terms. Although it has not been proved yet (Collatz Problem), it is thought that all starting numbers finish at 1.
Which starting number, under one million, produces the longest chain?

NOTE: Once the chain starts the terms are allowed to go above one million.

Given the Solution in Java:

/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/

package projecteuler13;

/**
*
* @author Feureau
*/
public class Main {
public static int currentNumberToSequence=0;
   /**
   * @param args the command line arguments
   */
   public static void main(String[] args) {
   int maximumNumberToSearch = 1000000;
   long longestChain=0;
   long startingNumber=0;

   long currentNumber=0;
   long currentChain=0;

   for (currentNumberToSequence=0; currentNumberToSequence<=maximumNumberToSearch; currentNumberToSequence++)
   {
   currentChain=returnNumberOfSequence();
   currentNumber=currentNumberToSequence;
   if (currentChain>longestChain)
   {
   longestChain=currentChain;
   startingNumber=currentNumber;
   }
   }
   System.out.println("");
   System.out.println("the longest chain, which is "+longestChain+" under "+maximumNumberToSearch+", starts at "+startingNumber);
   }

   public static long returnNumberOfSequence()
   {
   long lastNumberInSequence=currentNumberToSequence;
   long lengthOfChain=0;
   while(lastNumberInSequence>1)
   {
   if(isItEven(lastNumberInSequence))
   {
   lastNumberInSequence=isEvenSoGetNextNumber(lastNumberInSequence);
   lengthOfChain++;
   }
   else
   {
   lastNumberInSequence=isOddSoGetNextNumber(lastNumberInSequence);
   lengthOfChain++;
   }
   }
   return lengthOfChain;
   }

   public static boolean isItEven(long n)
   {
   if (n%2==0)
   {
   return true;
   } else
   {
   return false;
   }
   }

   public static long isEvenSoGetNextNumber(long n)
   {
   return n/2;
   }

   public static long isOddSoGetNextNumber(long n)
   {
   return (3*n)+1;
   }

}

The Solution in numerical value:

837799

Project Euler - Problem 12

feureau@yahoo.com (Feureau) — Wed, 03 Mar 2010 14:53:37 PST

Given the Problem:

The sequence of triangle numbers is generated by adding the natural numbers. So the 7^th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be:

1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...
Let us list the factors of the first seven triangle numbers:

1: 1
3: 1,3
6: 1,2,3,6
10: 1,2,5,10
15: 1,3,5,15
21: 1,3,7,21
28: 1,2,4,7,14,28
We can see that 28 is the first triangle number to have over five divisors.
What is the value of the first triangle number to have over five hundred divisors?

Given the Solution in Java:

/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/

package projecteuler12;

/**
*
* @author Feureau
*/
public class Main {

   /**
   * @param args the command line arguments
   */
   public static void main(String[] args) {
   // TODO code application logic here
   long finalAnswer=0;
   int targetNumberOfDivisor=500;
   long numberOfDivisor=0;
   long nthTriangleNumber=1;
   long triangleNumber=0;
   for (;numberOfDivisor
   {
   triangleNumber+=nthTriangleNumber;
   numberOfDivisor=returnNumberOfDivisor2(triangleNumber);
   if(nthTriangleNumber%100==0)
   {
   if(nthTriangleNumber==1)
   {
   System.out.println(nthTriangleNumber+"st Triangle Number is "+triangleNumber+" with "+numberOfDivisor+" number of divisor.");
   }
   if(nthTriangleNumber==2)
   {
   System.out.println(nthTriangleNumber+"nd Triangle Number is "+triangleNumber+" with "+numberOfDivisor+" number of divisor.");
   }
   if(nthTriangleNumber==3)
   {
   System.out.println(nthTriangleNumber+"rd Triangle Number is "+triangleNumber+" with "+numberOfDivisor+" number of divisor.");
   }
   if(nthTriangleNumber>3)
   {
   System.out.println(nthTriangleNumber+"th Triangle Number is "+triangleNumber+" with "+numberOfDivisor+" number of divisor.");
   }
   }
   finalAnswer=triangleNumber;
   }
   System.out.println("the first triangle number to have over "+targetNumberOfDivisor+" divisors is "+finalAnswer+". Which is the "+nthTriangleNumber+"th triangle number.");
   }

   public static long returnNumberOfDivisor(long x) //Brute Force: Very very slow
   {
   int total = 0;
   for(int i=1; i
   {
   if(x%i == 0) total+=1;
   }
   return total;
   }

   public static long returnNumberOfDivisor2(long sum) //Much faster algorithm
   {
   long divisors = 2;
   double root = Math.sqrt(sum);
   for(int i = 2; i <= root ; i++)
   {
   if(sum % i == 0)
   {
   divisors += 2;
   }
   }
   return divisors;
  }
}

The Solution in numerical value:

76576500

Project Euler - Problem 11

feureau@yahoo.com (Feureau) — Wed, 03 Mar 2010 14:53:48 PST

Given the Problem:

In the 2020 grid below, four numbers along a diagonal line have been marked in red.

08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66
88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69
04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36
20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48
The product of these numbers is 26 63 78 14 = 1788696.
What is the greatest product of four adjacent numbers in any direction (up, down, left, right, or diagonally) in the 2020 grid?

Given the Solution in Java:

/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/

package projecteuler11;
import java.util.StringTokenizer;

/**
*
* @author Feureau
*/
public class Main {

   /**
   * @param args the command line arguments
   */
   public static void main(String[] args) {
   // TODO code application logic here
   String[] s;
   s = new String[20];
   int[][] i;
   i = new int[20][20];
   long greatestProduct=0;
   long finalAnswer=0;
   long greatestProductPlaceholder=1;

   s[0]="08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08";
   s[1]="49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00";
   s[2]="81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65";
   s[3]="52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91";
   s[4]="22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80";
   s[5]="24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50";
   s[6]="32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70";
   s[7]="67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21";
   s[8]="24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72";
   s[9]="21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95";
   s[10]="78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92";
   s[11]="16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57";
   s[12]="86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58";
   s[13]="19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40";
   s[14]="04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66";
   s[15]="88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69";
   s[16]="04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36";
   s[17]="20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16";
   s[18]="20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54";
   s[19]="01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48";
   for(int x=0;x<20;x++){
   for(int y=0;y<20;y++){//
   i[x][y]=ReturnInt(s[x],y);
   }
   }

   //prints out entire grid in int
   /*for(int x=0;x<20;x++){
   for(int y=0;y<20;y++){
   System.out.print(i[x][y]+" ");
   }
   System.out.println("");
   }*/

   //checks for greatest product of four horizontally adjacent number
   greatestProduct=0;
   greatestProductPlaceholder=1;
   for(int x=0;x<20;x++){
   for(int y=0;y+3<20;y++){//
   int[] z;
   z=new int[4];
   System.out.print("Multiplying ");
   for(int zz=0;zz<4;zz++)
   {
   z[zz]=i[x][y+zz];
   System.out.print(z[zz]+" ");
   greatestProductPlaceholder*=z[zz];
   }
   System.out.println(" = "+ greatestProductPlaceholder);

   if(greatestProductPlaceholder>greatestProduct)
   {
   System.out.println("Currently Found greatest number: "+greatestProductPlaceholder);
   greatestProduct=greatestProductPlaceholder;
   }
   greatestProductPlaceholder=1;
   }
   }
   System.out.println("Greatest Product of four horizontally adjacent number is "+greatestProduct);
   if(finalAnswer<=greatestProduct){finalAnswer=greatestProduct;}

   /* //checks for greatest product of four vertically adjacent number short version
   greatestProduct=0;
   for(int y=0;y<20;y++){
   for(int x=0;x+4<20;x++){//
   int z=0;
   z=i[x][y]*i[x+1][y]*i[x+2][y]*i[x+3][y];
   if(z>greatestProduct)
   {
   System.out.println("Currently Found greatest number: "+z);
   greatestProduct=z;
   }
   }
   }
   System.out.println("Greatest Product of four vertically adjacent number is "+greatestProduct);
   if(finalAnswer<=greatestProduct){finalAnswer=greatestProduct;}*/

   //checks for greatest product of four vertically adjacent number
   greatestProduct=0;
   greatestProductPlaceholder=1;
   for(int y=0;y<20;y++){
   for(int x=0;x+3<20;x++){//
   int[] z;
   z=new int[4];
   System.out.print("Multiplying ");
   for(int zz=0;zz<4;zz++)
   {
   z[zz]=i[x+zz][y];
   System.out.print(z[zz]+" ");
   greatestProductPlaceholder*=z[zz];
   }
   System.out.println(" = "+ greatestProductPlaceholder);

   if(greatestProductPlaceholder>greatestProduct)
   {
   System.out.println("Currently Found greatest number: "+greatestProductPlaceholder);
   greatestProduct=greatestProductPlaceholder;
   }
   greatestProductPlaceholder=1;
   }
   }
   System.out.println("Greatest Product of four vertically adjacent number is "+greatestProduct);
   if(finalAnswer<=greatestProduct){finalAnswer=greatestProduct;}

   /*//checks for greatest product of four left leaning diagonally adjacent number short version
   greatestProduct=0;
   for(int y=0;y+4<20;y++){
   for(int x=0;x+4<20;x++){//
   int z=0;
   z=i[x][y]*i[x+1][y+1]*i[x+2][y+2]*i[x+3][y+3];
   if(z>greatestProduct)
   {
   System.out.println("Currently Found greatest number: "+z);
   greatestProduct=z;
   }
   }
   }
   System.out.println("Greatest Product of four left leaning diagonally adjacent number is "+greatestProduct);
   if(finalAnswer<=greatestProduct){finalAnswer=greatestProduct;}*/


   //checks for greatest product of four left leaning diagonally adjacent number number
   greatestProduct=0;
   greatestProductPlaceholder=1;
   for(int x=0;x+3<20;x++){
   for(int y=0;y+3<20;y++){//
   int[] z;
   z=new int[4];
   System.out.print("Multiplying ");
   for(int zz=0;zz<4;zz++)
   {
   z[zz]=i[x+zz][y+zz];
   System.out.print(z[zz]+" ");
   greatestProductPlaceholder*=z[zz];
   }
   System.out.println(" = "+ greatestProductPlaceholder);

   if(greatestProductPlaceholder>greatestProduct)
   {
   System.out.println("Currently Found greatest number: "+greatestProductPlaceholder);
   greatestProduct=greatestProductPlaceholder;
   }
   greatestProductPlaceholder=1;
   }
   }
   System.out.println("Greatest Product of four left leaning diagonally adjacent number is "+greatestProduct);
   if(finalAnswer<=greatestProduct){finalAnswer=greatestProduct;}

   /*//checks for greatest product of four right leaning diagonally adjacent number short version
   greatestProduct=0;
   for(int y=4;y+4<20;y++){
   for(int x=4;x+4<20;x++){//
   int z=0;
   z=i[x][y]*i[x-1][y-1]*i[x-2][y-2]*i[x-3][y-3];
   if(z>greatestProduct)
   {
   greatestProduct=z;
   System.out.println("Currently Found greatest number: "+z);
   }
   }
   }
   System.out.println("Greatest Product of four right leaning diagonally adjacent number is "+greatestProduct);
   if(finalAnswer<=greatestProduct){finalAnswer=greatestProduct;}*/

   //checks for greatest product of four right leaning diagonally adjacent number number
   greatestProduct=0;
   greatestProductPlaceholder=1;
   for(int x=0;x<17;x++){
   for(int y=3;y<17;y++){//
   int[] z;
   z=new int[4];
   System.out.print("Multiplying ");
   for(int zz=0;zz<4;zz++)
   {
   z[zz]=i[x+zz][y-zz];
   System.out.print(z[zz]+" ");
   greatestProductPlaceholder*=z[zz];
   }
   System.out.println(" = "+ greatestProductPlaceholder);

   if(greatestProductPlaceholder>greatestProduct)
   {
   System.out.println("Currently Found greatest number: "+greatestProductPlaceholder);
   greatestProduct=greatestProductPlaceholder;
   }
   greatestProductPlaceholder=1;
   }
   }
   System.out.println("Greatest Product of four right leaning diagonally adjacent number is "+greatestProduct);
   if(finalAnswer<=greatestProduct){finalAnswer=greatestProduct;}

   System.out.println("Final Answer: " + finalAnswer);

   }

   public static int ReturnInt(String s, int x)
   {
   x=19-x; //otherwise each row would be reversed
   int integerToReturn=0;
   String stringPlaceholder;
   StringTokenizer st = new StringTokenizer(s);
   while (st.countTokens() >x) {
   stringPlaceholder=st.nextToken();
   integerToReturn=Integer.parseInt(stringPlaceholder);
   }

   String parserString;

   return integerToReturn;
   }

}

The Solution in numerical value:

70600674

Why aren't women allowed in front-line combat?

feureau@yahoo.com (Feureau) — Tue, 02 Mar 2010 09:33:42 PST

From the report of the Presidential Commission on the Assignment of Women in the Armed Forces dated November 15, 1992, it states in part:

The average female Army recruit is 4.8 inches shorter, 31.7 pounds lighter, has 37.4 fewer pounds of muscle, and 5.7 more pounds of fat than the average male recruit. She has only 55 percent of the upper-body strength and 72 percent of the lower-body strength.

An Army study done in 1988 found that women are more than twice as likely to suffer leg injuries and nearly five times as likely to suffer fractures as men.

Further, the Commission heard an abundance of expert testimony including:
- women's aerobic capacity is significantly lower, meaning they cannot carry as much as far as fast as men, and they are more susceptible to fatigue.
- in terms of physical capability, the upper five percent of women are at the level of the male median. The average 20-to-30 year-old woman has the same aerobic capacity as a 50 year-old man.

After a study was conducted at the U.S. Military Academy at West Point, one expert testified that:
- using the standard Army Physical Fitness Test, the upper quintile (top 20%) of women at West point achieved scores on the test equivalent to the bottom quintile (bottom 20%) of men.
- only 21 women out of the initial 623 (3.4%) achieved a score equal to the male mean score of 260.
- on the push-up test, only 7% of women can meet a score of 60, while 78% of men exceed it.
- adopting a male standard of fitness at West Point would mean 70% of the women he studied would be separated as failures at the end of their junior year, only 3% would be eligible for the Recondo badge, and not one would receive the Army Physical Fitness badge.

Also, recent studies indicate women are more at risk to getting PTSD, as documented from Iraq and Afghanistan, women who were never in direct combat but whose camps were shelled were more likely to develop PTSD than there male counter-parts.

What gives your life meaning?

feureau@yahoo.com (Feureau) — Sat, 27 Feb 2010 12:39:10 PST

The head monk of a Zen order (which I wrote about in an IAmA) was hanging out at Starbucks once when a guy said that he was dressed funny and asked if he was some kind of monk. When the monk said yes the guy asked, "so what's the meaning of life then, huh?" The monk answered, "to do the best that you can."
That used to sound pointless if not simplistic to me, but I've come to see what he meant. Everyone has potential, and I think the point is to make the best of it. Every moment counts, whether it's being careful in washing the dishes, or putting yourself forward to be rich and famous. The crux of the meaning is sort of lodged in (and it's possible to physically apprehend this, it's like a subtle physical gut feeling, more subtle than emotions) the 'how' and 'why' of what you're doing, whereas what you're doing in an external sense - what people normally refer to as meaningful - is changing and developing all the time. If family is meaningful to you and you lose them, does that mean that your life is meaningless? Of course not.
So right now, what's giving my life meaning? Writing this.

A New Approach to Women

feureau@yahoo.com (Feureau) — Sat, 20 Feb 2010 19:10:02 PST

Let's face it. We're no strangers to love. You know the rules, and so do I.

Conflicting interest

Of the many facets of life that bugs me, none is more troublesome than a girl that comes to mind. I’m just like that. I’m a sucker when it comes to love, and there’s one like me born every minute. And to say that I have encountered quite a few, is quite an understatement. However, to the many encounter, I must say I’ve become quite conflicted.

One girl complained that I walked too fast, and that she always falls behind. Another told me that I walked too slow.

One girl told her friend that I was too kind to her. Then she told me that I'm getting blacklisted because I act like a jerk.

One girl told me that I'm always following her. Another keeps asking me where I'd been.

One girl always sticks around with me. Then she turned around and told another guy that she loves him.

One girl told me that I'm overspending too lavishly. Another told me that I'm a scrooge.

One girl always asks me for help, which I gladly provide. Then she yelled at me and said that she doesn't need a friend like me.

Do I need to go on?

One girl said that she wished I have chosen her. Perhaps she should be relieved that I'm not into her.

I'm not an evil guy, you know. I try to be good.

I try to speak politely, I try to act gentle. I hold doors open for ladies and let them in first. A girl once complained to her boyfriend because I opened the car door for her, and he never did. I always try to give them the best that I have. I remain loyal to them, and even though I got hurt, I never once raised my voice to someone I'm deeply in love.

I've had had it with all your fuckin' bullshit.

I wonder if there's anything a girl could do or say to me, to show that she love me, or even remotely like me, that I wouldn't consider a goddamn lie.

The Big Question

The question often asked by men is "What does women want?"

The answer is, of course, "Them bitches don't even know what the motherfuckin shit they want."

Now, don’t get me wrong. As individuals, they’re awesome. They’re the architects, the doctor, the Googler, the musician, the artist, the priest. They are what I consider the best of them bunches.

But they still do ask the same goddamn question. “Why do you like me?” and all that flirty girly questions. What if one day I change and all. I mean, I think I’m beyond all that. The first time I answer them regular questions, I was like, “whoa”. But after a while, they become, “Meh.”

After sampling a bunch of them, it dawns on me that they’re all pretty much the same, in their own unique way.

Another common denominator in the equation is that they all involve me. And looking back, I hope I understand their personality enough that I can predict their behavior pretty well. I just don’t have the required capacity, or the heart, to manipulate them to yield the result I wanted.

All I ask of them is for them to be their own uniquely perfect flawed state, and let me be mine.

None seem to be getting this. None seem to understand me well enough. None seem to understand me as much as I try to understand them.

I put up with abuses, other men, monetary issues, smoking, and other insignificant shit that you think wouldn’t reduce a person’s dignity or character in a way that one would consider them unwanted members of society.

Yet, I’ve been told so many conflicting things.

I’ve been working under the assumption that Love is selfless, it’s forever giving, and pure.

Until I read James Cameron’s intervew on Playboy. (Don’t you read said magazine for the high quality article? Just as a footnote to y’all chuckelin’, I once said, and I quote “Sex to me is reading a good book on weekends.”

The James Cameron Approach

Apparently, the successful director has been having quite a string of former lovers. The dude was married five times, each ending in divorce. Reading from some interviews with his former wives, they all think negatively of him.

That means, girl thinks he stinks as a lover.

At the brink of the end of his fifth marriage, his marriage counselor told him, “Do it not for her, do it for yourself.” and that got him thinkin’.

It sure got me thinkin. I mean, we’ve been told that true love is forever giving, self-sacrificing, but honestly, that didn’t end up very well for Romeo (of Juliet’s) and Jack (of Titanic). For the everyday life, the idea of love being self sacrificing, didn’t work for me. I ended up feeling used and disappointed when the other party didn’t respond as I expected.

The idea of doing it for yourself, has worked so far for James Cameron. It seems to have saved his fifth marriage.

So, let’s try that. I think that’d work. Do it not for the other party, do it for yourself. But it doesn’t mean that you have to become selfish, and use the other party only to your satisfaction and abandon her. It means, that you’re doing it to make you happy, though that happiness is not by hoping that you’d be getting anything back from the activities, but actually getting something back from the activities.

Is it possible to be happy?

feureau@yahoo.com (Feureau) — Sat, 13 Feb 2010 10:57:40 PST

"I agree. Happiness is an unrealistic goal. This may sound pessimistic but it is really in fact quite liberating. When I read what I just wrote I cringe cause I've always hated people who say things like that--but saying what I just did does not mean that you cannot be happy. What I mean is that happiness lies in not realizing you are happy. Just as when shoes are comfy you are unaware that you are wearing shoes and when you have no back problems you are not conscious of your back, to be happy you shouldn't be asking yourself if you are happy or not. Those moments in life where you realize everything is good and that you "should" be happy, don't you just find those really quite depressing instead? You are the most happy when you are laughing and eating and drinking and talking with friends and forget about everything else. Or even when reading a book or listening to music by yourself. This is not to say you shouldn't think about life. On the contrary, contemplation is a good way to "loose yourself", because that's what you are doing when you are really happy. You are loosing your feeling of sense and just being there. This is why to be happy one should try to loose the idea that you "should" be happy in the first place. The idea that we "must" be happy is what causes all our unhappiness in the first place. That causes us to try to force ourselves to be happy, and this is not something that is possible. For one cannot win, but only be winning. And one can only be winning if there is losing. And one cannot be winning if he or she himself or herself is not loosing some of the time. I agree that you can choose whether or not you are happy, but that sounds as if you can just will yourself to be happy which you cannot do. You can only choose how you want to approach everything. If you choose to approach it with a sense of fun and humor, with a twinkle in your eye and a knowing wink that everything is just a game and to "try" to win but not to get upset if you aren't winning, cause that's part of the game. The most important thing is two things. One is to know that life is a game--not that it is not serious but that the goal of it is to simply have fun. And two is to approach the game of life with the utmost sense of sportsmanship. Knowing that even those who stand in the way of your happiness are not to be hated because they are just players in the game like yourself.
I could also talk a lot about how the fact that society forces you to act as an individual independent of the universe is a complete paradox that confuses your subconscious to the point of severe unhappiness. Cause how could you be separate from the universe if it is the universe itself that is (haha) forcing you to be separate? We are all interconnected etcetera blah blah blah.
And if that doesn't make you feel any better than let me kind of say what I just said in a different way.
Sorrow is the foundation of beauty and it is ok to be unhappy, as it is out of this unhappiness that we produce our best and most wonderful creations.
Sending good vibrations your way op =]"

Anonymous to Australia

feureau@yahoo.com (Feureau) — Wed, 10 Feb 2010 17:49:08 PST

To the members of the Australian government,
This is a message concerning the recent actions directed at high profile government websites by members of the organization that has become known as anonymous. We are delivering this message to inform you of the reasoning behind these actions, to enlighten you to the mistakes that you have made. Your attempts to construct a government mandated blacklist has been under our watchful eyes for quite some time, but your steps to finalize this plan have finally allowed us to take action. Your choice to ban material under the guise of the good of your people, your notions of right and wrong have forced us to remind you of the purpose behind the internet.
We have tolerated your single minded ideology for long enough, and will see to it that you are informed of the issues that are clear to the rest of the internet as a whole. Your choice to make moves against the pornography industry are not the sole focus of our actions, rather this is the final straw in a long chain of choices that inform us that you are preparing to censor your people, that you are no longer acting in their best interest.
You are acting in direct opposition to the best interest of your citizens, and we intend to help them realize this, along with the rest of the globe as a message that we will not allow the internet to be censored by any group, organization, or government. We shall free your people from a country that is oppressing their right to access information; we shall be the shining beacon in the darkness that you are casting over the single most powerful tool available to humanity.
Your decision to censor ideas in the vein notion of protection, are only serving to harm the complete freedom of information that is present. As such, until you have acknowledged your failures to your people, we will continue our actions to free them from your attempts to censor information.
Knowledge is free.
We are anonymous,
We are legion,
We do not forgive,
We do not forget...
Expect us.

Raw Video: Darth Vader Opens Wall Street

feureau@yahoo.com (Feureau) — Thu, 04 Feb 2010 16:25:01 PST

Montreal Caffe Art Java

feureau@yahoo.com (Feureau) — Thu, 04 Feb 2010 16:10:50 PST

Awesomest Caffe Art ever!

Imagine all the dot coms

feureau@yahoo.com (Feureau) — Thu, 04 Feb 2010 16:01:08 PST

I was looking for a new domain name this past few days, and one thought crop out that it'd be nice to get a domain name from a John Lennon song, Imagine. And I found that ... well... See for yourself. Here's the lyric to the song:

http://imaginetheresnoheaven.com/ - spam site
http://itseasyifyoutry.com/ - spam site
http://nohellbelowus.com/ - quotes collection
http://www.aboveusonlysky.com/ - spam
http://imagineallthepeople.com/ - There are 6,491,595,326 people in the world.
http://livingfortoday.com/ - for sale $1,888.00

http://imaginetheresnocountries.com/ - available
http://itisnthardtodo.com/ - available
http://nothingtokillordiefor.com/ - available
http://andnoreligiontoo.com/ - forwards to http://www.evenues.com/
http://imagineallthepeople.com/ - Each dot below represents 10,000 people
http://livinglifeinpeace.com/ - parked with godaddy

http://youmaysaythatimadreamer.com/ - parked with godaddy
http://butimnottheonlyone.com/ - parked with godaddy
http://Ihopesomedayyoulljoinus.com - taken
http://andtheworldwillbeasone.com/ - some sort of blog

http://imaginenopossessions.com/ - parked with godaddy
http://iwonderifyoucan.com/ - available
http://noneedforgreedorhunger.com/ - available
http://abrotherhoodofman.com/ - taken
http://imagineallthepeople.com/ - As users register, the blocks will start to fill.
http://sharingalltheworld.com/ - parked with godaddy

http://youmaysaythatimadreamer.com/ - parked with godaddy
http://butimnottheonlyone.com/ - taken
http://ihopesomedayyoulljoinus.com/ - taken
http://Andtheworldwillliveasone.com/ - available

10 coolest experiments of Google Labs

feureau@yahoo.com (Feureau) — Tue, 02 Feb 2010 11:52:43 PST

1. Sky Map for Android
What it does: Turns your Android-powered mobile phone into an informational window on the night sky.
Why it's cool: Because three dots don't actually look like a centaur. Because sometimes you're curious about the heavens. Because you forgot that the Southern Hemisphere has a different set of stars. Because your kids will love it.

2. Google Fusion Tables
What it does: Makes it easy to manage and visualize large datasets in the cloud.
Why it's cool: So many reasons! The initial gallery of datasets is phenomenal, including info on climate change, health statistics, and country flags, to name a few. Charts and maps can be exported to Web sites and will update automatically. You can collaborate on the data itself with Google's normal functionality, apply filters, merge data from multiple tables… plus it's just fun to play with.

3. Chrome Experiments
What it does: Showcases the totally awesome things being built with JavaScript by clever people everywhere.
Why it's cool: Because there are clever people everywhere. Chrome Experiments is like an interactive science museum for grown-ups. Play Browser Ball ("more fun than it looks") or Browser Pong, mess around with strange attractors and Mandelbrot sets, or just kick back and enjoy the surprisingly seductive Scroll Clock.

4. Google Audio Indexing
What it does: Uses speech technology for videos to allow you to search them and jump to the point where particular phrases are spoken.
Why it's cool: The ability to index and search images and videos has made giant strides in recent years, and any steps along that path are worthwhile. Audio Indexing is far from perfect (a search for "New Zealand" pulled up David Letterman saying "he's only"), but it's definitely a functionality that will revolutionize the way we interact with video.

5. Google Code Search
What it does: Allows you to search public source code.
Why it's cool: Because if you're a coder, you shouldn't waste even a minute reinventing the wheel unless you happen to know for a fact that the wheel sucked and you could do a much better job.

6. Google Goggles
What it does: Allows you to use a picture taken on your mobile phone as a search query.
Why it's cool: For the same reason Shazam (the iPhone app that tells you what song is playing) is cool. When you see something interesting, you don't always know what words to use for a relevant search. Goggles lets you snap a picture of the Golden Gate Bridge (for example) and instantly access history, weather, nearby locales, and more. (Note: this feature is totally different from Gmail's Goggles, which requires you to do simple math to protect you from sending drunken e-mails.)

7. Android Scripting Environment
What it does: Allows you to edit and execute scripts directly on an Android device.
Why it's cool: Because when you're coding, you want to code all the time — not just when you're sitting at your computer.

8. Google Moderator
What it does: Community voting and crowdsourcing of questions and comments.
Why it's cool: Everyone wants a chance to be heard. Moderator offers a simple mechanism to allow entire audiences to participate in conversations without degenerating into total chaos.

9. Browser Size
What it does: Overlays a template onto any Web site, showing what percentage of the online population will be able to view what area.
Why it's cool: Because it works on visible browser area, not screen resolution, it gives developers and designers an accurate, instant understanding of which key elements ("Donate Now" button, for example) are getting lost.

10. Google Mars
What it does: Like Google Earth, but for Mars.
Why it's cool: Mars is cool. Google Mars is beautiful. Also, if there were life on Mars, Google Mars would allow us to look at the roofs of their houses. Also, because it's astonishing that Google already has landmarks on Mars.

Google Docs: A love letter

feureau@yahoo.com (Feureau) — Tue, 02 Feb 2010 11:19:21 PST

Rookie2

feureau@yahoo.com (Feureau) — Sat, 30 Jan 2010 05:40:55 PST

Click to Play

Amazing Japanese Fake Pool

feureau@yahoo.com (Feureau) — Fri, 29 Jan 2010 19:26:28 PST

A hand for One Motorcycler

feureau@yahoo.com (Feureau) — Fri, 29 Jan 2010 09:03:24 PST

Click to Play

Giving a hand for a motorcycler who is leaving. Well, the guy already paid the other guy for parking, but you know what I mean.

Look at the Sidewalk

feureau@yahoo.com (Feureau) — Fri, 29 Jan 2010 09:03:23 PST

Click to Play

The sidewalk is for people and motorcycles.

Breaking Dawn

feureau@yahoo.com (Feureau) — Fri, 29 Jan 2010 09:00:32 PST

Click to Play

Breaking Dawn

feureau@yahoo.com (Feureau) — Fri, 29 Jan 2010 08:58:24 PST

Click to Play

Charlie Brooker - How To Report The News

feureau@yahoo.com (Feureau) — Thu, 28 Jan 2010 14:44:58 PST

Crazy Nuts Illusion!

feureau@yahoo.com (Feureau) — Thu, 28 Jan 2010 09:19:02 PST

Interactive Keyboard!

feureau@yahoo.com (Feureau) — Thu, 28 Jan 2010 08:25:51 PST

Choose from 3 different sounds. Synth, piano and drums!

The keyboard is a little buggy. So if it stops working properly, just hit refresh.

Instructions for your new keyboard!

1. When video starts, press pause until the video has fully loaded.

2. Once you see the keyboard, Press the power button.

3. Start playing the synth.

4. Select piano or drums

Have fun!