{"id":273,"date":"2015-08-16T02:40:35","date_gmt":"2015-08-16T02:40:35","guid":{"rendered":"http:\/\/newblog.primefactorisation.com\/2015\/08\/16\/football-scores-problem-solution\/"},"modified":"2024-11-02T15:09:15","modified_gmt":"2024-11-02T20:09:15","slug":"football-scores-problem-solution","status":"publish","type":"post","link":"https:\/\/www.primefactorisation.com\/blog\/2015\/08\/16\/football-scores-problem-solution\/","title":{"rendered":"Football scores problem solution"},"content":{"rendered":"<p>The other day I posted <a href=\"https:\/\/www.primefactorisation.com\/blog\/2015\/08\/13\/football-scores-problems\/\">this problem<\/a> that one of my students discovered. We played around with it for a while and came up with this solution. I don&#8217;t know if this is the easiest or most elegant solution, but it&#8217;s what I have.<\/p>\n<p>Quick recap, we&#8217;re trying to solve the equation 6a&nbsp;+&nbsp;b&nbsp;=&nbsp;ab, where a and b are non-negative integers. In Australian rules football, if a is the number of goals (worth 6 points each) and b is the number of behinds (worth 1 point each), the solutions to this equation are the scores where the total score is equal to the product of the goals and behinds.<\/p>\n<p>Solutions can be found by trial and error, but how can we be sure we&#8217;ve found all of them? How do we know the solutions don&#8217;t just continue on forever? Well, it turns out that a little algebra and an understanding of asymptotes makes it clear that only a handful of solutions exist.<\/p>\n<p>The original equation can be rearranged as so:<\/p>\n<p><img decoding=\"async\" src=\"\/content\/images\/2015\/08\/IMG_20150816_130300612.jpg\" alt=\"\" \/><\/p>\n<p>When graphed, this produces a hyperbola with asymptotes at a&nbsp;=&nbsp;1 and b&nbsp;=&nbsp;6 (see below). Which means that for a&nbsp;>&nbsp;1, b is strictly decreasing and b&nbsp;>&nbsp;6.<\/p>\n<p>Since both a and b have to be integers, this puts an upper bound on a. Once b is 7, a can get no larger; if it did, b would not be an integer. As it turns out, b&nbsp;=&nbsp;7 when a&nbsp;=&nbsp;7.<\/p>\n<p>We already have a lower bound: a&nbsp;=&nbsp;0, as we only accept non-negative solutions.<\/p>\n<p>So, we can simply use trial and error within this domain, and find <a href=\"https:\/\/www.desmos.com\/calculator\/p7r5stf4r0\">these solutions<\/a>:<\/p>\n<p><img decoding=\"async\" src=\"\/content\/images\/2015\/08\/afl-puzzle.PNG\" alt=\"\" \/><\/p>\n<p>Or, reported as football scores, 0.0.0, 2.12.14, 3.9.27, 4.8.32 and 7.7.49.<\/p>\n<p>If we allow negative scores (not possible in football, but let&#8217;s do it anyway) we can get <a href=\"https:\/\/www.desmos.com\/calculator\/xgxcypdkas\">a few more solutions<\/a>.<\/p>\n<p>An interesting result is that b is always a multiple of a in these solutions. We actually noticed this result before finding all the solutions. a and a&nbsp;&#8211;&nbsp;1 are coprime, so they share no prime factors. Since 6&bullet;a&nbsp;=&nbsp;(a&nbsp;&#8211;&nbsp;1)&bullet;b, the prime factors of b must contain all the prime factors of a. A result that, as it turns out, didn&#8217;t end up helping us solve the problem, but is relevant to the name of this blog. \ud83d\ude09<\/p>\n<p>The real question I have now is this: how do I go about turning this problem into a lesson?<\/p>\n","protected":false},"excerpt":{"rendered":"<p>The other day I posted this problem that one of my students discovered. We played around with it for a while and came up with this solution. I don&#8217;t know if this is the easiest or most elegant solution, but it&#8217;s what I have. Quick recap, we&#8217;re trying to solve the equation 6a&nbsp;+&nbsp;b&nbsp;=&nbsp;ab, where a &hellip; <\/p>\n<p class=\"link-more\"><a href=\"https:\/\/www.primefactorisation.com\/blog\/2015\/08\/16\/football-scores-problem-solution\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;Football scores problem solution&#8221;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-273","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/www.primefactorisation.com\/blog\/wp-json\/wp\/v2\/posts\/273","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.primefactorisation.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.primefactorisation.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.primefactorisation.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.primefactorisation.com\/blog\/wp-json\/wp\/v2\/comments?post=273"}],"version-history":[{"count":1,"href":"https:\/\/www.primefactorisation.com\/blog\/wp-json\/wp\/v2\/posts\/273\/revisions"}],"predecessor-version":[{"id":747,"href":"https:\/\/www.primefactorisation.com\/blog\/wp-json\/wp\/v2\/posts\/273\/revisions\/747"}],"wp:attachment":[{"href":"https:\/\/www.primefactorisation.com\/blog\/wp-json\/wp\/v2\/media?parent=273"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.primefactorisation.com\/blog\/wp-json\/wp\/v2\/categories?post=273"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.primefactorisation.com\/blog\/wp-json\/wp\/v2\/tags?post=273"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}