{"id":89,"date":"2026-08-18T17:53:54","date_gmt":"2026-08-18T17:53:54","guid":{"rendered":"https:\/\/magazine.hmc.edu\/spring-summer-2026\/?p=89"},"modified":"2026-08-26T15:45:42","modified_gmt":"2026-08-26T15:45:42","slug":"sharpen-your-pencils","status":"publish","type":"post","link":"https:\/\/magazine.hmc.edu\/spring-summer-2026\/sharpen-your-pencils\/","title":{"rendered":"Sharpen Your Pencils"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\">Putnam Mathematical Competition Problem B3<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">Suppose <em>S<\/em> is a nonempty set of positive integers with the property that if <em>n<\/em> is in <em>S,<\/em> then every positive divisor of 2025<sup><em>n<\/em><\/sup>\u221215<sup><em>n<\/em><\/sup> is in <em>S. <\/em>Must <em>S<\/em> contain all positive integers?<\/p>\n\n\n\n<h3 class=\"wp-block-heading\">Answer:<\/h3>\n\n\n\n<p class=\"wp-block-paragraph\">Yes.<\/p>\n\n\n\n<h3 class=\"wp-block-heading\">Solution:<\/h3>\n\n\n\n<p class=\"wp-block-paragraph\">First note that 2025\/15 = 135 = 3<sup>3<\/sup>\u00b75, so that 2025<em><sub><sup>n<\/sup><\/sub><\/em> \u2212 15<em><sup>n<\/sup><\/em> = 15<em><sup>n<\/sup><\/em>(135<sup><em>n <\/em><\/sup>\u2212 1). If <em>n<\/em> is in<em> S,<\/em> then <em>S <\/em>contains all divisors of 2025<em><sub><sup>n<\/sup><\/sub><\/em> \u2212 15<em><sup>n<\/sup><\/em>, which include 1, 2, and 3. We show by induction that <em>S<\/em> contains all positive integers. For the inductive step, suppose all integers less than<em> n<\/em> are in <em>S,<\/em> and let n = 3<em><sup>a<\/sup><\/em>5<em><sup>b<\/sup>c,<\/em> where<em> c<\/em> is relatively prime to 15. By Euler\u2019s theorem (or by the pigeonhole principle), there exists <em>k <\/em>with 1 \u2264 <em>k <\/em>\u2264 <em>c<\/em>\u22121 such that <em>c <\/em>divides 135<em><sup>k <\/sup><\/em>\u2212 1. If <em>a = b =<\/em> 0, we are done. If <em>a<\/em> + <em>b<\/em> > 0, then by, say, an easy induction or the tangent line approximation to <em>f(x) = y<sup>x<\/sup><\/em> at <em>x<\/em> = 0, one sees that <em>a <\/em>&lt; 3<em><sup>a<\/sup><\/em> and <em>b<\/em> &lt; 5<em><sup>b<\/sup><\/em>, implying<\/p>\n\n\n\n<p class=\"has-text-align-center wp-block-paragraph\"><em>a<\/em> + <em>b<\/em> &lt; 3<em><sup>a<\/sup><\/em> + 5<sup><em>b<\/em><\/sup> \u2212 1 = 3<em><sup>a<\/sup><\/em>5<em><sup>b<\/sup><\/em> + (3<sup><em>a<\/em><\/sup> \u2212 1) (5<em><sup>b<\/sup><\/em> \u2212 1) \u2264 3<em><sup>a<\/sup><\/em>5<sup>b<\/sup>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Hence<\/p>\n\n\n\n<p class=\"has-text-align-center wp-block-paragraph\">(<em>a <\/em>+ <em>b<\/em>)<em>k<\/em> \u2264 3<em><sup>a<\/sup><\/em>5<em><sup>b<\/sup><\/em>(<em>c <\/em>\u2212 1) &lt; <em>n,<\/em><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><em>c <\/em>divides 135<sup>(<em>a+b<\/em>)<em>k<\/em><\/sup> \u2212 1, and 3<em><sup>a<\/sup><\/em>5<sup><em>b<\/em><\/sup> divides 15<sup><em>(a+b<\/em>)<em>k<\/em><\/sup>, so that <em>n<\/em> divides 2025<sup>(<em>a<\/em>+<em>b<\/em>)<em>k<\/em><\/sup> \u221215<sup>(<em>a<\/em>+<em>b<\/em>)<em>k<\/em><\/sup>. <\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Therefore, <em>n<\/em> is in <em>S.<\/em><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Putnam Mathematical Competition Problem B3 Suppose S is a nonempty set of positive integers with the property that if n is in S, then every positive divisor of 2025n\u221215n is in S. Must S contain all positive integers? Answer: Yes. Solution: First note that 2025\/15 = 135 = 33\u00b75, so that 2025n \u2212 15n = [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"footnotes":""},"categories":[1],"tags":[],"class_list":["post-89","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"acf":[],"_links":{"self":[{"href":"https:\/\/magazine.hmc.edu\/spring-summer-2026\/wp-json\/wp\/v2\/posts\/89","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/magazine.hmc.edu\/spring-summer-2026\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/magazine.hmc.edu\/spring-summer-2026\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/magazine.hmc.edu\/spring-summer-2026\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/magazine.hmc.edu\/spring-summer-2026\/wp-json\/wp\/v2\/comments?post=89"}],"version-history":[{"count":5,"href":"https:\/\/magazine.hmc.edu\/spring-summer-2026\/wp-json\/wp\/v2\/posts\/89\/revisions"}],"predecessor-version":[{"id":259,"href":"https:\/\/magazine.hmc.edu\/spring-summer-2026\/wp-json\/wp\/v2\/posts\/89\/revisions\/259"}],"wp:attachment":[{"href":"https:\/\/magazine.hmc.edu\/spring-summer-2026\/wp-json\/wp\/v2\/media?parent=89"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/magazine.hmc.edu\/spring-summer-2026\/wp-json\/wp\/v2\/categories?post=89"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/magazine.hmc.edu\/spring-summer-2026\/wp-json\/wp\/v2\/tags?post=89"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}