Applications of Bases: Part II - 2014 AIME II #15

First, before I begin, I'd like to say WOW, was I surprised by the reaction. I haven't been posting anything new (part II) because I've been looking/drained of good problems to add. I was totally in for a surprise on this year's AIME II.

First, the problem.

For any integer k1k\ge 1, let p(k)p(k) be the smallest prime which does not divide k. Define the integer function X(k)X(k) to be the product of all primes less than p(k)p(k) if p(k)>2p(k)>2, and X(k)=1X(k)=1 if p(k)=2p(k)=2. Let {xn}\{x_n\} be the sequence defined by x0=1x_0=1, and xn+1X(xn)=xnp(xn)x_{n+1}X(x_n)=x_n p(x_n) for n0n\ge 0. Find the smallest positive integer tt such that xt=2090x_t=2090.

So, let's go through my thinking process seeing this on the test. At first, I did not see the trick, but it seemed like the kind of problem with a trick. So, what better than compute a few values. Around 10 minutes later (and with a good deal of errors having been made), I had finally obtained the following:

x0=1, x1=2, x2=3, x3=6, x4=5x_0=1,~ x_1=2, ~ x_2=3, ~ x_3=6, ~ x_4=5

Just looking at that, I wasn't totally sure I saw any pattern. But I did see that there was one, just not an immediately obvious one.

So, I started factorizing. I knew that this was a question about prime factorization simply because we were multiplying and dividing by products of primes constantly.

Here's the important part, though, which saved me quite a bit of time and is why I am posting this to Applications of Bases. I was kind of lazy. I wrote 1 instead of 212^1, 31 instead of 33213^3\cdot 2^1, 1000 instead of 717^1, etc. In other words, I wrote the number n=(pkek)(p1e1) n=(p_k^{e_k})\cdot \ldots \cdot (p_1^{e_1}) as ekek1e1e_k e_{k-1}\ldots e_1 where pkp_k is the kk - th prime.

Now, I went back to our sequence.

x0=0, x1=1, x2=10, x3=11, x4=100x_0=0, ~ x_1=1, ~ x_2=10, ~x_3=11, ~ x_4=100

By that point, I needed little confirmation that this was a strange kind of binary, so I rushed off, found that 2090 was 10010101, and converted to get t=149\boxed{t=149}.

Yup, 149 was right. But let's prove it, shall we? (I actually did prove it in my head on the test. It wasn't too hard to see.)

First, we get xn+1=xnp(xn)X(xn)x_{n+1}=\frac{x_n p(x_n)}{X(x_n)}. Let xnx_n be something ending in 011....1 (there could be 0 1s). Then, when we multiply by p(xn)p(x_n), we turn this ending into 111...1. Finally, when we divide by X(xn)X(x_n), we turn this into 100...0. But, since this is just how we count up in binary, we conclude that xn=n+kx_n=n+k for some k. Since x0=0x_0=0, we see that k=0k=0, and the proof is complete.

Note by Matthew Lipman
7 years, 4 months ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link]( link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}


Sort by:

Top Newest

Hi, I read your notes and the problem sets but I don't quite understand the third problems wording, can you give some more information on that?

Christopher Boo - 7 years, 4 months ago

Log in to reply

@Matthew Lipman Can you add this to the Brilliant Wiki under a suitable skill in Number Bases? Thanks!

Calvin Lin Staff - 6 years, 9 months ago

Log in to reply


Problem Loading...

Note Loading...

Set Loading...