In this paper, let $[x]$ denote the greatest integer not exceeding x. For examples, $[5]=5$, $[2.8]=2$, and $[-2.3]=-3$.
Find the area of the region R on the xy-plane consisting of the points (x,y) satisfying the equation $[x]+[y]=10$, where $0\le x\le 3$.
(Note: If you think that the region R does not have any area, enter your answer as “0”; if you think that the region R is unbounded, enter your answer as “99999”.)
Three of the four integers between 100 and 1000 which are equal to the sum of the cubes of their digits are 153, 371, and 407 (For example, $1^3+5^3+3^3=153$.). Determine the fourth integer.
Find the shortest distance (rounded off to the nearest whole number if necessary) from the point (22,21) to the graph with equation $x^3+1=y(3 x-y^2)$.
Let $\triangle ABC$ be a triangle with a=BC, b=AC and c=AB. Assume that a+c=2 b, $\angle A-\angle C=\pi/3$ and $\sin B=\sqrt m/n$ for some positive integers m,n. What is the least possible value of m+n?
Ah Meng is going to shade some squares of an 6 × 11 rectangular board in such a way that in every L-shape of the forms , at least half of the squares in it are shaded. Determine the smallest number of squares in the board that Ah Meng must shade in order to fulfil this condition.
In the triangle ABC, $AB=7$, $BC=10$ and $CA=\sqrt{73}$, M is the midpoint of AC, and P is the point on BC such that AP intersects BM at Q and BP=BQ. Find the length of AP.
A triangle $A'B'C'$ is formed with sides whose lengths are the lengths of the medians of a triangle ABC. Suppose the product of the lengths of the three sides of ABC is 640. Find the product of the lengths of the medians of the triangle $A'B'C'$.
Let $f_0(x)=\frac{x}{3 x+2}$ and for any integer $n\ge 1$, $f_n(x)=f_0(f_{n-1}(x))$. Assume that $f_{2018}(x)=\frac{x}{Ax+B}$. What is the value of 3 B-A?
How many 3-element subsets {a,b,c} of {1,2,...,100} have the property that a+b+c is a multiple of 6? For example, {1,2,3} and {2,6,10} are examples of such sets.
(Note: {a,b,c}, {a,c,b} and {b,a,c} are considered as the same set.)
Assume that $a_1\lt 2$, and for any integer $n\ge 2$, $a_n=1+a_{n-1}(a_{n-1}-1)$. If $$\frac 1{a_1}+\frac 1{a_2}+\cdots+\frac 1{a_m}=1$$ for some integer m, what is the maximum value of $16 a_1-a_{m+1}$?