5 1 of its pieces are edge pieces (pieces with at least one edge).
Assuming that the pieces follow a rectangular grid pattern with rows and columns, find the least number of pieces a puzzle can have if exactly
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Nice, simple explanation!
Log in to reply
This actually generalises quite nicely for fractions of the form n 1 - it turns out you can never get a square, but you can always get one away from a square number (so, here we have 3 6 0 = 1 9 2 − 1 ), which is clearly optimal. (I could be more explicit but maybe it's a nice followup question.)
Log in to reply
Nice observation!
Hi @Chris Lewis , I really like your explanation and this observation. Find it interesting but did not clearly understood what you were trying to say. Thanks!
This is a p -piece jigsaw, with side lengths a and p / a .
There are 2 ( a + p / a − 2 ) edge pieces.
p / 2 ( a + p / a − 2 = 5
( a − 1 0 ) p = 1 0 a 2 − 2 0
p = ( 1 0 a 2 − 2 0 a ) / ( a − 1 0 ) = 1 0 a + 8 0 + 8 0 0 / ( a − 1 0 )
Let b = a − 1 0
p = 1 0 b + 1 8 0 + 8 0 0 / b
Differentiate to find the stationary points.
1 0 − 8 0 0 / b 2 = 0 therefore b minimises at S Q R T ( 8 0 )
so we are looking for integer b approx 9 and integer a approx 19.
9 is not a factor of 800, but trying b = 8 and b = 1 0 yields the same p = 3 6 0
Therefore a = 1 8 and a = 2 0 yield the same p = 3 6 0
Of course they yield the same p because 18 and 20 are the two side lengths of the same jigsaw!
3 6 0
Your second line is missing a right parenthesis. And, really, it could use an extra pair so it's clear that you're doing p/(2(a + p/a - 2)) = 5, not (p/2)(a+p/a - 2) = 5.
Nice solution! Also, the last term of the fourth line should be 20a, not 20.
Let the Jigsaw puzzle be x × y
Number of pieces with at least one edge = ( x + x + y + y ) − 4 [ Subtract 4 to remove double counting ]
x y 2 ( x + y ) − 4 1 0 ( x + y ) 2 x + y 2 0 ⋅ 2 x + y 1 0 ( x + y ) x y + 2 0 t + 2 0 t ∈ [ 0 , 1 8 0 − 8 0 5 ] t 3 5 9 ∈ Prime = 5 1 = x y + 2 0 ≥ x y [ AM.GM. inequality ] ≥ 2 0 ⋅ x y ≥ 2 0 ⋅ x y ≥ 2 0 ⋅ x y ≥ 2 0 ⋅ t [ Let x y = t ] ∪ [ 1 8 0 + 8 0 5 , ∞ ] ≥ 3 5 9 ⟹ t = 3 6 0 [ x = 1 8 , y = 2 0 ]
Nice use of the AM-GM inequality!
Problem Loading...
Note Loading...
Set Loading...
In an x × y jigsaw, there are ( x − 2 ) × ( y − 2 ) pieces without an edge (just a smaller, interior rectangle). We want these to make up 5 4 of the total; ie ( x − 2 ) ( y − 2 ) = 5 4 x y .
Expanding and rearranging, this becomes x y − 1 0 x − 1 0 y + 2 0 = 0 . Factorising, we get ( x − 1 0 ) ( y − 1 0 ) = 8 0 .
It's simple now to check the factor pairs of 8 0 to find that the total number of pieces, x y , is minimised when x = 1 8 and y = 2 0 , or vice-versa, giving x y = 3 6 0 .