Back to VTRMC list
Problem source: HTML (archive) and PDF (archive)

Problem 1

Find the units digit (base 10) in the sum βˆ‘k=199k!\displaystyle{\sum_{k = 1}^{99} k!}.

πŸ“ My solution

Problem 2

Consider any three consecutive positive integers. Prove that the cube of the largest cannot be the sum of the cubes of the other two.

Problem 3

A sequence {un}\lbrace u_n \rbrace, n=0,1,2,…n = 0, 1, 2, …, is defined by u0=5,un+1=un+n2+3n+3u_0 = 5, u_{n+1} = u_n + n^2 + 3n+3, for n=0,1,2,…n = 0, 1, 2, …. If unu_n is expressed as a polynomial un=βˆ‘k=0dcknku_n = \sum_{k=0}^d c_k n^k, where dd is the degree of the polynomial, find the sum βˆ‘k=0dck\sum_{k=0}^d c_k.

Problem 4

Let the (x,y)(x, y)-plane be divided into regions by nn lines, any two of which may or may not intersect. Describe a procedure whereby these regions may be colored using only two colors so that regions with a common line segment as part of their boundaries have different colors.

Problem 5

Let f(x)f(x) satisfy the conditions for Rolle’s theorem on [a,b][a, b] with f(a)=f(b)=0f(a) = f(b) = 0. Prove that for each real number kk the function g(x)=fβ€²(x)+kf(x)g(x) = f'(x) + k f(x) has at least one zero in (a,b)(a, b).

Problem 6

A matrix is called excellent if it is square and the sum of its elements in each row and column equals the sum of its elements in every other row and column. Let VnV_n denote the collection of excellent nΓ—nn \times n matrices.

  1. Show that VnV_n is a vector space under addition and scalar multiplication (by real numbers).
  2. Find the dimensions of V2V_2, V3V_3, and V4V_4.
  3. If A∈VnA \in V_n and B∈VnB \in V_n, show that AB∈VnAB \in V_n.

Problem 7

Find the greatest real rr such that some normal line to the graph of y=x3+rxy = x^3 + rx passes through the origin, where the point of normality is not the origin.

Problem 8

Let f(x)f(x) be an arbitrary differentiable function on I=[x0βˆ’h,x0+h]I = [x_0 - h, x_0 + h] with ∣f’(x)βˆ£β‰€M|f’(x)| \le M on II where Mβ‰₯3M \ge \sqrt{3}. Let f(x0βˆ’h)≀f(x0)f(x_0 - h) \le f(x_0) and f(x0+h)≀f(x0)f(x_0+h) \le f(x_0). Find the smallest positive number rr such that at least one local maximum of ff lies inside or on the circle of radius rr centered at (x0,f(x0))(x_0, f(x_0)). Express your answer in terms of hh, MM and d=min⁑{f(x0)βˆ’f(x0βˆ’h),f(x0)βˆ’f(x0+h)}d = \min \lbrace f(x_0) - f(x_0 - h), f(x_0) - f(x_0 + h) \rbrace.