Practice (EndingDigits,TheDivideByNineMethod,MODBasic)
back to index | new
How many rectangles or squares are there in the following diagram?
Six people form a line. $A$ must stand after $B$ (not necessarily immediately after $B$). How many different ways are there to form such a line?
Seven people form a line. If $A$ must stand next to $B$, and $C$ must stand next to $D$, how many possibilities are there?
Team MAS won a total of $10$ gold medals in a $6$-day tournament. It won at least one gold medal every day. How many different possibilities are there to count the number of gold medals won each day?
Find the number of positive integer solutions to the following equation: $$x_1+x_2+\cdots+x_5=14$$
Joe goes to a supermarket to buy 10 cakes. There are 6 different types of cakes, and each type has a sufficient quantity. How many different combinations of cakes can Joe have?
Library MAS has m bookshelves for books of m different categories. Each bookshelf has n books. Joe, the librarian, needs to re-arrange these books. Books of the same category still need to be put on the same bookshelf, but their order can change.
How many different arrangement plans are there that:
(a) no book is put on the same bookshelf as before?
(b) no book is put on it original position?
(c) no book is on the same bookshelf, and no book is at the relative position in the new bookshelf as it was before
Let $D_n$ be the derangement count, prove:
- $D_n =n\cdot D_{n−1} +(−1)^n$
- $D_n = (n−1)\cdot (D_{n−2} +D_{n−1})$
Joe has sufficient quantity of pennies, nickels, dimes, and quarters. He wants to pay a $\$1$ bill using these coins. How many different combinations does he have?
How many different weights can be measured using a set of 4 masses of 1, 2, 3, 4 grams each? For each measurable weight, how many different ways are possible?
How many different ways to express 13 as the sum of some positive odd integers? These integers do not need to be unique. Sequence of these integers also matters. For example $5 + 7 + 1$ and $7 + 1 + 5$ will be treated as two different ways.
How many different ways are there to express $20$ as the sum of $1$, $2$, and $5$? (All numbers must appear.)
There are $2$ white balls, $3$ red balls, and $1$ yellow ball in a jar. How many different ways are there to retrieve $3$ balls?
There are $2$ white balls, $3$ red balls, and $1$ yellow balls in a jar. How many different ways are there to retrieve $3$ balls to form a line?
How many different $5$-digit numbers can be formed using $1$, $2$, $3$, and $4$ that satisfy the following conditions:
- the digit $1$ must appear either $2$ or $3$ times,
- the digit $2$ must appear even times,
- the digit $3$ must appear odd times, and
- the digit $4$ has no restriction
The sides of a right triangle all have lengths that are whole numbers. The sum of the length of one leg and the hypotenuse is 49. Find the sum of all the possible lengths of the other leg.
(A) 7 (B) 49 (C) 63 (D) 71 (E) 96
There are $60$ friends who want to visit each others home during summer vacation. Everyday, they decide to either stay home or visit the home of everyone who stayed home that day. Find the minimum number of days required for everyone to have visited their friends' homes.
Let $f(x) = x^3+ax^2+bx+c$ have solutions that are distinct negative integers. If $a+b+c =2014$, \ffind $c$.
What is the last digit of $17^{17^{17^{17}}}$?
Find the number of ending zeros of $2014!$ in base 9. Give your answer in base 9.
Find the sum of all positive integer $x$ such that $3\times 2^x = n^2-1$ for some positive integer $n$.
Find the number of pairs of integer solution $(x, y)$ that satisfies the equation $$(x-y + 2)(x-y-2) =-(x-2)(y-2)$$
Given $S = \{2, 5, 8, 11, 14, 17, 20,\cdots\}$. Given that one can choose $n$ different numbers from $S$, $\{A_1, A2,\cdots A_n\}$, s.t. $\displaystyle\sum_{i=1}^{n}\frac{1}{A_i}=1$ Find the minimum possible value of $n$.
Find the number of positive integers $n\le 2014$ such that there exists integer $x$ that satisfies the condition that $\displaystyle\frac{x + n}{x-n}$ is an odd perfect square.
Find all number sets $(a, b, c, d)$ s.t. $1 < a \le b \le c \le d, a,b,c,d \in\mathbb{N}$, and $a^2 + b + c + d,
a + b^2 + c + d, a + b + c^2 + d$ and $a + b + c + d^2$ are all square numbers. Sum the value of $d$ across all solution $set(s)$.