Alpha Individual Solutions MAΘ National Convention 2013

Similar documents
EVALUATION OF TRIGONOMETRIC FUNCTIONS

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

1.2 Binomial Coefficients and Subsets

Counting Regions in the Plane and More 1

The isoperimetric problem on the hypercube

PLEASURE TEST SERIES (XI) - 04 By O.P. Gupta (For stuffs on Math, click at theopgupta.com)

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence?

Numerical Methods Lecture 6 - Curve Fitting Techniques

Mathematics and Art Activity - Basic Plane Tessellation with GeoGebra

Ones Assignment Method for Solving Traveling Salesman Problem

n n B. How many subsets of C are there of cardinality n. We are selecting elements for such a

Pattern Recognition Systems Lab 1 Least Mean Squares

The Platonic solids The five regular polyhedra

1. Sketch a concave polygon and explain why it is both concave and a polygon. A polygon is a simple closed curve that is the union of line segments.

Module 8-7: Pascal s Triangle and the Binomial Theorem

Arithmetic Sequences

Lecture 1: Introduction and Strassen s Algorithm

FURTHER INTEGRATION TECHNIQUES (TRIG, LOG, EXP FUNCTIONS)

Octahedral Graph Scaling

WebAssign Lesson 6-1b Geometric Series (Homework)

Math 10C Long Range Plans

CONVERGENCE OF THE RATIO OF PERIMETER OF A REGULAR POLYGON TO THE LENGTH OF ITS LONGEST DIAGONAL AS THE NUMBER OF SIDES OF POLYGON INCREASES

Math Section 2.2 Polynomial Functions

Our starting point is the following sketch of part of one of these polygons having n vertexes and side-length s-

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

Examples and Applications of Binary Search

The number n of subintervals times the length h of subintervals gives length of interval (b-a).

Intro to Scientific Computing: Solutions

condition w i B i S maximum u i

Intermediate Statistics

Lecture 5. Counting Sort / Radix Sort

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4

Homework 1 Solutions MA 522 Fall 2017

INSCRIBED CIRCLE OF GENERAL SEMI-REGULAR POLYGON AND SOME OF ITS FEATURES

South Slave Divisional Education Council. Math 10C

Ch 9.3 Geometric Sequences and Series Lessons

CSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)

An (or ) is a sequence in which each term after the first differs from the preceding term by a fixed constant, called the.

NTH, GEOMETRIC, AND TELESCOPING TEST

Parabolic Path to a Best Best-Fit Line:

Area As A Limit & Sigma Notation

Assignment 5; Due Friday, February 10

SEQUENCES AND SERIES

CONTINUI TY. JEE-Mathematics. Illustration 1 : Solution : Illustration 2 : 1. CONTINUOUS FUNCTIONS :

6.854J / J Advanced Algorithms Fall 2008

A Resource for Free-standing Mathematics Qualifications

Descriptive Statistics Summary Lists

Computer Science Foundation Exam. August 12, Computer Science. Section 1A. No Calculators! KEY. Solutions and Grading Criteria.

MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS

BOOLEAN MATHEMATICS: GENERAL THEORY

Counting II 3, 7 3, 2 3, 9 7, 2 7, 9 2, 9

Computational Geometry

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)

CS Polygon Scan Conversion. Slide 1

Visualization of Gauss-Bonnet Theorem

CMPT 125 Assignment 2 Solutions

Mathematical Stat I: solutions of homework 1

Lecture 7 7 Refraction and Snell s Law Reading Assignment: Read Kipnis Chapter 4 Refraction of Light, Section III, IV

Fast Fourier Transform (FFT) Algorithms

Math 3201 Notes Chapter 4: Rational Expressions & Equations

The Graphs of Polynomial Functions

OCR Statistics 1. Working with data. Section 3: Measures of spread

Orientation. Orientation 10/28/15

EE123 Digital Signal Processing

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.

ENGR Spring Exam 1

Lecture 28: Data Link Layer

1. The lines intersect. There is one solution, the point where they intersect. The system is called a consistent system.

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov

. Written in factored form it is easy to see that the roots are 2, 2, i,

Performance Plus Software Parameter Definitions

3D Model Retrieval Method Based on Sample Prediction

27 Refraction, Dispersion, Internal Reflection

IMP: Superposer Integrated Morphometrics Package Superposition Tool

Python Programming: An Introduction to Computer Science

1.8 What Comes Next? What Comes Later?

LU Decomposition Method

GEOMETRY AREA UNIT. Day I Area Review. Triangle Parallelogram Rectangle. A b h. Square Trapezoid Kite. b 2. b 1. 1 Atrapezoid h b1 b2

3. b. Present a combinatorial argument that for all positive integers n : : 2 n

Lecture 2: Spectra of Graphs

The Nature of Light. Chapter 22. Geometric Optics Using a Ray Approximation. Ray Approximation

Solution printed. Do not start the test until instructed to do so! CS 2604 Data Structures Midterm Spring, Instructions:

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

Optimal Mapped Mesh on the Circle

Lecture 18. Optimization in n dimensions

CIS 121. Introduction to Trees

Package popkorn. R topics documented: February 20, Type Package

CS 683: Advanced Design and Analysis of Algorithms

Civil Engineering Computation

Force Network Analysis using Complementary Energy

Some non-existence results on Leech trees

1 Graph Sparsfication

UNIT 1 RECURRENCE RELATIONS

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS

Hyperbolic polygonal spirals

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

Big-O Analysis. Asymptotics

Lecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions

Transcription:

Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5 TB. 49

Alpha Idividual Solutios MAΘ Natioal Covetio 0 Solutios:. v 8,, 8 784 44 44 69 7 5 si 5 si0 si5 si0 si45 si60 si75 0. 6 6 6 0.978 4 4. ta correspods to 60 or 40 i the first rotatio aroud the circle. 60 correspods to r r 4cos 4, which has o solutios. 40 correspods to 4cos 4, so r, givig two poits of itersectio. However, both graphs go through the origi as well, so there are a total of three poits of itersectio. 4. Label the edges of the kite as i the picture. Therefore, we have a x c ad a y b. Subtract the secod equatio from the first to get x y c b, which equals 5 by assumptio. Sice xy 5 also, we must have xy sice 5 x y x y x y. Solvig this system yields x, which is the sought legth. 5. First, we will fid all ordered triples a, b, c with oegative coordiates with a b c. If a 0, the b c 5, ad the oly solutios are 0,0,5 ad 0,9,. A quick search yields o solutios for a (the same is the case for a, 4, 6, 7, or 8 ; it is t ecessary to check a 9 or larger values sice i those cases we would have a, the a b c 9 4 5 ). If b c, ad the oly solutios are,5,4 ad,0,. If a 5, the b c 00, ad the oly solutio is 5,0,0. For,5,4 ad,0,, there are six differet arragemets, ad each umber could be positive or egative, so for the two poits, there are 6 96 poits. For umber could be positive or egative, so for that poit there are 5,0,0, there are three differet arragemets, ad each 4 poits. For 0,9,, there are six differet arragemets, ad each ozero umber could be positive or egative, so for that poit there are 6 4 poits. Fially, for 0,0,5, there are three

Alpha Idividual Solutios MAΘ Natioal Covetio 0 differet arragemets, ad each ozero umber could be positive or egative, so for that poit there are 6 poits. This gives a total of 96 4 4 6 50 distict poits. 6. Each factor of the equatio correspods to a sigle poit, ad these ca be foud by completig the square. x y x 4y 5 x y, so if this equals 0, the poit is. x y 4x y 5 x y, so if this equals 0, the poit is,, distace betwee these poits is 9 0.. The 7. Usig the method of fiite differeces, we have: The give iformatio is coected with solid lies, so the miimum degree of f is 4. Fiishig out the rest of the differeces (dashed lies) to get two more values, workig backwards from s alog the bottom row, yields f 7 48. 8. Sice cos5 si7, the agles beig complemetary, we must solve cos7 si. Agai, the complemetary agle would be the smallest positive agle that works, so the aswer is 5. 9. I the picture, based o the give iformatio, x 5, ad usig the Pythagorea Theorem, y 5. This makes the altitude to the hypoteuse 5 5 8 4. 6 6

Alpha Idividual Solutios MAΘ Natioal Covetio 0 0. 0 x 5 0 0 0 x 60 0 x x x 0, so the sum of the solutios is 4 x 6 4 sice the two solutios are differet. c c c c. f f c f c c ad fc, so settig c c 6c c c c these equal mea thatc 0 c or 6c c c 0. Therefore, the ozero solutio is c.5.. Reorderig the -elemet data set, we get,,,,, 5, 5, 7, 7, 7, 7,, ad the sum of the elemets is 60, so A 5. The media would be the average of 5 ad 5, so B 5. Clearly, C 7, so C AB 755.. The side legth of the hexago is 4 8, so the eclosed area is 8. 4. Let x 5 5 5 5.... The x 5 x ad x 0. Thus 0 x x 5 x. Sice x0, x. x 5 x 5. Coutig up the white area as fractios of the total, we get... 4 4 4 4 4 4 4 which is a ifiite geometric series with sum 4. So, actually, oe of the triagle s 4 area is black! 89 si 0 0 si00 8 8, ad usig the fact that 6. 4

Alpha Idividual Solutios MAΘ Natioal Covetio 0 si0 si50 si70 7 55. 6 8 89 8, we get 7 si 0 0 8 8 7. x must be cotermial with 5 is 8. 6 6 5 4 or. Sice 0, the largest cotermial agle 6 6 8. The five least oegative eve itegers are 0,, 4, 6, ad 8. The four greatest odd egative itegers are 7, 5,, ad. The sum of these umbers is 0 4 6 8 5 7 0 6 4. 9. The sum of the reciprocals of the positive itegral factors is equal to the sum of the positive itegral factors divided by the umber itself. Sice 8 is a perfect umber, the sum of the positive itegral factors is twice 8, ad the sought sum is 56 (it does t take much to verify 8 this by writig out the positive itegral factors of 8, ad it turs out that the sum of the reciprocals of the positive itegral factors of ay perfect umbers is always ). 0. Let x be the legth of the side of the octago, as i the diagram. Cosiderig the octago as a square with four isosceles right triagles removed, the eclosed area of the x x octago is x 4 x. The square ecloses a area of x x x, so the sought ratio is. 4 csc cot csc cot csc cot, which is oe of the aswer choices.. 4 4 4 0.... Multiply this. Let S 5

Alpha Idividual Solutios MAΘ Natioal Covetio 0 equatio by 4 to get S 4.... Now, subtract this secod equatio from the first equatio to get 4 S 5 7 9.... Now multiply this equatio by 4 to get S 5 7..., ad subtract that from the previous 9 equatio to get Therefore, S 4. 6 4 8 7 6 4 S 6.... 9 7 9. 4 x x cos cos x x x x 6. Squarig both sides yields 9x x x x. However, the positive solutio does ot work because it gives a positive umber o the left side of the equatio just before squarig ad a egative umber o the right side. The egative umber does work, so x is the oly solutio. 4. six six cos x cos x cos x x cos x cos x x cos x, the cosie fuctio is eve ad thus yields 5. For x y (eve if you chose to go with cos x also). 4, usig the stadard coic sectio otatio, ab, ad sice the latus rectum has legth 6. i a, the sought legth is b. 4 4m cis45 cis45 m cis45 m 4 4 i cis00 cis700 m m m. To make this a iteger, we must have 0 m 4 ad m must be a multiple of 4 so that 45 m is cotermial with either 0 or 80. Thus, the valid values of m are 4, 8,, 6, 0, ad 4, ad their sum is 4 8 6 0 4 84. 7. Let x be the umber of ways to get to the th step. Clearly x 0 ad x x, but

Alpha Idividual Solutios MAΘ Natioal Covetio 0 also x xx x, so the sequece is 0,,,,,,, 4, 5, 7, 9,, 6,, 8, 7, 49, ad the 7th term is 49. 8. Let s be the sum of the th powers of the solutios of the equatio. Therefore, 0 s 0. Usig the method of Newto s sums, we have 0 s 0s s, ad fially, 0 s 0s s s 4.5. 9. Imagie the 8 8 grid i the plae, where the x-coordiate represets the time i hours after 0 pm whe Sydey arrives ad the y-coordiate represets the time i hours after 0 pm whe Everett arrives. By the give iformatio about the latest each could arrive at the rave, we reduce the possible area dow to the 4rectagle. If Everett arrives at am, the latest he could arrive, Sydey would have to arrive o earlier tha pm i order to have hours of overlap (this poit is represeted by the poit, ). If Sydey arrives at am, the latest she could arrive, Everett would have to arrive o earlier tha pm i order to have hours of overlap (this poit is represeted by the poit 4, ). From those poits, draw lie segmets with a slope of to the edge sice if each back their arrival time up the same amout from those times, they would still overlap for at least hours. The favorable area is betwee the lie segmets, ad that area is 4 7, ad the total possible area is 8, so the probability of their overlap lastig at least hours is 7 8. 0. Let d be the legth of a diagoal of the larger petago, ad let x be the legth of a side of the larger petago. The, by the Law of Cosies, d x x cos08 x cos08 cos08 4x 4x si 54 d xsi54 Let y be the legth of the part of a diagoal from a vertex of the smaller petago to oe of its closest vertices of the larger petago, ad drop a altitude from the vertex of the smaller petago to oe of the sides of the larger petago closest to it. 7.

Alpha Idividual Solutios MAΘ Natioal Covetio 0 x The cos6 x x x y y y cos6 si54. Therefore, the side legth of the smaller x si 54 cos 6 cos7 petago would be xsi54 x x x si54 si54 si54 si54 cos7 x, makig the ratio of the smaller petago s side legth to the larger petago s cos6 cos7 x cos6 cos7 side legth. Sice the larger petago s side legth is cos6, the legth x cos6 of the side of the smaller petago is cos7. Tiebreakers TB. 84 85 570 570 85 86... 84 85 84 740 69 0 69 740 TB. 5 04 5 (sice 0 ). m...... m m TB. 4 4 4 m m m m m m 0 8 8 m sice m 0, so we are lookig for the least 84 such that 8 8 is a perfect square. Settig this perfect square as p, we are tryig to solve the Pell Equatio k k p. I tryig to solve k ad settig p, fid the smallest solutio i positive itegers, which is kp. All solutios are foud recursively i the followig way:. The ext p is the sum of the previous k ad p.. The ext k is the sum of the previous k ad twice the previous p. 8

Alpha Idividual Solutios MAΘ Natioal Covetio 0 The table looks like this: k p k p (oly whe p is 0 7 5 7 odd) 4 9 4 99 70 9 69 84 577 408 9 985 49 It ca be show also that the ad will always alterate, so the ext value of will be 49. I fact, were the last colum to be cotiued, the umbers i the last colum would be the oly umbers that have the property defied i this questio. 9