Creative problem solving

by t0rajir0u, Sep 17, 2008, 5:55 PM

In the following post, all sequences are numbered starting at 1.

The homework page for the Mathematical Problem Solving (that is, the Putnam) seminar here at MIT contains the following warning:

You are expected to solve on your own problems which you hand in. Some collaboration with other students in the seminar is o.k. as long as you don't simply copy someone else's work. You should also not hand in any problems whose solution you are already familiar with.

I've never considered myself a particularly creative problem-solver. My main asset is in having seen a wide variety of problems and being aware of a wide variety of tools. So this puts me in an interesting spot: I cannot hand in solutions to several interesting problems on these problem sets because I am already too familiar with them and I am forced to solve problems whose solution techniques are not immediately obvious to me (which can only be a good thing, but...). Even a problem I haven't seen before that is phrased in a very interesting way reduces readily to a lemma in Engel:

Problem 1: Define a sequence $ a_1 < a_2 < ... < a_n$ of positive integers as follows. Pick $ a_1 = 1$. Once $ a_1, a_2, ... a_n$ have been chosen, let $ a_{n+1}$ be the smallest positive integer not already chosen and not of the form $ a_i + i, 1 \le i \le n$. The sequence begins $ 1, 3, 4, 6, 8, 9, 11, 12, 14, 16, 17, 19, ...$. Find a simple formula for $ a_n$.

Before I discuss the solution, let me discuss my first impression before I recalled the lemma in question. This problem appears at first to be quite mysterious. $ a_n$ skips a strange sequence (the sequence $ a_n + n$) which we do not understand; it seems as though to understand $ a_n$ we need to understand $ a_n + n$, but then it seems as though to understand $ a_n + n$ we need to understand $ a_n$! By comparison, consider the following problem (given in the same chapter in Engel):

Problem 2: Find a simple formula for the sequence $ s_n$ of natural numbers that skips the squares. The sequence begins $ 1, 2, 3, 5, 6, 7, 8, 10, 11, 12, ....$

Solution. It appears that we should write $ s_n = n + e_n$ where $ e_n$ increases by $ 1$ every time we skip a square. But the indices at which $ e_n$ increases are not the squares; rather, the first skip occurs at $ n = 4$, the second at $ n = 8$, and in general (after we have skipped $ k-1$ squares) the $ k^{th}$ at $ n = k^2 + k + 2$. The approximate growth rate of $ e_n$ is then the inverse function of $ f(x) = x^2 + x + 2$, or $ \frac{-1 + \sqrt{4x - 7}}{2}$, but here is the key observation: the exact formula for $ e_n$ is given by

$ e_n = \lfloor f(n) \rfloor.$

Why? $ e_n$ and $ f(n)$ clearly agree whenever $ n = k^2 + k + 2$, and in between $ e_n$ stays the same whereas $ f(n)$ increases monotonically to its next integer value. We therefore find that

$ s_n = n + \left\lfloor \frac{ \sqrt{4n - 7} - 1}{2} \right\rfloor .$

This is what I meant when I said that if we understood $ a_n + n$ (the sequence of integers we skipped), we would understand $ a_n$. The obvious approach from here is to generalize what we did above and to consider a given monotonically increasing sequence of positive integers (such as $ F(n) = n^2$) with a straightforward inverse function and find an exact formula for the sequence $ s_n$ that skips the values of $ F(n)$. By the above discussion, such a sequence can be given as

$ s_n = n + \lfloor f^{-1}(n) \rfloor$

where $ f(n) = F(n+1) - (n-1)$ (which is the actual function we need an inverse for). Applying this idea to $ a_n$ (a sequence that skips the values of $ a_n + n$), we conclude that what we need is the inverse function of $ f(n) = a_{n+1} + 2$. But we don't know it, so now we have to solve a horrid functional equation!

At this point, inspiration might strike in the form of a well-chosen guess. We have observed that a sequence like the one that skips the squares is approximately linear (since it skips a sequence that becomes sparse). But if $ a_n$ skips the sequence $ a_n + n$ then it stands to reason that both $ a_n$ and $ a_n + n$ should be approximately linear, and moreover that the closed forms of both sequences should involve floor functions. (This would also make the inverse function of $ a_{n+1} + 2$ approximately linear.)

The functions we should be looking at are therefore of the form $ \lfloor an + b \rfloor$, and this is as good an inspiration as I can muster for the lemma that trivializes this problem.

Lemma (Engel, Chapter 6, E17): Let $ \alpha, \beta$ be positive irrational real numbers such that $ \frac{1}{\alpha} + \frac{1}{\beta} = 1$. Then the sequences $ a_n = \lfloor \alpha n \rfloor, b_n = \lfloor \beta n \rfloor$ are disjoint and their union is $ \mathbb{N}$.

Proof. Engel gives a proof by contradiction that, while short, I find unenlightening. Let me give the following slightly more visual proof:

Given any natural number $ k$, divide up the interval $ (0, k)$ into four intervals with endpoints at the points $ \frac{k}{\alpha} - \frac{1}{\beta}, \frac{k}{\alpha}, \frac{k}{\alpha} + \frac{1}{\alpha}$ and calls those intervals, from left to right, $ I_1, I_2, I_3, I_4$. Now, $ I_2 \cup I_3$ is an interval of length $ \frac{1}{\alpha} + \frac{1}{\beta} = 1$ with irrational endpoints; it therefore contains exactly one natural number $ n$. If $ n \in I_2$, then

$ \frac{k}{\alpha} - \frac{1}{\beta} < n < \frac{k}{\alpha} \Leftrightarrow$
$ \frac{k}{\beta} + \frac{1}{\beta} > k-n > \frac{k}{\beta} \Leftrightarrow$
$ k + 1 > \beta(k-n) > k \Leftrightarrow$
$ \lfloor \beta(k-n) \rfloor = k$.

On the other hand, if $ n \in I_3$, then
$ \frac{k}{\alpha} < n < \frac{k}{\alpha} + \frac{1}{\alpha} \Leftrightarrow$
$ k < \alpha n < k + 1 \Leftrightarrow$
$ \lfloor \alpha n \rfloor = k$.

The interval construction we described therefore describes an algorithm that sorts any natural number $ k$ into exactly one of the two progressions $ a_n, b_n$ along with its index in that progression.

Now, if it is the case that $ a_n = \lfloor \alpha n \rfloor, a_n + n = \lfloor \beta n \rfloor$, then we must have both $ \alpha + 1 = \beta$ and $ \frac{1}{\alpha} + \frac{1}{\beta} = 1$. The algebra is easy enough, but I should remark that the original problem was given with the following

Hint: The answer involves $ \phi = \frac{1 + \sqrt{5}}{2}$.

It is now obvious that $ \alpha = \phi, \beta = \phi^2 = \phi + 1$ and we are done.


It would be pointless to submit this solution for scoring. Even if I explained that the answer can be motivated by a more general idea (that of skipping a given integer sequence), what I am sure the professors teaching the Putnam seminar are looking for is a solution generated with as little prior knowledge of problems of this type as possible. Such problem-solving is beyond me as a general rule, and certainly I commend any of my classmates who solved this problem without being aware of Engel's lemma. This problem was rated a three, which means "Extremely difficult. Only a few students should be able to solve it."

And we are talking about a class that includes four of the six US IMO 2008 team members! (Alex Zhai is at Harvard and Evan O'Dorney is, of course, not in college.)

Nevertheless, I hope that I presented the above discussion (up to the "approximately linear and involving floor functions" step) in a way that was motivated enough so that Engel's lemma did not seem to appear out of thin air. It is not entirely unmotivated: if $ \lfloor \alpha n \rfloor$ and $ \lfloor \beta n \rfloor$ are given to be disjoint and to have union $ n$, then their natural densities (which are $ \frac{1}{\alpha}$ and $ \frac{1}{\beta}$) must add to $ 1$. Given this information, we could have concluded that if $ a_n$ was approximately linear then $ a_n$ and $ a_n + n$ must have asymptotic densities $ \frac{1}{\phi}, \frac{1}{\phi + 1}$ respectively without the lemma, and indeed this idea provides a nice motivation to the lemma itself, though I am still not sure how easy it would have been to discover the lemma independently. That is the sort of discovery best left to better mathematicians than myself.


Practice Problem 1: a) Give an alternate proof of Engel's lemma based on the discussion about constructing a sequence that skips another sequence. (This might be unnecessarily messy.)

b) Why does Engel's lemma fail if $ \alpha, \beta$ are rational? Salvage it.

Practice Problem 2: Determine the closed form of the positive integer sequence $ a_n$ such that $ a_n, a_n + n^2$ are disjoint and their union is $ \mathbb{N}$.

Comment

4 Comments

The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Hey! I love your blog like everyone else on AoPS but I don't know you :( . I'm also a member of the Putnam seminar... are you the guy who sat next to me on Monday and lives in EC? I guess if you are American you must be, because I think I know everyone else...

I think things will get more original for all of us now that we have drifted out of Olympiads and in into Linear Algebra.

by n^4 4, Sep 18, 2008, 4:46 PM

The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Well, I disagree about this problem being extremely difficult. I was given it at Mathcamp, and I managed to solve it relatively quickly. I had seen the theorem you mentioned as a lemma in Engel (it's called Beatty's Theorem), but it didn't come to mind until after I solved it.

The context I was given this problem was in solving the combinatorial game Wyt Queen: Given one queen somewhere on an infinite chessboard with a corner, such that two players take turns moving it towards the corner (you must move), find the winning strategy and which starting squares make the first player lose.

by MellowMelon, Sep 19, 2008, 1:03 AM

The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Well, linear algebra came up because it's on the Putnam, but the fundamental mindset of the seminar is still geared towards Putnam prep. Should be interesting, though.

Embarrassingly enough, I was given Wyt Queen as a problem last year and didn't actually find the closed form even though I was aware of the lemma. It's not a terribly difficult problem, but I think the ratings for the problems are geared towards the more "typical" freshman class (this is after all a freshman seminar), which presumably wouldn't include 4 IMO team members, Jeremy Hahn, Haitao Mao, Jacob Steinhardt...

by t0rajir0u, Sep 19, 2008, 2:23 AM

The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
I'm pretty sure you're being too hard on yourself. Separating sheer problem solving power (whatever that means, if anything) from experience and a "toolbox" is quite impossible, and your solution is pretty far from just being "seen this, here's the solution from memory". It's motivated and non-trivial, and I would submit it with full explanation of the background just like you did here.

This is just my personal opinion :) take it as it is.

by randomgraph, Oct 14, 2008, 3:39 AM

Various mathematical thoughts, ranging from problem-solving techniques to attempts to tie together related concepts.

avatar

t0rajir0u
Archives
+ March 2009
+ October 2007
+ May 2007
Shouts
Submit
  • orz $~~~~$

    by clarkculus, Jan 10, 2025, 4:13 PM

  • Insanely auraful

    by centslordm, Jan 1, 2025, 11:17 PM

  • Fly High :(

    by Siddharthmaybe, Oct 22, 2024, 8:34 PM

  • Dang it he is gone :(( /revive/revive/revive/revive/revive/revive/revive/revive/revive/revive/revive/revive/revive/revive/revive/revive/revive/revive/revive/revive/revive/revive/revive/revive/revive/revive/revive/revive/revive/revive/revive/revive/revive.

    by 799786, Aug 4, 2022, 1:56 PM

  • annoying precision

    by centslordm, May 16, 2021, 7:34 PM

  • rip t0rajir0u

    by OlympusHero, Dec 5, 2020, 9:29 PM

  • Shoutbox bump xD

    by DuoDuoling0, Oct 4, 2020, 2:25 AM

  • dang hes gone :(

    by OlympusHero, Jul 28, 2020, 3:52 AM

  • First shout in July

    by smartguy888, Jul 20, 2020, 3:08 PM

  • https://artofproblemsolving.com/community/c2448

    has more.

    -πφ

    by piphi, Jun 12, 2020, 8:20 PM

  • wait hold up 310,000
    people visited this man?!?!??

    by srisainandan6, May 29, 2020, 5:16 PM

  • first shout in 2020

    by OlympusHero, Apr 4, 2020, 1:15 AM

  • in his latest post he says he moved to wordpress

    by MelonGirl, Nov 16, 2019, 2:43 AM

  • Please revive!

    by AopsUser101, Oct 30, 2019, 7:10 PM

  • first shout in october fj9odiais

    by bulbasaur., Oct 14, 2019, 1:14 AM

128 shouts
Tags
About Owner
  • Posts: 12167
  • Joined: Nov 20, 2005
Blog Stats
  • Blog created: Dec 5, 2006
  • Total entries: 48
  • Total visits: 321832
  • Total comments: 202
Search Blog
a