<?xml version="1.0" encoding="UTF-8" ?>
<?xml-stylesheet type="text/xsl" href="http://blogs.msdn.com/utility/FeedStylesheets/rss.xsl" media="screen"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/"><channel><title>Code 4 Bill</title><link>http://blogs.msdn.com/code4bill/default.aspx</link><description>This is the Code4Bill blog. If you're looking for the contest site, head on over to &lt;a href="http://www.code4bill.com"&gt;http://www.code4bill.com&lt;/a&gt;</description><dc:language>en-US</dc:language><generator>CommunityServer 2.1 SP1 (Build: 61025.2)</generator><item><title>Fibonacci system</title><link>http://blogs.msdn.com/code4bill/archive/2005/12/20/505872.aspx</link><pubDate>Tue, 20 Dec 2005 15:50:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:505872</guid><dc:creator>sriram</dc:creator><slash:comments>3</slash:comments><comments>http://blogs.msdn.com/code4bill/comments/505872.aspx</comments><wfw:commentRss>http://blogs.msdn.com/code4bill/commentrss.aspx?PostID=505872</wfw:commentRss><description>&lt;P&gt;We typically learn binary system, hex system in our courses. Most of them are predictable in their position values or they are linear. This system is not linear as its dependant on Fibonacci series.&amp;nbsp;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;3 is the first duplicate (ignoring 1 as we started with 1). We can represent 3 as 100 or as 011.From there you have many duplicate representations. There are some numbers which can be represented only one way.&amp;nbsp;&lt;/P&gt;
&lt;P&gt;If you find that sequence please let me know. Those numbers are also interesting&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;- Perraju&lt;BR&gt;&lt;/P&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=505872" width="1" height="1"&gt;</description></item><item><title>Two digit numbers</title><link>http://blogs.msdn.com/code4bill/archive/2005/12/18/505211.aspx</link><pubDate>Sun, 18 Dec 2005 17:35:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:505211</guid><dc:creator>sriram</dc:creator><slash:comments>2</slash:comments><comments>http://blogs.msdn.com/code4bill/comments/505211.aspx</comments><wfw:commentRss>http://blogs.msdn.com/code4bill/commentrss.aspx?PostID=505211</wfw:commentRss><description>&lt;P&gt;&amp;nbsp;I always wondered how to place digits 0 to 9 in a matrix which contains all the digits from 00 to 99 and what is the minimum matrix size that is needed.In this question we are trying to enumerate the number of numbers we can produce. Lot of people are thinking as to the number or rows, columns they would need and then summing them up.&amp;nbsp;&lt;/P&gt;
&lt;P&gt;That may not scale that well if we want to find all three digit numbers (not necessarily in sequence means first two digits in a row and third one diagonal).In a MxN matrix, 4 corners and first row, last row, first column and last column are interesting. The rest always has 8 neighbors.&amp;nbsp;&lt;/P&gt;
&lt;P&gt;Interesting to see what is the minimum M&amp;nbsp;x N that can hold all numbers from 00 to 99.&amp;nbsp;&lt;/P&gt;
&lt;P&gt;Thanks&lt;BR&gt;Perraju&lt;/P&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=505211" width="1" height="1"&gt;</description></item><item><title>Counting bits - continued</title><link>http://blogs.msdn.com/code4bill/archive/2005/12/18/505209.aspx</link><pubDate>Sun, 18 Dec 2005 17:32:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:505209</guid><dc:creator>sriram</dc:creator><slash:comments>4</slash:comments><comments>http://blogs.msdn.com/code4bill/comments/505209.aspx</comments><wfw:commentRss>http://blogs.msdn.com/code4bill/commentrss.aspx?PostID=505209</wfw:commentRss><description>&lt;P&gt;Lot of people sent code with counting bits method. Some people also sent the permutations sequence and expressions to say how many numbers exist before N that have same 1's in binary form.&amp;nbsp;&lt;/P&gt;
&lt;P&gt;Counting 1's in a number is better than O(N) algorithm where N is number of bits in the system. if we use the operators and machine instructions properly it can be with constant instruction (of course there are machine instructions which may be using all the bits of the number)&amp;nbsp;&lt;/P&gt;
&lt;P&gt;Example - take a two digit number of binary which is 2X + Y form, if you right shift it becomes X, now if I subtract second one from first we are left with X + Y (number of 1’s in the number)&amp;nbsp;&lt;/P&gt;
&lt;P&gt;All we need to do is make sure the place holders can hold the SUM values (if not break the problem) and find an efficient way to add them across different bit sizes (there are some divisors which can pass on the effective sum as they keep on adding the reminder at each stage)&amp;nbsp;&lt;/P&gt;
&lt;P&gt;Distinct number of SWAPS as we discussed earlier is a alternative column of Pascal triangle. Number of 1's (1 one's, 2 ones etc) are permutations problem. If we try to create a two dimensional table for each NUMBER of 1's relation to number of SWAPS there is one more pattern which is quite interesting.&amp;nbsp;&lt;/P&gt;
&lt;P&gt;Hope some one will crack that.&amp;nbsp;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;Thanks&lt;BR&gt;- Perraju&lt;/P&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=505209" width="1" height="1"&gt;</description></item><item><title>Number of 1s problem</title><link>http://blogs.msdn.com/code4bill/archive/2005/12/18/505208.aspx</link><pubDate>Sun, 18 Dec 2005 17:29:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:505208</guid><dc:creator>sriram</dc:creator><slash:comments>2</slash:comments><comments>http://blogs.msdn.com/code4bill/comments/505208.aspx</comments><wfw:commentRss>http://blogs.msdn.com/code4bill/commentrss.aspx?PostID=505208</wfw:commentRss><description>&lt;P&gt;Previously I&amp;nbsp;asked a question regarding the&amp;nbsp;distribution of how many swaps are needed to move array elements. Here we are trying to count the number of 1's. Counting number of 1's vs the distribution table (All numbers which have 2 1's and how many times they contribute to 0'swap, 1'swap and 2swap) was my interest.&lt;/P&gt;
&lt;P&gt;On one hand this problem is a permutations problem. But the fun is if you write a "count number of 1's" code which is less than O(N) complexity where N is number of bits.&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;- Perraju&lt;BR&gt;&lt;/P&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=505208" width="1" height="1"&gt;</description></item><item><title>December 13th brain teaser</title><link>http://blogs.msdn.com/code4bill/archive/2005/12/14/503491.aspx</link><pubDate>Wed, 14 Dec 2005 10:49:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:503491</guid><dc:creator>sriram</dc:creator><slash:comments>1</slash:comments><comments>http://blogs.msdn.com/code4bill/comments/503491.aspx</comments><wfw:commentRss>http://blogs.msdn.com/code4bill/commentrss.aspx?PostID=503491</wfw:commentRss><description>&lt;P&gt;[ Go to &lt;A href="http://www.microsoft.com/india/code4bill/SampleQuestion.aspx"&gt;http://www.microsoft.com/india/code4bill/SampleQuestion.aspx&lt;/A&gt;&amp;nbsp;to see the question - Sriram]&lt;/P&gt;
&lt;P class=MsoNormal&gt;&lt;FONT face=Arial size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: Arial"&gt;Trying to move to coding related&amp;nbsp;questions from number sequences. The reason I chose 32 is to make sure recursion doesn’t terminate quickly.&lt;/SPAN&gt;&lt;/FONT&gt;&lt;FONT face=Arial size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: Arial"&gt;Not trying to discourage recursion but real code for this shouldn’t take much time. So performance vs simple code is what matters here.&lt;/SPAN&gt;&lt;/FONT&gt;&lt;FONT face=Arial size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: Arial"&gt;&lt;?xml:namespace prefix = o ns = "urn:schemas-microsoft-com:office:office" /&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/P&gt;
&lt;P class=MsoNormal&gt;&lt;FONT face=Arial size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: Arial"&gt;Some one wrote to me that the program didn’t&amp;nbsp;finish executing&amp;nbsp;after 30mts. May be that’s not the way you should code for this.&lt;/SPAN&gt;&lt;/FONT&gt;&lt;FONT face=Arial size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: Arial"&gt;My program for this comes out in 8.93sec real (on KSH of Interix subsystem) for input 32.&lt;/SPAN&gt;&lt;/FONT&gt;&lt;FONT face=Arial size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: Arial"&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/P&gt;
&lt;P class=MsoNormal&gt;&lt;FONT face=Arial size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: Arial"&gt;Happy coding. I Will come back to numbers in few days.&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/P&gt;
&lt;P class=MsoNormal&gt;&lt;FONT face=Arial size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: Arial"&gt;&lt;o:p&gt;- Perraju&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/P&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=503491" width="1" height="1"&gt;</description></item><item><title>The power of 2! (Dec 12th Brain teaser)</title><link>http://blogs.msdn.com/code4bill/archive/2005/12/13/503034.aspx</link><pubDate>Tue, 13 Dec 2005 09:22:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:503034</guid><dc:creator>sriram</dc:creator><slash:comments>7</slash:comments><comments>http://blogs.msdn.com/code4bill/comments/503034.aspx</comments><wfw:commentRss>http://blogs.msdn.com/code4bill/commentrss.aspx?PostID=503034</wfw:commentRss><description>&lt;P&gt;&lt;EM&gt;[ To see the question referred to in this blog post, check out &lt;/EM&gt;&lt;A href="http://www.code4bill.com/"&gt;&lt;EM&gt;www.code4bill.com&lt;/EM&gt;&lt;/A&gt;&lt;EM&gt;&amp;nbsp; (the Dec 12th brain teaser) - Sriram Krishnan]&lt;/EM&gt;&lt;/P&gt;
&lt;P&gt;The previous two&amp;nbsp;questions were easy to crack by writing simple code. So I&amp;nbsp;thought&amp;nbsp;we could&amp;nbsp;use some machine power to actually infer the big number.The reason I picked 1048576 is&amp;nbsp;due to&amp;nbsp;it being&amp;nbsp;the first 7 digit number in the POWER series of two ( 2**1, 2**2,...).&amp;nbsp;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;I really am not expecting you to code to generate this&amp;nbsp;final number. Observer the&amp;nbsp;power series and crack it.&lt;/P&gt;
&lt;P&gt;- Perraju&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;BR&gt;&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=503034" width="1" height="1"&gt;</description></item><item><title>Oh My God!</title><link>http://blogs.msdn.com/code4bill/archive/2005/12/11/502521.aspx</link><pubDate>Sun, 11 Dec 2005 13:27:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:502521</guid><dc:creator>sriram</dc:creator><slash:comments>6</slash:comments><comments>http://blogs.msdn.com/code4bill/comments/502521.aspx</comments><wfw:commentRss>http://blogs.msdn.com/code4bill/commentrss.aspx?PostID=502521</wfw:commentRss><description>&lt;P&gt;I'm sure several people had had this experience. You spend a lazy Saturday at home whiling away your time and sleeping. Sunday morning, you come to work, open your email and you go 'Oh My God!' at something you see in your email and you curse yourself for not checking your mail the previous day. &lt;/P&gt;
&lt;P&gt;Well, I spent all of yesterday away from the computer. This morning, I check my email and my eyes almost popped out at the reaction to Code4Bill. The sheer volume of response from students is stunning - thank you!&lt;/P&gt;
&lt;P&gt;More than the fact that there is a New York Times article, more than the fact that there is a Cnet article, the fact that I'm most happy about is that we've been Slashdotted! This was my secret geek dream which has finally come true! Unfortunately, by the time I went to the page, the conversation had died down - otherwise I could have jumped in and taken part.&lt;/P&gt;
&lt;P&gt;I said I'll answer questions tommorow - but I can't help but answer 2 questions.&lt;/P&gt;
&lt;P&gt;- Where do I sign up?&lt;BR&gt;&lt;BR&gt;&amp;nbsp; Head on over to &lt;A href="http://www.code4bill.com/"&gt;www.code4bill.com&lt;/A&gt; . Contest registrations open only on Jan 1st - however, you can give us your email id and we'll send you brainteasers,etc and inform you when registrations open.&lt;/P&gt;
&lt;P&gt;- Is there really a Bill Gates technical assistant team?&lt;/P&gt;
&lt;P&gt;I saw this question in one of the blog posts I've linked to below. The answer is - 'Duh!!Yes!'. Yes, these guys work directly with Bill Gates. If I remember correctly (I have to get this confirmed), &lt;a href="http://blogs.msdn.com/techtalk"&gt;Steven Sinofsky&lt;/A&gt; and Eric Rudder were both former technical assistants. And they went on to become senior vice presidents :)&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;Here are some initial articles and posts about the event.&lt;/P&gt;
&lt;P&gt;&lt;A href="http://developers.slashdot.org/article.pl?sid=05/12/10/234232&amp;amp;tid=109&amp;amp;tid=8 "&gt;Slashdot&lt;/A&gt; &lt;BR&gt;&lt;A href="http://news.com.com/Prize+in+Indian+talent+search+A+year+on+Bill+Gatess+team/2100-1001_3-5990123.html?tag=nefd.top"&gt;News.com (CNET)&amp;nbsp;&lt;/A&gt;&amp;nbsp;&amp;nbsp;&lt;BR&gt;&lt;A href="http://www.nytimes.com/2005/12/10/technology/10soft.html "&gt;New York Times&lt;/A&gt;-&lt;/P&gt;
&lt;P&gt;Indian papers&lt;/P&gt;
&lt;P class=MsoNormal style="TEXT-ALIGN: justify"&gt;&lt;FONT face=Verdana color=blue size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; COLOR: blue; FONT-FAMILY: Verdana"&gt;&lt;A title=http://economictimes.indiatimes.com/articleshow/1325956.cms href="http://economictimes.indiatimes.com/articleshow/1325956.cms"&gt;http://economictimes.indiatimes.com/articleshow/1325956.cms&lt;/A&gt;&lt;BR&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;FONT face=Verdana color=blue size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; COLOR: blue; FONT-FAMILY: Verdana"&gt;&lt;A title=http://www.deccan.com/Business/Business.asp#Microsoft%20in%20search%20of%20Indian%20talent href="http://www.deccan.com/Business/Business.asp#Microsoft%20in%20search%20of%20Indian%20talent"&gt;http://www.deccan.com/Business/Business.asp#Microsoft%20in%20search%20of%20Indian%20talent&lt;/A&gt;&lt;BR&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;FONT face=Verdana color=blue size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; COLOR: blue; FONT-FAMILY: Verdana"&gt;&lt;A title=http://www.telegraphindia.com/1051210/asp/nation/story_5582805.asp href="http://www.telegraphindia.com/1051210/asp/nation/story_5582805.asp"&gt;http://www.telegraphindia.com/1051210/asp/nation/story_5582805.asp&lt;/A&gt;&lt;BR&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;FONT face=Verdana color=blue size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; COLOR: blue; FONT-FAMILY: Verdana"&gt;&lt;A title=http://ciol.com/content/news/2005/105120912.asp href="http://ciol.com/content/news/2005/105120912.asp"&gt;http://ciol.com/content/news/2005/105120912.asp&lt;/A&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;Some blogs referring to it &lt;BR&gt;&lt;A href="http://customerworld.typepad.com/swami_weblog/2005/12/microsofts_tale.html"&gt;http://customerworld.typepad.com/swami_weblog/2005/12/microsofts_tale.html&lt;/A&gt; &lt;BR&gt;&lt;A href="http://spaces.msn.com/members/VolatileChar/Blog/cns!1pJFaU-KFFDMYqePiw9lsXaw!630.entry"&gt;http://spaces.msn.com/members/VolatileChar/Blog/cns!1pJFaU-KFFDMYqePiw9lsXaw!630.entry&lt;/A&gt; &lt;BR&gt;&lt;A href="http://abhijitworld.blogspot.com/2005/12/code-for-bill-bill-gates-new.html"&gt;http://abhijitworld.blogspot.com/2005/12/code-for-bill-bill-gates-new.html&lt;/A&gt; &lt;BR&gt;&lt;A href="http://theramesh.blogspot.com/2005/12/here-is-how-you-can-code-for-billgates.html"&gt;http://theramesh.blogspot.com/2005/12/here-is-how-you-can-code-for-billgates.html&lt;/A&gt; &lt;/P&gt;
&lt;P&gt;Blog searches&lt;/P&gt;
&lt;P&gt;&lt;A href="http://blogs.icerocket.com/search?q=code4bill"&gt;IceRocket&lt;/A&gt;, &lt;A href="http://www.technorati.com/search/code4bill"&gt;Technorati.&lt;/A&gt;&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;- Sriram Krishnan&lt;/P&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=502521" width="1" height="1"&gt;</description></item><item><title>37</title><link>http://blogs.msdn.com/code4bill/archive/2005/12/11/502518.aspx</link><pubDate>Sun, 11 Dec 2005 12:54:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:502518</guid><dc:creator>sriram</dc:creator><slash:comments>3</slash:comments><comments>http://blogs.msdn.com/code4bill/comments/502518.aspx</comments><wfw:commentRss>http://blogs.msdn.com/code4bill/commentrss.aspx?PostID=502518</wfw:commentRss><description>&lt;DIV&gt;As I stated in the morning the&amp;nbsp;number 37 is key to getting results which contain&amp;nbsp; the same digits&lt;/DIV&gt;
&lt;DIV&gt;&amp;nbsp;&lt;/DIV&gt;
&lt;DIV&gt;37 * 3 = 111&lt;/DIV&gt;
&lt;DIV&gt;Then variations of this like 74 * 3, 37 * 6....... bring the&amp;nbsp;results 111, 222,etc.&lt;/DIV&gt;
&lt;DIV&gt;&amp;nbsp;&lt;/DIV&gt;
&lt;DIV&gt;Then starts the next series 37037 and the other number people are trying to figure out.&lt;/DIV&gt;
&lt;DIV&gt;(lot of you have figured that but I am not mentioning that here)&lt;/DIV&gt;
&lt;DIV&gt;&amp;nbsp;&lt;/DIV&gt;
&lt;DIV&gt;Again there are variations of that&amp;nbsp;number BCDEF like *2, *4 producing different G values.&lt;/DIV&gt;
&lt;DIV&gt;&amp;nbsp;&lt;/DIV&gt;
&lt;DIV&gt;The next series is again interesting&lt;/DIV&gt;
&lt;DIV&gt;12345679 * 9 produces 111111111 where this number 12345679 is again 37 * 333667.&lt;/DIV&gt;
&lt;DIV&gt;&amp;nbsp;&lt;/DIV&gt;
&lt;DIV&gt;Another cool thing is the variants of this 12345679 like *2, *4 versions &lt;/DIV&gt;
&lt;DIV&gt;12345679 * 9 products 111111111 and misses 9 - 1 = 8 in the original number&lt;/DIV&gt;
&lt;DIV&gt;24691358&amp;nbsp;* 9 produces 222222222 and misses 9 - 2 = 7 in the original number&lt;/DIV&gt;
&lt;DIV&gt;&amp;nbsp;&lt;/DIV&gt;
&lt;DIV&gt;The same again&lt;/DIV&gt;
&lt;DIV&gt;98765432 * 9 produces 888888888 and misses 1.&lt;/DIV&gt;
&lt;DIV&gt;&amp;nbsp;&lt;/DIV&gt;
&lt;DIV&gt;All the best for tomorrow's problem. &lt;/DIV&gt;
&lt;DIV&gt;&amp;nbsp;&lt;/DIV&gt;
&lt;DIV&gt;- Perraju&lt;/DIV&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=502518" width="1" height="1"&gt;</description></item><item><title>Question for the day</title><link>http://blogs.msdn.com/code4bill/archive/2005/12/11/502516.aspx</link><pubDate>Sun, 11 Dec 2005 12:32:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:502516</guid><dc:creator>sriram</dc:creator><slash:comments>62</slash:comments><comments>http://blogs.msdn.com/code4bill/comments/502516.aspx</comments><wfw:commentRss>http://blogs.msdn.com/code4bill/commentrss.aspx?PostID=502516</wfw:commentRss><description>&lt;P&gt;A * BCDEF = GGGGGG&amp;nbsp;&lt;BR&gt;&amp;nbsp;&lt;BR&gt;&amp;nbsp;&lt;BR&gt;This is another&amp;nbsp;question that's about working on the digits of a number.&amp;nbsp;&lt;/P&gt;
&lt;P&gt;It all starts&amp;nbsp;&amp;nbsp;with 37 * 3 = 111.After that you will see lot of numbers which produce the same digit in&amp;nbsp; the resulting number and are in&amp;nbsp;some way related to the original 37( like 74, .....)&amp;nbsp;&lt;/P&gt;
&lt;P&gt;Then comes this&amp;nbsp;number BCDEF which brings in the next&amp;nbsp;same-digit result number.If you observe closely,this is also related to 37 (may be not as straight forward&amp;nbsp;as 37037 though).&amp;nbsp;&lt;/P&gt;
&lt;P&gt;Also,it changes the multiplier to 7.&amp;nbsp;If you look closely, you'll see&amp;nbsp;some hidden beauty.If you're interested, try and get the&amp;nbsp;next number (whatever&amp;nbsp;it is), which is not related to 37 in any way but has a result number with repeating digits.&amp;nbsp;&lt;/P&gt;
&lt;P&gt;Have a wonderful day&lt;BR&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;- Perraju&lt;/P&gt;
&lt;P&gt;&lt;EM&gt;[ I posted the above for Peri (he had mailed it to me). Gosh - I feel dumb! - Sriram ]&lt;/EM&gt;&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;BR&gt;&lt;/P&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=502516" width="1" height="1"&gt;</description></item><item><title>Code4Bill begins!</title><link>http://blogs.msdn.com/code4bill/archive/2005/12/09/code4bill-begins.aspx</link><pubDate>Fri, 09 Dec 2005 13:08:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:501960</guid><dc:creator>sriram</dc:creator><slash:comments>87</slash:comments><comments>http://blogs.msdn.com/code4bill/comments/501960.aspx</comments><wfw:commentRss>http://blogs.msdn.com/code4bill/commentrss.aspx?PostID=501960</wfw:commentRss><description>&lt;P class=MsoNormal&gt;&lt;FONT face="Trebuchet MS" size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: 'Trebuchet MS'"&gt;Welcome to the Code4Bill blog! If you’ve found your way here, I’m sure you already know what Code4Bill is. If you don’t, here’s a quick refresher – &lt;A href="http://www.code4bill.com/"&gt;Code4Bill &lt;/A&gt;is a contest aimed at finding the best student programmers in India. If you thought that you were the coolest coder around, here’s your chance to prove it. &amp;nbsp;The prizes are huge – the top 20 get internships at Microsoft Research India and Microsoft India Development Center (where I work). The folks who successfully complete their internships will be given the proverbial red pill – a chance to become a Microsoft employee.&lt;/SPAN&gt;&lt;/FONT&gt;&lt;FONT face="Trebuchet MS" size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: 'Trebuchet MS'"&gt;&lt;?xml:namespace prefix = o /&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/P&gt;
&lt;P class=MsoNormal&gt;&lt;FONT face="Trebuchet MS" size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: 'Trebuchet MS'"&gt;The winner gets a chance to work for the ‘man’ himself – Bill Gates - as a part of his technical assistant team.&lt;/SPAN&gt;&lt;/FONT&gt;&lt;FONT face="Trebuchet MS" size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: 'Trebuchet MS'"&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/P&gt;
&lt;P class=MsoNormal&gt;&lt;B&gt;&lt;FONT face="Trebuchet MS" size=2&gt;&lt;SPAN style="FONT-WEIGHT: bold; FONT-SIZE: 10pt; FONT-FAMILY: 'Trebuchet MS'"&gt;Who are you?&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/B&gt;&lt;FONT face="Trebuchet MS" size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: 'Trebuchet MS'"&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/P&gt;
&lt;P class=MsoNormal&gt;&lt;FONT face="Trebuchet MS" size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: 'Trebuchet MS'"&gt;Well, we’re the Code4Bill contest team. Over the next few posts, you’ll see quite a few of us blogging about..well..a lot of different things. I’m &lt;a href="http://blogs.msdn.com/sriram"&gt;Sriram Krishnan&lt;/A&gt; – I got to write the first blog post as I’m the most good looking of the lot. [1] Seriously though, there are several cool people involved and several of them will be blogging here over the next few weeks.&lt;/SPAN&gt;&lt;/FONT&gt;&lt;FONT face="Trebuchet MS" size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: 'Trebuchet MS'"&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/P&gt;
&lt;P class=MsoNormal&gt;&lt;B&gt;&lt;FONT face="Trebuchet MS" size=2&gt;&lt;SPAN style="FONT-WEIGHT: bold; FONT-SIZE: 10pt; FONT-FAMILY: 'Trebuchet MS'"&gt;When can I register?&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/B&gt;&lt;FONT face="Trebuchet MS" size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: 'Trebuchet MS'"&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/P&gt;
&lt;P class=MsoNormal&gt;&lt;FONT face="Trebuchet MS" size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: 'Trebuchet MS'"&gt;As the official site says, registrations start on January 1&lt;SUP&gt;st&lt;/SUP&gt;. However, in the meantime, submit your email id and you can stay updated – we have several surprises in store for you. &amp;nbsp;Of course, subscribe to this blog – we’ll be blogging updates as well.&lt;/SPAN&gt;&lt;/FONT&gt;&lt;FONT face="Trebuchet MS" size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: 'Trebuchet MS'"&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/P&gt;
&lt;P class=MsoNormal&gt;&lt;B&gt;&lt;FONT face="Trebuchet MS" size=2&gt;&lt;SPAN style="FONT-WEIGHT: bold; FONT-SIZE: 10pt; FONT-FAMILY: 'Trebuchet MS'"&gt;What happens after that?&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/B&gt;&lt;FONT face="Trebuchet MS" size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: 'Trebuchet MS'"&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/P&gt;
&lt;P class=MsoNormal&gt;&lt;FONT face="Trebuchet MS" size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: 'Trebuchet MS'"&gt;Sorry – that’s a secret. &lt;/SPAN&gt;&lt;/FONT&gt;&lt;FONT face=Wingdings size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: Wingdings"&gt;J&lt;/SPAN&gt;&lt;/FONT&gt;&lt;FONT face="Trebuchet MS" size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: 'Trebuchet MS'"&gt; Rest assured – it’ll be fun, wacky and test you in several ways. And we have several things planned in the interim – at the expense of repeating myself, stay tuned!&lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/P&gt;
&lt;P class=MsoNormal&gt;&lt;FONT face="Trebuchet MS" size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: 'Trebuchet MS'"&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;B&gt;&lt;FONT face="Trebuchet MS" size=2&gt;&lt;SPAN style="FONT-WEIGHT: bold; FONT-SIZE: 10pt; FONT-FAMILY: 'Trebuchet MS'"&gt;Anything else?&lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/B&gt;&lt;/P&gt;
&lt;P class=MsoNormal&gt;&lt;FONT face="Trebuchet MS" size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: 'Trebuchet MS'"&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;FONT face="Trebuchet MS" size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: 'Trebuchet MS'"&gt;Since this is our first blog post, &amp;nbsp;48 65 6C 6C 6F 20 57 6F 72 6C 64!&lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/P&gt;
&lt;P class=MsoNormal&gt;&lt;FONT face="Trebuchet MS" size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: 'Trebuchet MS'"&gt;&lt;o:p&gt;&amp;nbsp;- Sriram Krishnan&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/P&gt;
&lt;P class=MsoNormal&gt;&lt;FONT face="Trebuchet MS" size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: 'Trebuchet MS'"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&amp;nbsp;&lt;FONT face="Trebuchet MS" size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: 'Trebuchet MS'"&gt;&lt;o:p&gt;Notes:&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/P&gt;
&lt;P class=MsoNormal&gt;&lt;FONT face="Trebuchet MS" size=2&gt;&lt;SPAN style="FONT-SIZE: 10pt; FONT-FAMILY: 'Trebuchet MS'"&gt;&lt;o:p&gt;1. Maybe slightly exaggerated&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/FONT&gt;&lt;/P&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=501960" width="1" height="1"&gt;</description></item></channel></rss>