jump to navigation

A Puzzle June 25, 2010

Posted by genericme in Uncategorized.

Consider a set of n objects from which m are drawn randomly at a time, with replacement.  What is E(n, m), the expected number of draws I have to make to have drawn all of the objects?

I have yet to find a satisfactory closed-form expression for even E(n, 1).  I obtain an ugly series in terms of Stirling numbers of the second kind.   However, I suspect that E(n, 1) is asymptotically linear:

Is this a well-known problem?

Random updates June 14, 2010

Posted by Akhil Mathew in Uncategorized.

It’s been another two months already since anyone last posted here, hasn’t it?

So, first of all, Damien Jiang, Anirudha Balasubramanian, and I have each uploaded the papers resulting from our RSI projects to arXiv.  I’ve been discussing the story of my project on representation theory and the mathematics around it on my personal blog (see in particular here and here).  There are others from the program who have placed their papers on arXiv as well (but are not involved in this blog).

I’d like to congratulate my friend and fellow Rickoid Yale Fan for winning the Young Scientist award at the International Science and Engineering Fair for his project on quantum computation (which deservedly earned him the title “rock star”).  I also congratulate his classmate and fellow rock star Kevin Ellis (who did not do RSI, but whom I know from STS) for winning the (again fully deserved) award for his work on parallel computation.  There is a press release here.

RSI 2010 is starting in just a few more days.  I’m not going to have any involvement in the program myself (other than potentially proofreading drafts of kids’ papers from several hundred miles away), nor do I know much about what kinds of projects (mathematical or otherwise) will be happening there.  I think I’d be interested in being a mentor someday—maybe in six years time.  I’m going to be doing a project probably on something geometric this summer, but it remains to be seen on what.

I don’t really know what’s going to become of this blog as we all now finish high school and enter college.  It looks like most of us will be in Cambridge, MA next year; this is hardly surprising given the RSI program’s location there.  Also, just to annoy Yale, I’m going to further spread the word that he is going to Harvard.

If anyone from RSI 2010 wants to join/revive this blog, feel free to send an email to deltaepsilons [at] gmail [dot] com.

Siemens October 7, 2009

Posted by Damien Jiang in Uncategorized.
Tags: , ,

Unfortunately the depth and breadth of my mathematical knowledge are not as awesome as Akhil’s. So, I’ll talk about something else related to math.

I, like probably every other contributor to this blog, submitted my research paper to the Siemens competition about a week ago. Despite the incredible amount of editing I did at RSI, I realized, to my dismay, that the bulk of the editing was still to be done.


USAMO 1973 #5 August 21, 2009

Posted by lumixedia in Uncategorized.
1 comment so far

The claim this problem makes looks obvious but turns out to be…actually, not much harder than it looks. The solution has one clever moment but I think you can avoid it by a little more algebra, though it’s not interesting enough to write out.

USAMO 1973 #5. Show that the cube roots of three distinct prime numbers cannot be three terms (not necessarily consecutive) of an arithmetic progression. (more…)

The RSI experience continued August 6, 2009

Posted by Dennis in General, Mathematical research, Uncategorized.

The previous post did a nice job in describing the process of our math research. In addition to the research, the math students form a special group, and it really is fun.

Instead of going to mentorships at labs all day, we only have an hour,  so for me, much of the time was spent at the computer lab. And there, we can see many of the math students come and go during the day. After a few days, it is obvious which students do their work very late at night and which students work in the morning.

We also have funny little things that happen that make the experience more interesting. Not_trig brought the culture of tetris playing from his school, and I learned a very slow version of his “T-spin”. Ubuntu and Pokman Cheung are popular words we like to throw around. Ubuntu came from the Linux computers and Pokman Cheung coauthored a book in quantem calculus. We also noticed how dedicated Akhil was to this blog, which can be seen from all the Algebra posts and from his daily checking of the blog stats.

There is a subgroup of the math students that researched representation theory. I am not an “Etingofling”, so I don’t really know much about what goes on in there. Except the Etingoflings use a lot of words that end with “orphism” and view Etingof as a god at math.

Outside of math, you can play frisbee, ping pong, soccer, watch movies or go to all sorts of activities in the evening. Unfortunately, I was one of those who worked in the morning, so I slept through most of those, but frisbee is fun.

I guess, even though it’s hard to put into words, it really is a fun time and those six weeks seem so short when it’s time to leave. It feels like I lived half my life at RSI, but yet that half a life only lasted for 7 days.

An Interesting Problem July 23, 2009

Posted by genericme in Uncategorized.

Though this post isn’t necessarily characteristic of what I’d like to post on in the future, I have an interesting problem that I must share with you all.  To encourage everyone to try it, I will not include a solution.

Two points, A and B, sit on the x-axis.  Point A is at the origin, and point B is at (L, 0).  At time t = 0, B starts moving at a constant speed u perpendicular to the x-axis, while A starts moving with constant speed v such that its velocity vector is always pointing in the direction of B.  Assume v > u.  At what time will the points meet?

This problem is much harder than it seems.  It comes from a book of physics problems, but I’d really consider it a math problem.  I’d like to note that I know of two solutions: an extremely clever solution that requires only a trivial amount of calculus, and a long solution that requires quite a bit of calculus (but that still requires a clever substitution).  The latter solution is due to Eric Larson, who solved this problem a few days after I gave it to him.  However, I know of no one who has independently thought of the clever solution, and I’ll be extremely impressed if you do!  If you’ve seen this problem before, please don’t reveal the solution.

Additive Combinatorics July 22, 2009

Posted by lhstephens in Uncategorized.

My project at RSI is in additive combinatorics, which is a field of math, which extends the notions of set over operations. Here is a brief introduction to some of the terminology and theorems in the field.

Additive combinatorics studies subsets of abelian groups. To study these sets, additive combinatorics uses theorems and notation from both graph theory and set theory. An additive set {A} with respect to an abelian group {Z} is a set {A \subset Z}. The group Z is referred to as an ambient group. Normally, the group {Z} is the integers over addition or {\mathbb{Z} , +}. (more…)

USAMO 2009 #5 July 19, 2009

Posted by Damien Jiang in Problem-solving, Uncategorized.
Tags: ,
1 comment so far

I like Olympiad geometry. Therefore, I will give my solution to this year’s USAMO #5; I was rather happy with my solution.

5. Trapezoid {ABCD}, with {\overline{AB}||\overline{CD}}, is inscribed in circle {\omega} and point {G} lies inside triangle {BCD}. Rays {AG} and {BG} meet {\omega} again at points {P} and {Q}, respectively. Let the line through {G} parallel to {\overline{AB}} intersects {\overline{BD}} and {\overline{BC}} at points {R} and {S}, respectively. Prove that quadrilateral {PQRS} is cyclic if and only if {\overline{BG}} bisects {\angle CBD}.


IMO 2009 #1 July 18, 2009

Posted by Martin Camacho in Problem-solving, Uncategorized.
Tags: ,

The 2009 IMO was a few days ago – in this post I tackle what I think is one of the easier IMO problems, IMO 2009 #1.

The question is as follows:

Let {n} be a positive integer and let {a_1,a_2,a_3,\cdots,a_k} ({k\ge 2}) be distinct integers in the set {1,2,\cdots,n} such that {n} divides {a_i(a_{i+1}-1)} for {i=1,2,\cdots,k-1}. Prove that {n} does not divide {a_k(a_1-1)}.


Happy Yellow Pigs’ Day! July 17, 2009

Posted by Jacob Hurwitz in Uncategorized.
Tags: , , , , , ,

For the first time in four weeks, I wish I weren’t at RSI right now. I should clarify, that’s not saying anything bad about RSI. Despite a big deadline looming over our heads, I’m still having the time of my life here. No, the reason I say that I’d rather not be here is that there’s somewhere even more awesome than RSI. Because about two hours west of Boston, in Amherst, Massachusetts, a large group of mathematicians is gathering to celebrate yellow pigs and the number seventeen.

Yes, you heard me right. Yellow pigs. To those in the loop, July 17 is Yellow Pigs’ Day (place the apostrophe where you wish). I don’t quite know the origin of this holiday, but I’ve heard that it has something to do with David Kelly, Mike Spivak, Princeton University, and a bar. All I know is that I celebrated my first YP Day last summer when I was a student at Kelly’s summer math program, the Hampshire College Summer Studies in Mathematics (HCSSiM), and I am now a firm believer in the facts that all pigs are yellow and that seventeen is by far the best number. (more…)


Get every new post delivered to your Inbox.

Join 44 other followers