At their favorite Italian restaurant, the teammates can get pizza with up to three of the available toppings (plain pizza with no toppings is allowed, but repeated toppings are not). They can also get lasagna, for which they can choose any topping (from the same list as for pizza) or no topping, for each of the two layers (bottom and top). One evening Riley realizes that there are more varieties of pizza than lasagna that they could possibly order.
How many different toppings does their favorite Italian restaurant offer?
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.
With n being the number of available toppings, the number of pizza varieties is
( 3 n ) + ( 2 n ) + ( 1 n ) + ( 0 n ) = 6 n ( n − 1 ) ( n − 2 ) + 2 n ( n − 1 ) + n + 1 =
6 1 ( n ( n − 1 ) ( n − 2 ) + 3 n ( n − 1 ) + 6 n + 6 ) = 6 1 ( n ( n − 1 ) ( n + 1 ) + 6 ( n + 1 ) ) =
6 1 ( n + 1 ) ( n 2 − n + 6 ) .
Next, for each layer of the lasagna there are n + 1 choices, (any one of the n toppings plus the option of no topping), so since there are two layers the number of lasagna varieties is ( n + 1 ) 2 . We thus require that
6 1 ( n + 1 ) ( n 2 − n + 6 ) − ( n + 1 ) 2 = 1 2 6 5 ⟹ ( n + 1 ) ( n 2 − n + 6 − 6 ( n + 1 ) ) = 7 5 9 0 ⟹
( n + 1 ) ( n 2 − 7 n ) = 7 5 9 0 ⟹ n ( n + 1 ) ( n − 7 ) = 7 5 9 0 = 2 × 3 × 5 × 1 1 × 2 3 .
We now need to arrange the prime factors into a product of the form n ( n + 1 ) ( n − 7 ) , which can be done if we set n = 2 × 1 1 = 2 2 , in which case n + 1 = 2 3 and n − 7 = 3 × 5 = 1 5 . As no other combination will work, we can conclude that there are 2 2 available toppings.