Difference between revisions of "2025 AIME I Problems/Problem 10"
Line 46: | Line 46: | ||
The number of different ways to fill such a grid can be written as <math>p^a \cdot q^b \cdot r^c \cdot s^d</math> where <math>p</math>, <math>q</math>, <math>r</math>, and <math>s</math> are distinct prime numbers and <math>a</math>, <math>b</math>, <math>c</math>, <math>d</math> are positive integers. Find <math>p \cdot a + q \cdot b + r \cdot c + s \cdot d</math>. | The number of different ways to fill such a grid can be written as <math>p^a \cdot q^b \cdot r^c \cdot s^d</math> where <math>p</math>, <math>q</math>, <math>r</math>, and <math>s</math> are distinct prime numbers and <math>a</math>, <math>b</math>, <math>c</math>, <math>d</math> are positive integers. Find <math>p \cdot a + q \cdot b + r \cdot c + s \cdot d</math>. | ||
+ | |||
+ | ==Solution 1== | ||
+ | |||
+ | We will fill out the grid row by row. Note that there are <math>9!=2^7\cdot 3^4\cdot 5\cdot 7</math> ways to fill out the first row. For the second row, we will consider a little casework. WLOG let the first row be <math>123 | 456 | 789</math> (bars indicate between the <math>3\times 3</math> squares). | ||
+ | |||
+ | <u>Case 1:</u> Every number from the first square goes to the second square. Then there is <math>1</math> way along with <math>6^3</math> orderings giving us <math>6^3</math> cases. | ||
+ | |||
+ | <u>Case 2:</u> Two of the first numbers go in the second square and the last number goes in the third. This results in <math>3*3*3</math> ways to put the numbers along with <math>6^3</math> orderings. Thus there are <math>27\cdot 6^3</math> cases. | ||
+ | |||
+ | Note that we didn't consider <math>2</math> cases but these are symmetric so the number of ways to fill the second row is <math>56\cdot 6^3</math>. | ||
+ | |||
+ | There is <math>1</math> way to place the last numbers in with <math>6^3</math> orderings. Thus there are <math>2^7\cdot 3^4\cdot 5\cdot 7 \cdot 56\cdot 6^3 \cdot 6^3 = 2^{16}\cdot 3^{10}\cdot 5^1\cdot 7^2</math> ways to fill out our mini Sudoku puzzle. Thus the answer is <math>2\cdot 16+3\cdot 10 + 5\cdot 1+7\cdot 2 = \boxed{81}.</math> | ||
+ | |||
+ | ~ [[User:zhenghua|zhenghua]] | ||
==See also== | ==See also== |
Revision as of 21:02, 13 February 2025
Problem
The cells of a
grid are filled in using the numbers
through
so that each row contains
different numbers, and each of the three
blocks heavily outlined in the example below contains
different numbers, as in the first three rows of a Sudoku puzzle.
The number of different ways to fill such a grid can be written as where
,
,
, and
are distinct prime numbers and
,
,
,
are positive integers. Find
.
Solution 1
We will fill out the grid row by row. Note that there are ways to fill out the first row. For the second row, we will consider a little casework. WLOG let the first row be
(bars indicate between the
squares).
Case 1: Every number from the first square goes to the second square. Then there is way along with
orderings giving us
cases.
Case 2: Two of the first numbers go in the second square and the last number goes in the third. This results in ways to put the numbers along with
orderings. Thus there are
cases.
Note that we didn't consider cases but these are symmetric so the number of ways to fill the second row is
.
There is way to place the last numbers in with
orderings. Thus there are
ways to fill out our mini Sudoku puzzle. Thus the answer is
~ zhenghua
See also
2025 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 9 |
Followed by Problem 11 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions.