<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/2.2.1" -->
<rss version="0.92">
<channel>
	<title>Tafakuri</title>
	<link>http://tafakuri.net</link>
	<description>fikira nzito kuhusu jambo fulani; mazingatio; taamuli</description>
	<lastBuildDate>Mon, 30 Aug 2010 14:00:37 +0000</lastBuildDate>
	<docs>http://backend.userland.com/rss092</docs>
	<language>en</language>
	
	<item>
		<title>Two numbers</title>
		<description>
Here is an interesting puzzle that was posted to one of the discussion groups at work.


A teacher tells two students that he is thinking of two natural numbers greater than 1.  He tells the first student the product of the two numbers and the second one their sum.  The students ...</description>
		<link>http://tafakuri.net/?p=78</link>
			</item>
	<item>
		<title>Project Euler: Happy numbers</title>
		<description>Problem 92 from Project Euler asks us to find the number of non-Happy numbers under 10 million:
A number chain is created by continuously adding the square of the digits in a number to form a new number until it has been seen before.

For example,

44 -&#62; 32 -&#62; 13 -&#62; 10 ...</description>
		<link>http://tafakuri.net/?p=77</link>
			</item>
	<item>
		<title>Nerdy t-shirts</title>
		<description>Working at a software company, I've gotten to see a fair share of nerdy t-shirts. There are the those celebrating various video games, software launches etc. Then there are the programming references ("Wanna grab a byte?").

Probably nobody does programming humor better than XKCD - their "my code is compiling" and ...</description>
		<link>http://tafakuri.net/?p=76</link>
			</item>
	<item>
		<title>Presence Africaine</title>
		<description>I recently finished reading “The Surreptitious Speech: Présence Africaine and the Politics of Otherness “ , a compilation of essays edited by Valentine Mudimbe. The collection celebrates 40 years of the journal Presence Africaine.

Mudimbe writes a very engaging summary at the end of the compendium, in which he lays the ...</description>
		<link>http://tafakuri.net/?p=74</link>
			</item>
	<item>
		<title>A round-up of fun toys and tools</title>
		<description>Microsoft does a poor job of advertising new products, especially those in beta. Often this leads to the impression that Microsoft does not innovate. Here are some new products I’ve been playing with/using that are pretty cool.

	PowerPoint Plex (pptPlex) from Office Labs (http://www.officelabs.com/projects/pptPlex/Pages/default.aspx).If you’ve ever wished your slideshow could be ...</description>
		<link>http://tafakuri.net/?p=72</link>
			</item>
	<item>
		<title>Summing numbers that cannot be written as a sum of two abundant numbers</title>
		<description>Problem 23 from Project Euler asks for the sum of numbers that cannot be written as the sum of two abundant numbers:
A perfect number is a number for which the sum of its proper divisors is exactly equal to the number. For example, the sum of the proper divisors of ...</description>
		<link>http://tafakuri.net/?p=71</link>
			</item>
	<item>
		<title>Length of cycles in unit fractions</title>
		<description>Problem 26 of Project Euler asks us to find the length of cycles in unit fractions:
A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given:



1/2
=
0.5


1/3
=
0.(3)


1/4
=
0.25


1/5
=
0.2


1/6
=
0.1(6)


1/7
=
0.(142857)


1/8
=
0.125


1/9
=
0.(1)


1/10
=
0.1



Where 0.1(6) means 0.166666..., and has a 1-digit recurring cycle. It can be seen ...</description>
		<link>http://tafakuri.net/?p=69</link>
			</item>
	<item>
		<title>Project Euler: nth lexicographic permutation</title>
		<description>Problem 24 from Project Euler asks us to find the nth lexicographic permutation of a sequence of digits:
A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. If all of the permutations are listed numerically or alphabetically, ...</description>
		<link>http://tafakuri.net/?p=68</link>
			</item>
	<item>
		<title>Project Euler: Determining the number of paths in a grid</title>
		<description>For problem 15 from Project Euler, we are asked to find the number of paths leading from the top left corner of a grid to the bottom right corner that do not involve backtracking.
Starting in the top left corner of a 2 by 2 grid, there are 6 routes (without ...</description>
		<link>http://tafakuri.net/?p=66</link>
			</item>
	<item>
		<title>Project Euler: finding maximal sum of path in a graph</title>
		<description>Problem 18 in Project Euler reminded me of shortest path algorithms in graph theory. The goal is to determine the maximal sum you can compute when traveling from the top to the bottom of a triangle.
By starting at the top of the triangle below and moving to adjacent numbers on ...</description>
		<link>http://tafakuri.net/?p=65</link>
			</item>
</channel>
</rss>
