My sentiment expressed in the geekiest way possible.

Let n be the binary representation of π.

And, let s be the 30bit substring of n starting at 1862047722th index.

Finally, let f(x) be a function of binary string into alphabets such that x is divided into substrings of length 5 and following mapping is applied 00001 = a, 00010 = b, 00011 = c … and so on. ( 00000 is a space). (i.e. f(101000100101101) = tim) Assume always that length of x is divisible by 5.

Then my sentiment towards you can be summed up as following:

I f(s).

**Inspired by**: http://pisearch.lbl.gov/