Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2023 AMC 10B Problems/Problem 16"
(→‎Solution 1)
 
(43 intermediate revisions by 18 users not shown)
Line 4: Line 4:
 
of <math>2</math> or more digits where the digits are strictly decreasing moving left to right. For
 
of <math>2</math> or more digits where the digits are strictly decreasing moving left to right. For
 
instance, the number <math>258</math> is an upno and <math>8620</math> is a downno. Let <math>U</math> equal the total
 
instance, the number <math>258</math> is an upno and <math>8620</math> is a downno. Let <math>U</math> equal the total
−
number of <math>upnos</math> and let <math>d</math> equal the total number of <math>downnos</math>. What is <math>|U-D|</math>?
+
number of <math>upnos</math> and let <math>D</math> equal the total number of <math>downnos</math>. What is <math>|U-D|</math>?
  
 +
<math>\textbf{(A)}~512\qquad\textbf{(B)}~10\qquad\textbf{(C)}~0\qquad\textbf{(D)}~9\qquad\textbf{(E)}~511</math>
 
== Solution 1 ==
 
== Solution 1 ==
  
Line 16: Line 17:
 
For the downnos, there are <math>10</math> <math>1</math>-digit cases, and for the upnos, there are <math>9</math> <math>1</math>-digit cases. There is <math>1</math> <math>0</math>-digit case for both upnos and downnos.  
 
For the downnos, there are <math>10</math> <math>1</math>-digit cases, and for the upnos, there are <math>9</math> <math>1</math>-digit cases. There is <math>1</math> <math>0</math>-digit case for both upnos and downnos.  
  
−
Thus, the difference is <math>\left(\left(2^{10}-10-1\right)-\left(2^9-9-1\right)\right)=2^9-1=\textbf{(E) }511.</math>  
+
Thus, the difference is <math>\left(\left(2^{10}-10-1\right)-\left(2^9-9-1\right)\right)=2^9-1=\boxed{\textbf{(E) }511}.</math>  
  
 
~Technodoggo ~minor edits by lucaswujc
 
~Technodoggo ~minor edits by lucaswujc
Line 22: Line 23:
 
== Solution 2 ==
 
== Solution 2 ==
  
−
Since Upnos do not allow 0s to be in their first -- and any other -- digit, there will be no zeros in any digits of an Upno. Thus, Upnos only contain digits [1,2,3,4,5,6,7,8,9].  
+
Since Upnos do not allow <math>0</math>s to be in their first -- and any other -- digit, there will be no zeros in any digits of an Upno. Thus, Upnos only contain digits <math>[1,2,3,4,5,6,7,8,9]</math>.  
  
−
Upnos are 2 digits in minimum and 9 digits maximum (repetition is not allowed). Thus the total number of Upnos will be
+
Upnos are <math>2</math> digits in minimum and <math>9</math> digits maximum (repetition is not allowed). Thus the total number of Upnos will be
−
(9C2)+(9C3)+(9C4)+...+(9C9), since every selection of distinct numbers from the set [1,2,3,4,5,6,7,8,9] can be arranged so that it is an Upno. There will be (9C2) 2 digit Upnos, (9C3) 3 digit Upnos and so on.
+
<math>{9\choose 2}+{9\choose 3}+ {9\choose 4}+...+{9\choose 9}</math>, since every selection of distinct numbers from the set <math>[1,2,3,4,5,6,7,8,9]</math> can be arranged so that it is an Upno. There will be <math>{9\choose 2}</math> -<math>2</math> digit Upnos, <math>{9\choose 3}</math> -<math>3</math> digit Upnos and so on.
  
 
Thus, the total number of Upnos will be
 
Thus, the total number of Upnos will be
−
(9C2)+(9C3)+(9C4)+...+(9C9) = 2^9-(9C0)-(9C1) = 512 - 10 = 502.
+
<math>\sum_{i=2}^{9}{{9 \choose i}}=512-10=502</math>
  
−
Notice that the same combination logic can be done for Downnos, but Downnos DO allow zeros to be in their last digit. Thus, there are 10 possible digits [0,1,2,3,4,5,6,7,8,9] for Downnos.  
+
Notice that the same combination logic can be done for Downnos, but Downnos DO allow zeros to be in their last digit. Thus, there are <math>10</math> possible digits <math>[0,1,2,3,4,5,6,7,8,9]</math> for Downnos.  
  
−
Therefore, it is visible that the total number of Downnos are
+
Therefore, it is visible that the total number of Downnos are:
−
(10C2)+(10C3)+(10C4)+...+(10C10) = 2^10-(10C0)-(10C10) = 1024 - 11 = 1013.
+
<cmath>\sum_{i=2}^{10}{{10\choose i}}= 2^{10}-{10\choose 0}-{10\choose 1} = 1024 - 11 = 1013</cmath>.
  
−
Thus abs(#Upno-#Downno) = abs(1013-502) = 511.
+
Thus <math>|U-D| = |(1013-502)| =\boxed{\textbf{(E) }511}.</math>
  
  
 
~yxyxyxcxcxcx
 
~yxyxyxcxcxcx
−
 
+
~JISHNU4414L (Latex)
  
 
== Solution 3 ==
 
== Solution 3 ==
  
−
Note that you can obtain a downo by reversing an upno (like <math>235</math> is an upno, and you can obtain <math>532</math>). So, we need to find the amount of downos that end with 0. We can use stars and bars to get: <cmath>\sum_{n=0}^9 \dbinom{9}{n} = \dbinom{9}{0} + \dbinom{9}{1} + \cdots + \dbinom{9}{9}</cmath> to get 512. However, 0 is not a valid case so we subtract 1. Our answer is 511.
+
Note that you can obtain a downo by reversing an upno (like <math>235</math> is an upno, and you can obtain <math>532</math>). So, we need to find the amount of downos that end with 0 since if you 'flip' the numbers, the upno starts with a 0 which corresponds to a downo. We can find the cases that end with a 0: <cmath>\sum_{n=0}^9 \dbinom{9}{n} = \dbinom{9}{0} + \dbinom{9}{1} + \cdots + \dbinom{9}{9}</cmath> to get 512. However, 0 itself is not a valid case (since it has 1 digit) so we subtract 1. Our answer is <math>\boxed{\textbf{(E) }511}</math>.
  
 
-aleyang
 
-aleyang
Line 53: Line 54:
 
First, note that the only <math>downnos</math> that are not contained by the set of <math>upnos</math> is every <math>downno</math> that ends in <math>0</math>.
 
First, note that the only <math>downnos</math> that are not contained by the set of <math>upnos</math> is every <math>downno</math> that ends in <math>0</math>.
  
−
Next, listing all the two digits <math>downnos</math>, we find that the answer is more than 9, since there are more digits to be tested and there are 9 two digit <math>downnos</math>. This leaves us with <math>512</math> or <math>511</math>.  
+
Next, listing all the two digits <math>downnos</math>, we find that the answer is more than 10, since there are more digits to be tested and there are already 9 two digit <math>downnos</math>. This leaves us with <math>512</math> or <math>511</math>.  
  
 
Next, we notice that all the possibilities for <math>2</math> through <math>9</math> digit <math>downnos</math> ending in <math>0</math> pair up with one another, as the possibilities are equal (e.g. possibilities for <math>2</math> digits = possibilities for <math>9</math> digits, etc.).  
 
Next, we notice that all the possibilities for <math>2</math> through <math>9</math> digit <math>downnos</math> ending in <math>0</math> pair up with one another, as the possibilities are equal (e.g. possibilities for <math>2</math> digits = possibilities for <math>9</math> digits, etc.).  
  
−
This leaves us with one last possibility, the ten digit <math>downno 9876543210</math>.  
+
This leaves us with one last possibility, the ten digit <math>downno</math> <math>9876543210</math>.  
  
 
Since all the previous possibilities form an even number, adding one more possibility will make the total odd. Therefore, we need to choose the odd number from the set <math>[511, 512]</math>.  
 
Since all the previous possibilities form an even number, adding one more possibility will make the total odd. Therefore, we need to choose the odd number from the set <math>[511, 512]</math>.  
  
−
Our answer is 511.
+
Our answer is <math>\boxed{\textbf{(E) }511}</math>.
 +
 
 +
~Stead (a.k.a. Aaron)
 +
 
 +
== Solution 5 ==
 +
We start by calculating the number of upnos. Suppose we are constructing an upno of <math>n</math> digits such that <math>n \ge 2</math>. An upno can't start with a "<math>0</math>", so there are <math>9</math> digits to choose from. There are <math>\dbinom{9}{n}</math> ways to choose an upno with <math>n</math> digits. This is because for each combination of digits, only one combination can form an upno. Therefore, for <math>2 \le n \le 9</math>, the total number of upnos is <cmath>\binom{9}{2} + \binom{9}{3} + \binom{9}{4} + \cdots + \dbinom{9}{9} = 2^9 - \binom{9}{1} - \binom{9}{0} = 2^9 - 10.</cmath>
 +
 
 +
Similarly, the digits of a downo of <math>n</math> digits can be chosen among 10 digits to choose from, since <math>0</math> can be a digit of the downo as the last digit. Thus, the number of downos is <cmath>\binom{10}{2} + \binom{10}{3} + \binom{10}{4} + \cdots + \dbinom{10}{9} + \dbinom{10}{10} = 2^{10} - \binom{10}{1} - \binom{10}{0} = 2^{10} - 11.</cmath> Thus, <cmath> |U - D| = |(2^9 - 10) - (2^{10} - 11)| = (2^{10} - 11) - (2^9 - 10) = 2^{10} - 2^9 - 1 = \boxed{\textbf{(E) }511} </cmath>
 +
 
 +
~rnatog337
 +
 
 +
==Solution 6 (1-1 Correspondence)==
  
−
~yourmomisalosinggame (a.k.a. Aaron)
+
Notice that the number of upno integers are the number of subsets of the set <math>(1, 2, 3, 4, 5, 6, 7, 8, 9)</math>, excluding the empty set (<math>\emptyset</math>) and the one-digit integers. So, the number of upno integers is <math>2^9-1-9=502</math>.
 +
 
 +
The number of downo numbers are similar, but with <math>0</math>. So, the number of downo integers is the number of subsets of the set <math>(0, 1, 2, 3, 4, 5, 6, 7, 8, 9)</math>, excluding the empty set and the one-digit integers. So, the number of downo integers is <math>2^{10}-1-10=1013</math>.
 +
 
 +
Therefore, the difference between the number of downo integers and upno is <math>1013-502=\boxed{\textbf{(E) }511}</math>.
 +
 
 +
~MrThinker
 +
 
 +
==Solution 7 (Bijection)==
 +
Observe that each downno (that doesn't end with a <math>0</math>) maps to one upno. It suffices to count the number of downnos that end with <math>0</math>.  
 +
 
 +
Given that a downno ends with <math>0</math>, we want to choose the remaining digits from the set <math>\{1, 2, \ldots, 9\}</math>. We can arrange the elements of any subset so that they are increasing. We may include or exclude any of the <math>9</math> elements, giving <math>2^{9}</math> subsets. Subtracting <math>1</math> to account for the empty set, we have <math>2^9 - 1 = \boxed{\textbf{(E) }511}</math> more downnos than upnos.
 +
 
 +
-Benedict T (countmath1)
 +
 
 +
==Solution 8 (Combinations)==
 +
Like Solution <math>1</math>, we know that there are more downnos than upnos because downnos can contain <math>0</math>. So, we need to calculate the number of downnos ending with <math>0</math>. We can do this by splitting this into different cases:
 +
 
 +
For a <math>2</math>-digit downno ending with <math>0</math>, there are <math>\binom{9}{1}</math>  ways of constructing a downno ending with <math>0</math>. <br>
 +
Similarly, for a <math>3</math>-digit downno ending with <math>0</math>, there are <math>\binom{9}{2}</math> ways of constructing a downno ending with <math>0</math>. <br>
 +
We can calculate this for up to <math>10</math> digits, or the downno <math>9876543210</math>.
 +
 
 +
We can add the sum for all of the cases, which is <math>\binom{9}{1}+\binom{9}{2}+\binom{9}{3}+...+\binom{9}{9} = 2^9 - 1 = \boxed{\textbf{(E) }511}</math>  .
 +
<br>~pixelpyguy
  
 
==Video Solution 1 by OmegaLearn==
 
==Video Solution 1 by OmegaLearn==
 
https://youtu.be/UoasqXkLJ_g
 
https://youtu.be/UoasqXkLJ_g
 +
 +
==Video Solution==
 +
 +
https://youtu.be/H9JXizKoDcg
 +
 +
~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)
 +
 +
==See also==
 +
{{AMC10 box|year=2023|ab=B|num-b=15|num-a=17}}
 +
{{MAA Notice}}

Latest revision as of 21:13, 4 November 2024

Problem

Define an $\textit{upno}$ to be a positive integer of $2$ or more digits where the digits are strictly increasing moving left to right. Similarly, define a $\textit{downno}$ to be a positive integer of $2$ or more digits where the digits are strictly decreasing moving left to right. For instance, the number $258$ is an upno and $8620$ is a downno. Let $U$ equal the total number of $upnos$ and let $D$ equal the total number of $downnos$. What is $|U-D|$?

$\textbf{(A)}~512\qquad\textbf{(B)}~10\qquad\textbf{(C)}~0\qquad\textbf{(D)}~9\qquad\textbf{(E)}~511$

Solution 1

First, we know that $D$ is greater than $U$, since there are less upnos than downnos. To see why, we examine what determines an upno or downno.

We notice that, given any selection of unique digits (notice that "unique" constrains this to be a finite number), we can construct a unique downno. Similarly, we can also construct an upno, but the selection can not include the digit $0$ since that isn't valid.

Thus, there are $2^{10}$ total downnos and $2^9$ total upnos. However, we are told that each upno or downno must be at least $2$ digits, so we subtract out the $0$-digit and $1$-digit cases.

For the downnos, there are $10$ $1$-digit cases, and for the upnos, there are $9$ $1$-digit cases. There is $1$ $0$-digit case for both upnos and downnos.

Thus, the difference is $\left(\left(2^{10}-10-1\right)-\left(2^9-9-1\right)\right)=2^9-1=\boxed{\textbf{(E) }511}.$

~Technodoggo ~minor edits by lucaswujc

Solution 2

Since Upnos do not allow $0$s to be in their first -- and any other -- digit, there will be no zeros in any digits of an Upno. Thus, Upnos only contain digits $[1,2,3,4,5,6,7,8,9]$.

Upnos are $2$ digits in minimum and $9$ digits maximum (repetition is not allowed). Thus the total number of Upnos will be ${9\choose 2}+{9\choose 3}+ {9\choose 4}+...+{9\choose 9}$, since every selection of distinct numbers from the set $[1,2,3,4,5,6,7,8,9]$ can be arranged so that it is an Upno. There will be ${9\choose 2}$ -$2$ digit Upnos, ${9\choose 3}$ -$3$ digit Upnos and so on.

Thus, the total number of Upnos will be $\sum_{i=2}^{9}{{9 \choose i}}=512-10=502$

Notice that the same combination logic can be done for Downnos, but Downnos DO allow zeros to be in their last digit. Thus, there are $10$ possible digits $[0,1,2,3,4,5,6,7,8,9]$ for Downnos.

Therefore, it is visible that the total number of Downnos are: \[\sum_{i=2}^{10}{{10\choose i}}= 2^{10}-{10\choose 0}-{10\choose 1} = 1024 - 11 = 1013\].

Thus $|U-D| = |(1013-502)| =\boxed{\textbf{(E) }511}.$


~yxyxyxcxcxcx ~JISHNU4414L (Latex)

Solution 3

Note that you can obtain a downo by reversing an upno (like $235$ is an upno, and you can obtain $532$). So, we need to find the amount of downos that end with 0 since if you 'flip' the numbers, the upno starts with a 0 which corresponds to a downo. We can find the cases that end with a 0: \[\sum_{n=0}^9 \dbinom{9}{n} = \dbinom{9}{0} + \dbinom{9}{1} + \cdots + \dbinom{9}{9}\] to get 512. However, 0 itself is not a valid case (since it has 1 digit) so we subtract 1. Our answer is $\boxed{\textbf{(E) }511}$.

-aleyang

-ap246(LaTeX)

Solution 4 (Educated Guess)

First, note that the only $downnos$ that are not contained by the set of $upnos$ is every $downno$ that ends in $0$.

Next, listing all the two digits $downnos$, we find that the answer is more than 10, since there are more digits to be tested and there are already 9 two digit $downnos$. This leaves us with $512$ or $511$.

Next, we notice that all the possibilities for $2$ through $9$ digit $downnos$ ending in $0$ pair up with one another, as the possibilities are equal (e.g. possibilities for $2$ digits = possibilities for $9$ digits, etc.).

This leaves us with one last possibility, the ten digit $downno$ $9876543210$.

Since all the previous possibilities form an even number, adding one more possibility will make the total odd. Therefore, we need to choose the odd number from the set $[511, 512]$.

Our answer is $\boxed{\textbf{(E) }511}$.

~Stead (a.k.a. Aaron)

Solution 5

We start by calculating the number of upnos. Suppose we are constructing an upno of $n$ digits such that $n \ge 2$. An upno can't start with a "$0$", so there are $9$ digits to choose from. There are $\dbinom{9}{n}$ ways to choose an upno with $n$ digits. This is because for each combination of digits, only one combination can form an upno. Therefore, for $2 \le n \le 9$, the total number of upnos is \[\binom{9}{2} + \binom{9}{3} + \binom{9}{4} + \cdots + \dbinom{9}{9} = 2^9 - \binom{9}{1} - \binom{9}{0} = 2^9 - 10.\]

Similarly, the digits of a downo of $n$ digits can be chosen among 10 digits to choose from, since $0$ can be a digit of the downo as the last digit. Thus, the number of downos is \[\binom{10}{2} + \binom{10}{3} + \binom{10}{4} + \cdots + \dbinom{10}{9} + \dbinom{10}{10} = 2^{10} - \binom{10}{1} - \binom{10}{0} = 2^{10} - 11.\] Thus, \[|U - D| = |(2^9 - 10) - (2^{10} - 11)| = (2^{10} - 11) - (2^9 - 10) = 2^{10} - 2^9 - 1 = \boxed{\textbf{(E) }511}\]

~rnatog337

Solution 6 (1-1 Correspondence)

Notice that the number of upno integers are the number of subsets of the set $(1, 2, 3, 4, 5, 6, 7, 8, 9)$, excluding the empty set ($\emptyset$) and the one-digit integers. So, the number of upno integers is $2^9-1-9=502$.

The number of downo numbers are similar, but with $0$. So, the number of downo integers is the number of subsets of the set $(0, 1, 2, 3, 4, 5, 6, 7, 8, 9)$, excluding the empty set and the one-digit integers. So, the number of downo integers is $2^{10}-1-10=1013$.

Therefore, the difference between the number of downo integers and upno is $1013-502=\boxed{\textbf{(E) }511}$.

~MrThinker

Solution 7 (Bijection)

Observe that each downno (that doesn't end with a $0$) maps to one upno. It suffices to count the number of downnos that end with $0$.

Given that a downno ends with $0$, we want to choose the remaining digits from the set $\{1, 2, \ldots, 9\}$. We can arrange the elements of any subset so that they are increasing. We may include or exclude any of the $9$ elements, giving $2^{9}$ subsets. Subtracting $1$ to account for the empty set, we have $2^9 - 1 = \boxed{\textbf{(E) }511}$ more downnos than upnos.

-Benedict T (countmath1)

Solution 8 (Combinations)

Like Solution $1$, we know that there are more downnos than upnos because downnos can contain $0$. So, we need to calculate the number of downnos ending with $0$. We can do this by splitting this into different cases:

For a $2$-digit downno ending with $0$, there are $\binom{9}{1}$ ways of constructing a downno ending with $0$.
Similarly, for a $3$-digit downno ending with $0$, there are $\binom{9}{2}$ ways of constructing a downno ending with $0$.
We can calculate this for up to $10$ digits, or the downno $9876543210$.

We can add the sum for all of the cases, which is $\binom{9}{1}+\binom{9}{2}+\binom{9}{3}+...+\binom{9}{9} = 2^9 - 1 = \boxed{\textbf{(E) }511}$ .
~pixelpyguy

Video Solution 1 by OmegaLearn

https://youtu.be/UoasqXkLJ_g

Video Solution

https://youtu.be/H9JXizKoDcg

~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)

See also

2023 AMC 10B (Problems • Answer Key • Resources)
Preceded by
Problem 15 		Followed by
Problem 17
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25
All AMC 10 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2023_AMC_10B_Problems/Problem_16&oldid=231611"