Pizza Combination

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 1265 1265 more varieties of pizza than lasagna that they could possibly order.

How many different toppings does their favorite Italian restaurant offer?


The answer is 22.

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.

1 solution

With n n being the number of available toppings, the number of pizza varieties is

( n 3 ) + ( n 2 ) + ( n 1 ) + ( n 0 ) = n ( n 1 ) ( n 2 ) 6 + n ( n 1 ) 2 + n + 1 = \dbinom{n}{3} + \dbinom{n}{2} + \dbinom{n}{1} + \dbinom{n}{0} = \dfrac{n(n - 1)(n - 2)}{6} + \dfrac{n(n - 1)}{2} + n + 1 =

1 6 ( n ( n 1 ) ( n 2 ) + 3 n ( n 1 ) + 6 n + 6 ) = 1 6 ( n ( n 1 ) ( n + 1 ) + 6 ( n + 1 ) ) = \dfrac{1}{6}(n(n - 1)(n - 2) + 3n(n - 1) + 6n + 6) = \dfrac{1}{6}(n(n - 1)(n + 1) + 6(n + 1)) =

1 6 ( n + 1 ) ( n 2 n + 6 ) \dfrac{1}{6}(n + 1)(n^{2} - n + 6) .

Next, for each layer of the lasagna there are n + 1 n + 1 choices, (any one of the n n toppings plus the option of no topping), so since there are two layers the number of lasagna varieties is ( n + 1 ) 2 (n + 1)^{2} . We thus require that

1 6 ( n + 1 ) ( n 2 n + 6 ) ( n + 1 ) 2 = 1265 ( n + 1 ) ( n 2 n + 6 6 ( n + 1 ) ) = 7590 \dfrac{1}{6}(n + 1)(n^2 - n + 6) - (n + 1)^{2} = 1265 \Longrightarrow (n + 1)(n^{2} - n + 6 - 6(n + 1)) = 7590 \Longrightarrow

( n + 1 ) ( n 2 7 n ) = 7590 n ( n + 1 ) ( n 7 ) = 7590 = 2 × 3 × 5 × 11 × 23 (n + 1)(n^{2} - 7n) = 7590 \Longrightarrow n(n + 1)(n - 7) = 7590 = 2 \times 3 \times 5 \times 11 \times 23 .

We now need to arrange the prime factors into a product of the form n ( n + 1 ) ( n 7 ) n(n + 1)(n - 7) , which can be done if we set n = 2 × 11 = 22 n = 2 \times 11 = 22 , in which case n + 1 = 23 n + 1 = 23 and n 7 = 3 × 5 = 15 n - 7 = 3 \times 5 = 15 . As no other combination will work, we can conclude that there are 22 \boxed{22} available toppings.

Nice method sir, solved using the same method. However, I found the roots of the cubic equation using a scientific calculator.

Indraneel Mukhopadhyaya - 4 years, 1 month ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...