Archive of posts filed under the Challenge category.

## The 2017-18 Conjecture

Like many mathematicians and teachers, I often enjoy thinking about the mathematical properties of dates, not because dates themselves are inherently meaningful numerically, but just because I enjoy thinking about numbers.

A new year means a new number to think about. And one interesting fact about our new year, 2018, is that it is semiprime.

A number is semiprime if it is the product of exactly two prime factors: for example, 15 = 3 * 5 is semiprime, as is 49 = 7 * 7, but neither 13 nor 30 are. Semiprime numbers are also referred to as biprime2-almost prime, or pqnumbers.

Semiprimes are very interesting in and of themselves, particularly in cryptography, but what caught my attention is that the previous year, 2017, is a prime number. That means we have a semiprime number, 2018, adjacent to a prime number, 2017. How unusual is this?

I played around a bit and ended up writing some simple programs to find and analyze semiprimes. Among the first 500,000 integers, there are roughly 108,000 semiprimes and 41,500 primes. Of the 108,000 semiprimes, only about 2,500 (or 2.3%) are adjacent to a prime number. This seems low to me: there are 83,000 prime-adjacent spots among the first 500,000 integers, representing 18% of the spots semiprimes could occupy. But only about 2.3% of the 108,000 semiprimes end up in those spots. That seems unusual. * [See Update]

In thinking about what happens further out along the number line, I couldn’t help but wonder if there are infinitely many prime-semiprime pairs like 2017 and 2018. I certainly don’t know the answer, but I thought I would start the new year boldly, with a conjecture:

#### The 2017-18 Conjecture

##### There are infinitely many pairs of consecutive integers one of which is prime and one of which is semiprime.

I think this problem’s resemblance to the Twin Prime Conjecture led me to both imagine this conjecture and also suspect it’s true. As with virtually everything in mathematics, I’m sure someone has thought of this before, and I would love a reference if anyone can provide it.

Thinking ahead, I was excited to notice that next year will also be a semiprime!

But it appears that the Twin Semiprime Conjecture is already an existing open question, which means I have less than a year to come up with a new conjecture for 2019.

Happy New Year! 2018 has already inspired to me to do some number theory, tackle some computing challenges, and think about some new ideas for the classroom. It’s a good mathematical start to the new year, and here’s hoping 2018 only gets better.

UPDATE, 1/18/2018

In a comment, Brent pointed out that I undercounted the number of semiprimes adjacent to a prime. A recalculation is consistent with Brent’s numbers: among the 108,000 semiprimes up to 500,000, around 4,900 of them are adjacent to prime number. Thanks, Brent!

Related Posts

## Jason Merrill’s Lawnmower Puzzle

Jason Merrill recently posted a fun geometry puzzle inspired by his work on the Lawnmower Math activity for Desmos.  Here’s my paraphrase of the puzzle:

Suppose a lawnmower is tethered to a circular peg in the middle of the lawn. As the lawnmower moves along its spiral path, the rope shortens as its winds around the peg. At the moment the lawnmower contacts the peg, how much rope remains uncoiled?

When I first considered this problem it seemed hard.  After some thought, it seemed obvious.  Then, after some more thought, it seemed hard again.  That’s the sign of a compelling problem!

I enjoyed working out a solution, the heart of which I’ve included below.  Jason graciously included my solution in his post sharing his own, and he also does a wonderful job describing the journey of making simplifying assumptions, both mathematical and physical, that allow us to start moving toward a solution.  It’s the kind of work that often goes unmentioned in problem solving, especially in school mathematics, and this puzzle provides a nice opportunity to make that thinking transparent.

I highly recommend reading the puzzle and his solution at his blog.  Thanks for the fun problem, Jason!

## How Much Would You Pay for a 20% Discount?

A local Office Max is going out of business and is having a very interesting sale.

I’m not sure I’ve ever seen a sale where you earn a discount by purchasing a certain number of items.  Of course, I immediately began exploring the mathematical consequences of the policy.

The first thing that occurred to me was that you can essentially purchase a 20% discount.  Say you need to buy n items.  Simply buying another 20 – n items earns you a 20% discount.  The natural question is thus, “Under what circumstances would buying an additional 20 – n items be worth a 20% discount?”

There are a variety of factors to consider.  For example, if you can just find an additional 20 – n items that you are happy to buy, it’s definitely worth it:  you get the 20% discount, and you get items of value to you.  Also, the answer likely depends on n:  if you are only 1 item short of the discount, it’s easier to justify an unnecessary purchase than if you are, say, 19 items short.

As an extreme case thinker, I considered the following scenario.  Suppose I wanted to buy one item; under what circumstances would I buy 19 items I didn’t want in order to get a 20% discount?

Obviously, the key to this strategy is finding a cheap item to purchase 19 times.  I thought I had found the cheapest possible item here:

Nineteen composition books would cost me $14.06. If the 20% discount saved me more than$14.06, this strategy would be worth it.  This sets the bar for my one item at $70.30. However, I later realized I could do better here: These paper folders cost more per item, but unlike the composition books above, the folders are themselves eligible for the 20% discount! Nineteen folders would cost$16.91, but they’ll be discounted 20% to $13.53. This means if my single item cost more than$67.65, this strategy would save me money.

I could have done a lot better if these Slim Jims were sold here, or these 10-cent envelopes!  But this is the best I could find in the store.

Another interesting question to consider is “For what range of prices would buying nine additional items, to receive a 10% discount, be a better strategy than buying 19 additional items, to get the 20% discount?”

In any event, I appreciate Office Max giving me something interesting to think about as I waited in line.  And as usual, I waited a very long time.  Let’s just say it’s no surprise they are going out of business.

## Rosenthal Prize Application Workshop

I recently participated in a workshop hosted by the Museum of Mathematics about the Rosenthal Prize for Innovation in Math Teaching.  The Rosenthal Prize invites classroom teachers to submit outstanding, fun, creative, and engaging math lessons:  the author of the best lesson receives \$25,000, and other noteworthy submissions are honored as well.

The purpose of the workshop was to help prospective applicants understand the submission, revision, and judging process for the prize.  The workshop panel included the directors of the museum, past judges, and three former winners of the Rosenthal Prize (including myself).

The video is embedded below, or you can watch on YouTube here.

Please spread the word about the Rosenthal Prize:  it’s rare to have such incentive to build and share creative, engaging mathematics lessons!

## When do Multiple Rotations Exist?

I recently profiled an erroneous high-stakes math exam question that had two correct answers.

Here, it is possible to map AB onto A’B’ using either a glide reflection or a rotation.

It’s interesting to note that there are actually two distinct rotations that map AB onto A’B’, as demonstrated below.

This raises an interesting question:  given two congruent objects, under what circumstances will two distinct rotations exist that map one onto the other?

In a comment on the original post, Joshua Greene offered another interesting follow-up question:

Under what circumstance, if any, are two line segments of equal length not images of each other under rotation? In which of those cases, if any, are the two line segments images of each other under glide reflection?

With enough work, even erroneous exam questions are redeemable!