Bài tập dãy số bằng Tiếng Anh

SEQUENCE The sequence an is defined as follows: a1 = 1, an+1 = an + 1/an for n 1. Prove that a100 > 14. (ASU 1968) The sequence a1, a2, ... , an satisfies the following conditions: a1 = 0, |ai| = |ai-1 + 1| for i = 2, 3, ... , n. Prove that (a1 + a2 + ... + an)/n -1/2. (ASU 1968) A sequence of finite sets of positive integers is defined as follows. S0 = {m}, where m > 1. Then given Sn you derive Sn+1 by taking k2 and k+1 for each element k of Sn. For example, if S0 = {5}, then S2 = {7, 26, 36, 625}. Show that Sn always has 2n distinct elements.(ASU 1972) a1 and a2 are positive integers less than 1000. Define an = min{|ai - aj| : 0 < i < j<n}. Show that a21=0. (ASU 1976) an is an infinite sequence such that (an+1 - an)/2 tends to zero. Show that an tends to zero.(ASU1977) Given a sequence a1, a2, ... , an of positive integers. Let S be the set of all sums of one or more members of the sequence. Show that S can be divided into n subsets such that the smallest member of each subset is at least half the largest member.(ASU 1977) Show that there is an infinite sequence of reals x1, x2, x3, ... such that |xn| is bounded and for any m > n, we have |xm - xn| > 1/(m - n).(ASU 1978) The real sequence x1 x2 x3 ... satisfies x1 + x4/2 + x9/3 + x16/4 + ... + xN/n 1 for every square N = n2. Show that it also satisfies x1 + x2/2 + x3 /3 + ... + xn/n 3. (ASU1979) Define the sequence an of positive integers as follows. a1 = m. an+1 = an plus the product of the digits of an. For example, if m = 5, we have 5, 10, 10, ... . Is there an m for which the sequence is unbounded?(ASU 1980) The sequence an of positive integers is such that (1) an n3/2 for all n, and (2) m-n divides km - kn (for all m > n). Find an.(ASU 1981) The sequence an is defined by a1 = 1, a2 = 2, an+2 = an+1 + an. The sequence bn is defined by b1 = 2, b2 = 1, bn+2 = bn+1 + bn. How many integers belong to both sequences?(ASU1982) A subsequence of the sequence real sequence a1, a2, ... , an is chosen so that (1) for each i at least one and at most two of ai, ai+1, ai+2 are chosen and (2) the sum of the absolute values of the numbers in the subsequence is at least 1/6 .(ASU 1982) an is the last digit of [10n/2]. Is the sequence an periodic? bn is the last digit of [2n/2]. Is the sequence bn periodic?(ASU 1983) The real sequence xn is defined by x1 = 1, x2 = 1, xn+2 = xn+12 - xn/2. Show that the sequence converges and find the limit.(ASU 1984) The sequence a1, a2, a3, ... satisfies a4n+1 = 1, a4n+3 = 0, a2n = an. Show that it is not periodic.(ASU 1985) The sequence of integers an is given by a0 = 0, an = p(an-1), where p(x) is a polynomial whose coefficients are all positive integers. Show that for any two positive integers m, k with greatest common divisor d, the greatest common divisor of am and ak is ad.(ASU 1988) A sequence of positive integers is constructed as follows. If the last digit of an is greater than 5, then an+1 is 9an. If the last digit of an is 5 or less and an has more than one digit, then an+1 is obtained from an by deleting the last digit. If an has only one digit, which is 5 or less, then the sequence terminates. Can we choose the first member of the sequence so that it does not terminate?(ASU 1991) Define the sequence a1 = 1, a2, a3, ... by an+1 = a12 + a2 2 + a32 + ... + an2 + n. Show that 1 is the only square in the sequence. (CIS 1992) The sequence (an) satisfies am+n+ am-n= (a2m+a2n) for all mn0. If a1=1, find a1995. (Russian 1995) The sequence a1, a2, a3, ... of positive integers is determined by its first two members and the rule an+2 = (an+1 + an)/gcd(an, an+1). For which values of a1 and a2 is it bounded?(Russian 1999) The sequence a1, a2, .... , a3972 includes each of the numbers from 1 to 1986 twice. Can the terms be rearranged so that there are just n numbers between the two n's?(CMO 1986) The integer sequence ai is defined by a0 = m, a1 = n, a2 = 2n-m+2, ai+3 =3(ai+2 - ai+1) + ai. It contains arbitrarily long sequences consecutive terms which are squares. Show that every term is a square.(CMO 1992) x0, x1, ... , is a sequence of binary strings of length n. n is odd and x0 = 100...01. xm+1 is derived from xm as follows: the kth digit in the string is 0 if the kth and k+1st digits in the previous string are the same, 1 otherwise. [The n+1th digit in a string means the 1st]. Show that if xm = xn, then m is a multiple of n].(CMO 1995) a1, a2, ... is a sequence of non-negative integers such that an+m an + am for all m, n. Show that if N n, then an + aN na1 + N/n an.(CMO 1997) The sequence an is defined by a1 = 0, a2 = 1, an = (n an-1 + n(n-1) an-2 + (-1)n-1n)/2 + (-1)n. Find an + 2 nC1 an-1 + 3 nC2 an-2 + ... + n nC(n-1) a1, where nCm is the binomial coefficient n!/(m! (n-m)! ).(CMO 2000) Let a1 = 0, a2n+1 = a2n = n. Let s(n) = a1 + a2 + ... + an. Find a formula for s(n) and show that s(m + n) = mn + s(m - n) for m > n.(CanMO 1970) Let an = 1/(n(n+1) ). (1) Show that 1/n = 1/(n+1) + an. (2) Show that for any integer n > 1 there are positive integers r < s such that 1/n = ar + ar+1 + ... + as.(CanMO 1973) Define the real sequence a1, a2, a3, ... by a1 = 1/2, n2an = a1 + a2 + ... + an. Evaluate an. (CanMO 1975) The real sequence x0, x1, x2, ... is defined by x0 = 1, x1 = 2, n(n+1) xn+1 = n(n-1) xn - (n-2) xn-1. Find x0/x1 + x1x2 + ... + x50/x51.(CanMO 1976) The real sequence x1, x2, x3, ... is defined by x1 = 1 + k, xn+1 = 1/xn + k, where 0 < k < 1. Show that every term exceeds 1.(CanMO 1977) Define the real sequence x1, x2, x3, ... by x1 = k, where 1 2.(CanMO 1985) The integer sequence a1, a2, a3, ... is defined by a1 = 39, a2 = 45, an+2 = an+12 - an. Show that infinitely many terms of the sequence are divisible by 1986.(CanMO 1986) Define two integer sequences a0, a1, a2, ... and b0, b1, b2, ... as follows. a0 = 0, a1= 1, an+2 = 4an+1 - an, b0 = 1, b1 = 2, bn+2 = 4bn+1 - bn. Show that bn2 = 3an2 + 1.(CanMO 1988) A sequence of positive integers a1, a2, a3, ... is defined as follows. a1 = 1, a2 = 3, a3 = 2, a4n = 2a2n, a4n+1 = 2a2n + 1, a4n+2 = 2a2n+1 + 1, a4n+3 = 2a2n+1. Show that the sequence is a permutation of the positive integers. (CanMO 1993) Show that non-negative integers a b satisfy (a2 + b2) = n2(ab + 1), where n is a positive integer, if they are consecutive terms in the sequence ak defined by a0 = 0, a1 = n, ak+1 = n2ak - ak-1. (CanMO 1998) Show that in any sequence of 2000 integers each with absolute value not exceeding 1000 such that the sequence has sum 1, we can find a subsequence of one or more terms with zero sum.(CanMO 2000) Each member of the sequence a1, a2, ... , an belongs to the set {1, 2, ... , n-1} and a1 + a2 + ... + an < 2n. Show that we can find a subsequence with sum n.(Irish 1988) The sequence of nonzero reals x1, x2, x3, ... satisfies xn = xn-2xn-1/(2xn-2 - xn-1) for all n > 2. For which (x1, x2) does the sequence contain infinitely many integral terms?(Irish 1988) The sequence a1, a2, a3, ... is defined by a1 = 1, a2n = an, a2n+1 = a2n + 1. Find the largest value in a1, a2, ... , a1989 and the number of times it occurs.(Irish 1989) The sequence a1, a2, a3, ... is defined by a1 = 1, a2n = an, a2n+1 = a2n + 1. Find the largest value in a1, a2, ... , a1989 and the number of times it occurs.(Irish 2002) The sequenceis defined as: x1=1, xn+1=x n2- 3xn + 4,n= 1,2,3,... a) Prove that is monotone increasing and unbounded. b) Prove that the sequence defined as yn = 1/(x1-1) +....+1/(xn-1) is convergent and find its limit (Bungari 1997-Problem in winter) Let be a sequence of integer number such that their dicemal representations consist of even digits( a1=2, a2=4, a3=6,...). Find all integer number m such that am= 12m.(Bungari 1998 - Problem in winter) Prove that for every positive number the sequence such that x1=1, x2=a, =,n1 is convergent and find its limit.(Bungari 2000-Problem11.1) Given the sequence = , n=1,2,.....whereis a real number: a) Find the values of a such that the sequence is convergent. b) Find the values of a such that the sequence is monotone increasing.(Bungari 1999-Pro in winter) Let be a sequence such that x1=43, x2=142, = 3 +,n.Prove that: a) and are relatively prime for all n. b) for every natural number m there exits infinitely many natural number n such that -1 and -1 both divisible by m. (Bungari 2000-Pro3 third round) A sequence is a1, a2, a3,.... is defined by a1= k, a2= 5k-2 and an+2= 3an+1- 2an, n1, where k is a real number a)Find all values of k, such that the sequence is convergent. b)Prove that if k=1 then: ,n1, where denoted the integer part of x.(Bungari 2001,2-4) Define the sequence a1, a2, a3, ... by a1 = 1, an = an-1 - n if an-1 > n, an-1 + n if an-1 n. Let S be the set of n such that an = 1993. Show that S is infinite. Find the smallest member of S. If the element of S are written in ascending order show that the ratio of consecutive terms tends to 3.(IMO SHORTLIST 1993) The sequence x0, x1, x2, ... is defined by x0 = 1994, xn+1 = xn2/(xn + 1). Show that [xn ] = 1994 - n for 0 n 998.(IMO SHORTLIST 1994) Define the sequences an, bn, cn as follows. a0 = k, b0 = 4, c0 = 1. If an is even then an+1 = an/2, bn+1 = 2bn, cn+1 = cn. If an is odd, then an+1 = an - bn/2 - cn, bn+1 = bn, cn+1 = bn + cn. Find the number of positive integers k < 1995 such that some an = 0. (IMO SHORTLIST 1994) Define the sequence a1, a2, a3, ... as follows. a1 and a2 are coprime positive integers and an+2 = an+1an + 1. Show that for every m > 1 there is an n > m such that amm divides ann. Is it true that a1 must divide ann for some n > 1?(IMO SHORTLIST 1994) Find a sequence f(1), f(2), f(3), ... of non-negative integers such that 0 occurs in the sequence, all positive integers occur in the sequence infinitely often, and f( f(n163) ) = f( f(n) ) + f( f(361) ).(IMO SHORTLIST 1995) Given a > 2,define the sequence a0,a1,a2, ...by a0 = 1, a1 = a, an+2 = an+1(an+12/an2 -2). Show that 1/a0 + 1/a1 + 1/a2 + ... + 1/an < 2 + a - (a2 - 4)1/2.(IMO SHORTLIST 1996) The sequence a1, a2, a3, ... is defined by a1 = 0 and a4n = a2n + 1, a4n+1 = a2n - 1, a4n+2 = a2n+1 - 1, a4n+3 = a2n+1 + 1. Find the maximum and minimum values of an for n = 1, 2, ... , 1996 and the values of n at which they are attained. How many terms an for n = 1, 2, ... , 1996 are 0? (IMO SHORTLIST 1996) A finite sequence of integers a0, a1, ... , an is called quadratic if |a1 - a0| = 12, |a2 - a1| = 22,..., |an - an-1| = n2. Show that any two integers h, k can be linked by a quadratic sequence (in other words for some n we can find a quadratic sequence ai with a0 = h, an = k). Find the shortest quadratic sequence linking 0 and 1996. (IMO SHORTLIST 1996) The sequences Rn are defined as follows. R1 = (1). If Rn = (a1, a2, ... , am), then Rn+1 = (1, 2, ... , a1, 1, 2, ... , a2, 1, 2, ... , 1, 2, ... , am, n+1). For example, R2 = (1, 2), R3 = (1, 1, 2, 3), R4 = (1, 1, 1, 2, 1, 2, 3, 4). Show that for n > 1, the kth term from the left in Rn is 1 iff the kth term from the right is not 1.(IMO SHORTLIST 1997) The sequence a1, a2, a3, ... is defined as follows. a1 = 1. an is the smallest integer greater than an-1 such that we cannot find 1 i, j, k n (not necessarily distinct) such that ai + aj = 3ak. Find a1998. (IMO SHORTLIST 1998) The sequence 0 a0 < a1 < a2 < ... is such that every non-negative integer can be uniquely expressed as ai + 2aj + 4ak (where i, j, k are not necessarily distinct). Find a1998. (IMO SHORTLIST 1998) Let p > 3 be a prime. Let h be the number of sequences a1, a2, ... , ap-1 such that a1 + 2a2 + 3a3 + ... + (p-1)ap-1 is divisible by p and each ai is 0, 1 or 2. Let k be defined similarly except that each ai is 0, 1 or 3. Show that h k with equality if p = 5.(IMO SHORTLIST 1999) Show that there exist two strictly increasing sequences a1, a2, a3, ... and b1, b2, b3, ... such that an(an + 1) divides bn2 + 1 for each n.(IMO SHORTLIST 1999) 0 = a0 < a1 < a2 < ... and 0 = b0 < b1 < b2 < ... are sequences of real numbers such that: (1) if ai + aj + ak = ar + as + at, then (i, j, k) is a permutation of (r, s, t); and (2) a positive real x can be represented as x = aj - ai iff it can be represented as bm - bn. Prove that ak = bk for all k. (IMO SHORTLIST 2000) Find all finite sequences a0, a1, a2, ... , an such that am equals the number of times that m appears in the sequence.(IMO SHORTLIST 2001) The sequence an is defined by a1= 1111, a2 = 1212, a3 = 1313, and an+3 = |an+2 - an+1| + |an+1 - an|. Find an, where n = 1414.(IMO SHORTLIST 2001) The infinite real sequence x1, x2, x3, ... satisfies |xi - xj| 1/(i + j) for all unequal i, j. Show that if all xi lie in the interval [0, c], then c 1.(IMO SHORTLIST 2002) The sequence an is defined by a1 = a2 = 1, an+2 = an+1 + 2an. The sequence bn is defined by b1 = 1, b2 = 7, bn+2 = 2bn+1 + 3bn. Show that the only integer in both sequences is 1. (USAMO 1973) a1, a2, ... , an is an arbitrary sequence of positive integers. A member of the sequence is picked at random. Its value is a. Another member is picked at random, independently of the first. Its value is b. Then a third, value c. Show that the probability that a + b + c is divisible by 3 is at least 1/4.(USAMO 1979) 0 < a1 a2 a3 ... is an unbounded sequence of integers. Let bn = m if am is the first member of the sequence to equal or exceed n. Given that a19 = 85, what is the maximum possible value of a1 + a2 + ... + a19 + b1 + b2 + ... + b85?(USAMO 1985) a1, a2, ... , an is a sequence of 0s and 1s. T is the number of triples (ai, aj, ak) with i i with aj ¹ ai. Show that T = f(1) (f(1) - 1)/2 + f(2) (f(2) - 1)/2 + ... + f(n) (f(n) - 1)/2. If n is odd, what is the smallest value of T?(USAMO 1987) The sequence an of odd positive integers is defined as follows: a1 = r, a2 = s, and an is the greatest odd divisor of an-1 + an-2. Show that, for sufficiently large n, an is constant and find this constant (in terms of r and s).(USAMO 1993) The sequence a1, a2, ... , a99 has a1 = a3 = a5 = ... = a97 = 1, a2 = a4 = a6 = ... = a98 = 2, and a99 = 3. We interpret subscripts greater than 99 by subtracting 99, so that a100 means a1 etc. An allowed move is to change the value of any one of the an to another member of {1, 2, 3} different from its two neighbors, an-1 and an+1. Is there a sequence of allowed moves which results in am = am+2 = ... = am+96 = 1, am+1 = am+3 = ... = am+95 = 2, am+97 = 3, an+98 = 2 for some m? [So if m = 1, we have just interchanged the values of a98 and a99.](USAMO 1994) xi is a infinite sequence of positive reals such that for all n, x1 + x2 + ... + xn . Show that x12 + x22 + ... + xn2 > (1 + 1/2 + 1/3 + ... + 1/n) / 4 for all n.(USAMO 1994) a0, a1, a2, ... is an infinite sequence of integers such that an - am is divisible by n - m for all (unequal) n and m. For some polynomial p(x) we have p(n) > |an| for all n. Show that there is a polynomial q(x) such that q(n) = an for all n.(USAMO 1995) A type 1 sequence is a sequence with each term 0 or 1 which does not have 0, 1, 0 as consecutive terms. A type 2 sequence is a sequence with each term 0 or 1 which does not have 0, 0, 1, 1 or 1, 1, 0, 0 as consecutive terms. Show that there are twice as many type 2 sequences of length n+1 as type 1 sequences of length n.(USAMO 1996) Let pn be the nth prime. Let 0 < a < 1 be a real. Define the sequence xn by x0 = a, xn = the fractional part of pn/xn-1 if xn ¹ 0, or 0 if xn-1 = 0. Find all a for which the sequence is eventually zero.(USAMO 1997) A sequence of polygons is derived as follows. The first polygon is a regular hexagon of area 1. Thereafter each polygon is derived from its predecessor by joining two adjacent edge midpoints and cutting off the corner. Show that all the polygons have area greater than 1/3.(USAMO 1997) The sequence of non-negative integers c1, c2, ... , c1997 satisfies c1 0 and cm + cn cm+n cm + cn + 1 for all m, n > 0 with m + n < 1998. Show that there is a real k such that cn = [nk] for 1 n 1997. (USAMO 1997) Define the sequence an, by a1 = 0, a2 = 1,a3= 2,a4 = 3, and a2n = a2n-5 + 2n, a2n+1 = a2n + 2n-1. Show that a2n = [17/7 2n-1] - 1, a2n-1 = [12/7 2n-1] - 1.(BMO 1972) Define sequences of integers by p1 = 2, q1 = 1, r1 = 5, s1= 3, pn+1 = pn2 + 3 qn2, qn+1 = 2 pnqn, rn = pn + 3 qn, sn = pn + qn. Show that pn/qn > > rn/sn and that pn/qn differs from by less than sn/(2 rnqn2).(BMO 1972) Show that there is a unique sequence a1, a2, a3, ... such that a1 = 1, a2 > 1, an+1an-1 = an3 + 1, and all terms are integral.(BMO 1978) Find all real a0 such that the sequence a0, a1, a2, ... defined by an+1 = 2n - 3an has an+1 > an for all n 0.(BMO 1980) The sequence u0, u1, u2, ... is defined by u0 = 2, u1 = 5, un+1un-1 - un2 = 6n-1. Show that all terms of the sequence are integral. (BMO 1981) The sequence p1, p2, p3, ... is defined as follows. p1 = 2. pn+1 is the largest prime divisor of p1p2 ... pn + 1. Show that 5 does not occur in the sequence.(BMO 1982) Let { x } denote the nearest integer to x, so that x - 1/2 { x } < x + 1/2. Define the sequence u1, u2, u3, ... by u1 = 1. un+1 = un + { un}. So, for example, u2 = 2, u3 = 5, u3 = 12. Find the units digit of u1985.(BMO 1985) The real sequence x1, x1, x2, ... is defined by x0 = 1, xn+1 = (3xn +)/2. Show that all the terms are integers.(BMO 2002) A sequence of values in the range 0, 1, 2, ... , k-1 is defined as follows: a1 = 1, an = an-1 + n (mod k). For which k does the sequence assume all k possible values?(APMO 1991) a1, a2, a3, ... an is a sequence of non-zero integers such that the sum of any 7 consecutive terms is positive and the sum of any 11 consecutive terms is negative. What is the largest possible value for n?(APMO 1992) Find all real sequences x1, x2, ... , x1995 which satisfy 2 xn+1 - n + 1 for n = 1, 2, ... , 1994, and 2 x1 + 1.(APMO 1995) Find the smallest n such that any sequence a1, a2, ... , an whose values are relatively prime square-free integers between 2 and 1995 must contain a prime. [An integer is square-free if it is not divisible by any square except 1.](APMO 1995) P1 and P3 are fixed points. P2 lies on the line perpendicular to P1P3 through P3. The sequence P4, P5, P6, ... is defined inductively as follows: Pn+1 is the foot of the perpendicular from Pn to Pn-1Pn-2. Show that the sequence converges to a point P (whose position depends on P2). What is the locus of P as P2 varies?(APMO 1997) The integers r, s are non-zero and k is a positive real. The sequence an is defined by a1 = r, a2 = s, an+2 = (an+12 + k)/an. Show that all terms of the sequence are integers iff (r2 + s2 + k)/(rs) is an integer.(Balkan 1986) xn is the sequence 51, 53, 57, 65, ... , 2n + 49, ... Find all n such that xn and xn+1 are each the product of just two distinct primes with the same difference.(Balkan 1988) The sequence un is defined by u1 = 1, u2 = 3, un = (n+1) un-1 - n un-2. Which members of the sequence which are divisible by 11? (Balkan 1990) Define an by a3 = (2 + 3)/(1 + 6), an = (an-1 + n)/(1 + n an-1). Find a1995. (Balkan 1995) 0 = a1, a2, a3, ... is a non-decreasing, unbounded sequence of non-negative integers. Let the number of members of the sequence not exceeding n be bn. Prove that (x0 + x1 + ... + xm)(y0 + y1 + ... + yn) (m + 1)(n + 1).(Balkan 1999) The sequence an is defined by a1 = 20, a2 = 30, an+1 = 3an - an-1. Find all n for which 5an+1an + 1 is a square.(Balkan 2002) ai and bi are real, and S1¥ ai2 and S1¥ bi2 converge. Prove that S1¥ (ai - bi)p converges for p 2.(Putnam 1940) The sequence an of real numbers satisfies an+1 = 1/(2 - an). Show that an = 1. (Putnam 1947) an is a sequence of positive reals decreasing monotonically to zero. bn is defined by bn = an - 2an+1 + an+2 and all bn are non-negative. Prove that b1 + 2b2 + 3b3 + ... = a1.(Putnam 1948) an is a sequence of positive reals. Show that lim sup((a1 + an+1)/an)n e.(Putam 1949) The sequences an, bn, cn of positive reals satisfy: (1) a1 + b1 + c1 = 1; (2) an+1 = an2 + 2bncn, bn+1 = bn2 + 2cnan, cn+1 = cn2 + 2anbn. Show that each of the sequences converges and find their limits. (Putnam 1947) The sequence an is defined by a0 = a, a1 = b, an+1 = an + (an-1 - an)/(2n). Find an. (Putnam 1950) Let an = S1n (-1)i+1/i. Assume that an = k. Rearrange the terms by taking two positive terms, then one negative term, then another two positive terms, then another negative term and so on. Let bn be the sum of the first n terms of the rearranged series. Assume that bn = h. Show that b3n = a4n + a2n/2, and hence that h ¹ k.(Putnam 1954) Let a be a positive real. Let an = S1n (a/n + i/n)n. Show that an (ea, ea+1). (Putnam 1954) an is a sequence of monotonically decreasing positive terms such that S an converges. S is the set of all S bn, where bn is a subsequence of an. Show that S is an interval iff an-1 Sn¥ ai for all n.(Putnam 1955) The sequence an is defined by a1 = 2, an+1 = an2 - an + 1. Show that any pair of values in the sequence are relatively prime and that = 1.(Putnam 1956) Define an by a1 = ln a,a2 = ln(a - a1),an+1 = an + ln(a - an). Show thatan = a-1. (Putnam 1957) The sequence an is defined by its initial value a1, and an+1 = an(2 - k an). For what real a1 does the sequence converge to 1/k?(Putnam 1957) A sequence of numbers ai Î [0, 1] is chosen at random. Show that the expected value of n, where S1n ai > 1, S1n-1 ai 1 is e.(Putnam 1958) a and b are positive irrational numbers satisfying 1/a + 1/b = 1. Let an = [n a] and bn = [n b], for n = 1, 2, 3, ... . Show that the sequences an and bn are disjoint and that every positive integer belongs to one or the other.(Putnam 1959) The sequence a1, a2, a3, ... of positive integers is strictly monotonic increasing, a2 = 2 and amn = aman for m, n relatively prime. Show that an = n. (Putnam 1963) Show that for any sequence of positive reals, an, we have lim . Show that we can find a sequence where equality holds. (Putnam 1963) The series an of non-negative terms converges and ai <= 100an for i = n, n + 1, n + 2, ... , 2n. Show that nan = 0.(Putnam 1963) The sequence of integers un is bounded and satisfies un = (un-1 + un-2 + un-3un-4)/(un-1un-2 + un-3 + un-4). Show that it is periodic for sufficiently large n.(Putnam 1964) an are positive integers such that S 1/an converges. bn is the number of an which are <= n. Prove lim bn/n = 0.(Putnam 1964) Let an be a strictly monotonic increasing sequence of positive integers. Let bn be the least common multiple of a1, a2, ... , an. Prove that S 1/bn converges.(putnam 1964) is an infinite sequence of real numbers. Let bn = 1/n . Prove that b1, b2, b3, b4, ... converges to k if b1, b4, b9, b16, ... converges to k. (Putnam1965) Define the sequenceby a1 Î (0, 1), and an+1 = an(1 - an). Show that nan= 1. (Putnam 1966) an is a sequence of positive reals such that 1/an converges. Let sn = . Prove that n2an/sn2 converges.(Putnam 1966) Let un be the number of symmetric n x n matrices whose elements are all 0 or 1, with exactly one 1 in each row. Take u0 = 1. Prove un+1 = un + n un-1 and un xn/n! = ef(x), where f(x) = x + (1/2) x2.(Putnam 1967) We are given a sequence a1, a2, ... , an. Each ai can take the values 0 or 1. Initially, all ai = 0. We now successively carry out steps 1, 2, ... , n. At step m we change the value of ai for those i which are a multiple of m. Show that after step n, ai = 1 if i is a square. Devise a similar scheme to give ai = 1 if i is twice a square.(Putnam 1967) The sequence a1, a2, a3, ... satisfies a1a2 = 1, a2a3 = 2, a3a4 = 3, a4a5 = 4, ... . Also, an/an+1 = 1. Prove that a1 = .(Putnam 1969) The sequence ai, i = 1, 2, 3, ... is strictly monotonic increasing and the sum of its inverses converges. Let f(x) = the largest i such that ai < x. Prove that f(x)/x tends to 0 as x tends to infinity.(Putnam 1969) The real sequence a1, a2, a3, ... has the property that (an+2 - an) = 0. Prove that (an+1 - an)/n = 0.(Putnam 1970) A sequence is said to have a Cesaro limit if x1 + x2 + ... + xn)/n exists. Find all (real-valued) functions f on the closed interval [0, 1] such that { f(xi) } has a Cesaro limit if has a Cesaro limit.(Putnam 1972) an = ±1/n and an+8 > 0 if an > 0. Show that if four of a1, a2, ... , a8 are positive, then an converges. Is the converse true?(Putnam 1973) Let 0 1, then the probability of all Ai occurring is at least pn. You may assume that all pn are positive.(Putnam 1976) an are defined by a1 = a, a2 = b, an+2 = anan+1/(2an - an+1). a, b are chosen so that an+1 ¹ 2an. For what a, b are infinitely many an integral?(Putnam 1979) Define an by a0 = a, an+1 = 2an - n2. For which a are all an positive? (Putnam 1980) Let f(n) = n + [Ön]. Define the sequence ai by a0 = m, an+1 = f(an). Prove that it contains at least one square.(Putnam 1983) Define a sequence of convex polygons Pn as follows. P0 is an equilateral triangle side 1. P