Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 20 views

    The 64th William Lowell Putnam Mathematical Competition Saturday, December 6, 2003

    Uploaded by

    Âshútösh Kumar
    1) This document contains 6 problems (labeled A1 through A6) from the 64th William Lowell Putnam Mathematical Competition along with 6 additional problems (labeled B1 through B6). 2) The problems cover a range of mathematical topics and ask examinees to prove statements, find minimum/maximum values, determine relationships between quantities, and establish one-to-one correspondences. 3) Solving the problems requires a variety of mathematical skills like algebraic manipulation, calculus techniques, number theory concepts, and proofs.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    The 64th William Lowell Putnam Mathematical Competition Saturday, December 6, 2003

    Uploaded by

    Âshútösh Kumar
    20 views1 page
    1) This document contains 6 problems (labeled A1 through A6) from the 64th William Lowell Putnam Mathematical Competition along with 6 additional problems (labeled B1 through B6). 2) The problems cover a range of mathematical topics and ask examinees to prove statements, find minimum/maximum values, determine relationships between quantities, and establish one-to-one correspondences. 3) Solving the problems requires a variety of mathematical skills like algebraic manipulation, calculus techniques, number theory concepts, and proofs.

    Original Description:

    putnam

    Original Title

    2003

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    1) This document contains 6 problems (labeled A1 through A6) from the 64th William Lowell Putnam Mathematical Competition along with 6 additional problems (labeled B1 through B6). 2) The problems cover a range of mathematical topics and ask examinees to prove statements, find minimum/maximum values, determine relationships between quantities, and establish one-to-one correspondences. 3) Solving the problems requires a variety of mathematical skills like algebraic manipulation, calculus techniques, number theory concepts, and proofs.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    20 views1 page

    The 64th William Lowell Putnam Mathematical Competition Saturday, December 6, 2003

    Uploaded by

    Âshútösh Kumar
    1) This document contains 6 problems (labeled A1 through A6) from the 64th William Lowell Putnam Mathematical Competition along with 6 additional problems (labeled B1 through B6). 2) The problems cover a range of mathematical topics and ask examinees to prove statements, find minimum/maximum values, determine relationships between quantities, and establish one-to-one correspondences. 3) Solving the problems requires a variety of mathematical skills like algebraic manipulation, calculus techniques, number theory concepts, and proofs.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 1

    The 64th William Lowell Putnam Mathematical Competition

    Saturday, December 6, 2003

    A1 Let n be a fixed positive integer. How many ways are B2 Let n be a positive integer. Starting with the sequence
    there to write n as a sum of positive integers, 1, 21 , 31 , . . . , 1n , form a new sequence of n − 1 entries
    3 5 2n−1
    4 , 12 , . . . , 2n(n−1) by taking the averages of two consec-
    n = a1 + a2 + · · · + ak ,
    utive entries in the first sequence. Repeat the averaging
    with k an arbitrary positive integer and a1 ≤ a2 ≤ · · · ≤ of neighbors on the second sequence to obtain a third
    ak ≤ a1 + 1? For example, with n = 4 there are four sequence of n−2 entries, and continue until the final se-
    ways: 4, 2+2, 1+1+2, 1+1+1+1. quence produced consists of a single number xn . Show
    that xn < 2/n.
    A2 Let a1 , a2 , . . . , an and b1 , b2 , . . . , bn be nonnegative real
    numbers. Show that B3 Show that for each positive integer n,
    n
    (a1 a2 · · · an )1/n + (b1 b2 · · · bn )1/n n! = ∏ lcm{1, 2, . . . , bn/ic}.
    i=1
    ≤ [(a1 + b1 )(a2 + b2 ) · · · (an + bn )]1/n .
    (Here lcm denotes the least common multiple, and bxc
    A3 Find the minimum value of denotes the greatest integer ≤ x.)

    | sin x + cos x + tan x + cot x + sec x + csc x| B4 Let f (z) = az4 + bz3 + cz2 + dz + e = a(z − r1 )(z −
    r2 )(z − r3 )(z − r4 ) where a, b, c, d, e are integers, a 6= 0.
    for real numbers x. Show that if r1 + r2 is a rational number and r1 + r2 6=
    r3 + r4 , then r1 r2 is a rational number.
    A4 Suppose that a, b, c, A, B,C are real numbers, a 6= 0 and
    A 6= 0, such that B5 Let A, B, and C be equidistant points on the circumfer-
    ence of a circle of unit radius centered at O, and let P
    |ax2 + bx + c| ≤ |Ax2 + Bx +C| be any point in the circle’s interior. Let a, b, c be the
    distance from P to A, B,C, respectively. Show that there
    for all real numbers x. Show that is a triangle with side lengths a, b, c, and that the area of
    this triangle depends only on the distance from P to O.
    |b2 − 4ac| ≤ |B2 − 4AC|.
    B6 Let f (x) be a continuous real-valued function defined
    A5 A Dyck n-path is a lattice path of n upsteps (1, 1) and n on the interval [0, 1]. Show that
    downsteps (1, −1) that starts at the origin O and never Z 1Z 1 Z 1
    dips below the x-axis. A return is a maximal sequence | f (x) + f (y)| dx dy ≥ | f (x)| dx.
    of contiguous downsteps that terminates on the x-axis. 0 0 0
    For example, the Dyck 5-path illustrated has two re-
    turns, of length 3 and 1 respectively.

    Show that there is a one-to-one correspondence be-


    tween the Dyck n-paths with no return of even length
    and the Dyck (n − 1)-paths.
    A6 For a set S of nonnegative integers, let rS (n) denote the
    number of ordered pairs (s1 , s2 ) such that s1 ∈ S, s2 ∈ S,
    s1 6= s2 , and s1 + s2 = n. Is it possible to partition the
    nonnegative integers into two sets A and B in such a way
    that rA (n) = rB (n) for all n ?
    B1 Do there exist polynomials a(x), b(x), c(y), d(y) such
    that

    1 + xy + x2 y2 = a(x)c(y) + b(x)d(y)

    holds identically?

    You might also like