(re)search

I just figured that its very easy to keep standard deviation of each subtree in a binary tree. And this made me think of a problem. I don’t know if people have already been working on it or not. But its an interesting problem. Suppose I have a large data of numbers. And someone asks me to give him k numbers so that they have the same average. How do I do that?

Let me express it in mathematical form. You are given ‘n’ numbers, . Give me ‘k’ numbers out of these ‘n’ numbers so that their average is nearest to

This is yet another attempt to start a research blog. The previous research blog couldn’t work out because I wasn’t able to do much of research and also life was very busy back in IITK. Now then I am at Purdue, and now then I am doing PhD, I think I will get to do enough research. I am not sure if I will get enough time to write about it, but I will try. Atleast on weekends.

If you want to leave a comment, and also want to use latex code in your comment please follow this
latex on wordpress