Problem of the Month (December 2000)

Consider the following identities:

43 = 26 . 15

85 . 17 = 23 . 46

27 . 43 . 95 = 610 . 81

Each contains the first few integers exactly once, and only products of the form ab are allowed. Can this always be done with the numbers from 1 to 2n (for n≥3)? How many solutions are there?


ANSWERS

Here are solutions for small n:

nEquationAuthor
3 43 = 26 . 15
4 85 . 17 = 23 . 46
5 27 . 43 . 95 = 610 . 81
6 127 . 310 = 67 . 81 . 24 . 95
7 12 . 813 . 914 = 1211 . 67 . 310 . 45
8 1513 . 311 . 48 . 161 = 214 . 912 . 57 . 106Philippe Fondanaiche
9 18 . 413 . 187 . 1517 = 56 . 1011 . 914 . 123 . 216
10 114 . 311 . 513 . 612 . 819 . 92 . 157 = 1020 . 1817 . 416Brendan Owen
11 1422 . 316 . 1513 . 811 . 106 = 2019 . 717 .1812 . 29 . 215 . 41Philippe Fondanaiche
12 1424 . 1522 . 1019 . 816 . 36 = 2023 . 518 . 1217 . 713 . 2111 . 29 . 41Philippe Fondanaiche
13 118 . 211 . 312 . 914 . 1613 . 2022 . 2524 = 47 . 526 . 619 . 817 . 1023 . 1521Tom Sundquist
14 112 . 317 . 1618 . 2021 . 2526 . 2719 = 214 . 47 . 522 . 624 . 813 . 911 . 1023 . 1528Tom Sundquist
15 17 . 321 . 411 . 529 . 817 . 922 . 1528 . 2026 = 214 . 612 . 1023 . 1613 . 2518 . 2719 . 3024Tom Sundquist
1647 . 528 . 631 . 817 . 2514 . 2719 . 302 . 3223 = 922 . 1011 . 121 . 1526 . 1629 . 183 . 2021 . 2413
17322 . 47 . 511 . 628 . 823 . 251 . 2721 . 3033 . 3226 = 914 . 1031 . 1229 . 152 . 1617 . 1834 . 2013 . 2419
18 166 . 2825 . 2227 . 2017 . 431 . 58 . 332 . 3018 . 3619 = 1526 . 1014 . 2423 . 3234 . 112 . 713 . 1129 . 353 . 219Marc Lapierre
19237 . 37 . 433 . 51 . 628 . 2523 . 2713 . 3034 . 3222 . 3631 = 811 . 921 . 1038 . 1235 . 1526 . 1614 . 1819 . 2017 . 2429
20 416 . 185 . 93 . 2019 .1536 . 3527 . 1437 . 2231 . 337 .1340 = 16 . 324 . 128 . 2529 .1024 . 2830 . 2134 . 1138 . 2623 . 3917Philippe Fondanaiche
21134 . 233 . 322 . 419 . 535 . 639 . 277 . 3028 . 3231 . 3637 . 4026 = 841 . 917 . 1023 . 1242 . 1511 . 1614 . 1838 . 2029 . 2421 . 2513
22 111 . 524 . 744 . 812 . 2031 . 2138 . 2526 . 2722 . 2839 . 3034 . 3217 = 213 . 319 . 46 . 923 . 1033 . 1441 . 1536 . 1618 . 3543 . 4029 . 4237Tom Sundquist

John Hoffman wrote a JAVA program to count the number of solutions. Here are his results:

n3456789
Number of Solutions24415442811938173476

If you can extend any of these results, please e-mail me. Click here to go back to Math Magic. Last updated 12/14/00.