Sunday, 19 May 2019
A list of five two-digit positive integers is written in increasing order on a blackboard. Each of the five integers is a multiple of 3, and each digit 0,1,2,3,4,5,6,7,8,9 appears exactly once on the blackboard. In how many ways can this be done? Note that a two-digit number cannot begin with the digit 0.
Subscribe to:
Posts (Atom)
Define \(f: \mathbb{R} \rightarrow \mathbb{R}\) by \[f(x)= \begin{cases}(1-\cos x) \sin \left(\frac{1}{x}\right), & x \neq 0 \\ 0, ...
-
Find all polynomial \(P(x)\) with degree \(\leq n\) and non negative coefficients such that \[P(x)P(\frac{1}{x})\leq P(1)^2\]for all positiv...
-
Find the number of ways \(66\) identical coins can be separated into three nonempty piles so that there are fewer coins in the first pile th...
-
A moth starts at vertex A of a certain cube and is trying to get to vertex B, which is opposite A, in five or fewer “steps,” where a step ...