Solutions of Benelux Mathematical Olympiad 2010

Size: px
Start display at page:

Download "Solutions of Benelux Mathematical Olympiad 2010"

Transcription

1 Solutions of Benelux Mathematical Olymiad 200 Problem. A finite set of integers is called bad if its elements add u to 200. A finite set of integers is a Benelux-set if none of its subsets is bad. Determine the smallest integer n such that the set {502, 503, 504,..., 2009} can be artitioned into n Benelux-sets. (A artition of a set S into n subsets is a collection of n airwise disjoint subsets of S, the union of which equals S.) Solution. As = 200, the set S = {502, 503,..., 2009} is not a Benelux-set, so n = does not work. We will rove that n = 2 does work, i.e. that S can be artitioned into 2 Benelux-sets. Define the following subsets of S: A = {502, 503,..., 670}, B = {67, 672,..., 005}, C = {006, 007,..., 339}, D = {340, 34,..., 508}, E = {509, 50,..., 2009}. We will show that A C E and B D are both Benelux-sets. Note that there does not exist a bad subset of S of one element, since that element would have to be 200. Also, there does not exist a bad subset of S of more than three elements, since the sum of four or more elements would be at least = 204 > 200. So any ossible bad subset of S contains two or three elements. Consider a bad subset of two elements a and b. As a, b 502 and a + b = 200, we have a, b = 508. Furthermore, exactly one of a and b is smaller than 005 and one is larger than 005. So one of them, say a, is an element of A B, and the other is an element of C D. Suose a A, then b = 340, so b D. On the other hand, suose a B, then b = 339, so b C. Hence {a, b} cannot be a subset of A C E, nor of B D. Now consider a bad subset of three elements a, b and c. As a, b, c 502, a + b + c = 200, and the three elements are airwise distinct, we have a, b, c = 005. So a, b, c A B. At least one of the elements, say a, is smaller than = 670, and at least one of the elements, say b, is larger than 670. So a A and b B. We conclude that {a, b, c} cannot be a subset of A C E, nor of B D. This roves that A C E and B D are Benelux-sets, and therefore the smallest n for which S can be artitioned into n Benelux-sets is n = 2. Remark. Observe that A C E and B D E 2 are also Benelux-sets, where {E, E 2 } is any artition of E.

2 Problem 2. Find all olynomials (x) with real coefficients such that (a + b 2c) + (b + c 2a) + (c + a 2b) = 3(a b) + 3(b c) + 3(c a) for all a, b, c R. Solution. For a = b = c, we have 3(0) = 9(0), hence (0) = 0. Now set b = c = 0, then we have (a) + ( 2a) + (a) = 3(a) + 3( a) for all a R. So we find a olynomial equation ( 2x) = (x) + 3( x). () Note that the zero olynomial is a solution to this equation. Now suose that is not the zero olynomial, and let n 0 be the degree of. Let a n 0 be the coefficient of x n in (x). At the left-hand side of (), the coefficient of x n is ( 2) n a n, while at the right-hand side the coefficient of x n is a n + 3 ( ) n a n. Hence ( 2) n = + 3 ( ) n. For n even, we find 2 n = 4, so n = 2, and for n odd, we find 2 n = 2, so n =. As we already know that (0) = 0, we must have (x) = a 2 x 2 + a x, where a and a 2 are real numbers (ossibly zero). The olynomial (x) = x is a solution to our roblem, as (a + b 2c) + (b + c 2a) + (c + a 2b) = 0 = 3(a b) + 3(b c) + 3(c a) for all a, b, c R. Also, (x) = x 2 is a solution, since (a + b 2c) 2 + (b + c 2a) 2 + (c + a 2b) 2 = 6(a 2 + b 2 + c 2 ) 6(ab + bc + ca) = 3(a b) 2 + 3(b c) 2 + 3(c a) 2 for all a, b, c R. Now note that if (x) is a solution to our roblem, then so is λ(x) for all λ R. Also, if (x) and q(x) are both solutions, then so is (x) + q(x). We conclude that for all real numbers a 2 and a the olynomial a 2 x 2 + a x is a solution. Since we have already shown that there can be no other solutions, these are the only solutions. Solution 2. For a = b = c, we have 3(0) = 9(0), hence (0) = 0. Now set b = c = 0, then we have (a) + ( 2a) + (a) = 3(a) + 3( a) for all a R. So we find a olynomial equation ( 2x) = (x) + 3( x). (2)

3 Define q(x) = (x) + ( x), then we find that q(2x) = (2x) + ( 2x) = (( x) + 3(x)) + ((x) + 3( x)) = 4q(x). (3) Note that the zero olynomial is a solution to this equation. Now suose that q is not the zero olynomial, and let m 0 be the degree of q. Let b m 0 be the coefficient of x m in q(x). At the left-hand side of (3), the coefficient of x m is 2 m b m, while at the right-hand side the coefficient of x m is 4b m. Hence m = 2. As q(x) = (x) + ( x), the olynomial q(x) does not contain any nonzero terms with odd exonent of x. Since also q(0) = 2(0) = 0, we conclude that q(x) = b 2 x 2, where b 2 is a real number (ossibly zero). From (2) we now deduce that (2x) = ( x) + 3(x) = 2(x) + q(x), so (2x) 2(x) = b 2 x 2. (4) Suose that that degree n of is greater than 2. Let a n 0 be the coefficient of x n in (x). At the left-hand side of (4), the coefficient of x n is (2 n 2) a n 0. But the coefficient of x n at the right-hand side vanishes, yielding a contradiction. So the degree of is at most 2. As we already know that (0) = 0, we must have (x) = a 2 x 2 + a x, where a and a 2 are real numbers (ossibly zero). We finally check that every olynomial of this form is indeed a solution (see solution ).

4 Problem 3. On a line l there are three different oints A, B and P in that order. Let a be the line through A erendicular to l, and let b be the line through B erendicular to l. A line through P, not coinciding with l, intersects a in Q and b in R. The line through A erendicular to BQ intersects BQ in L and BR in T. The line through B erendicular to AR intersects AR in K and AQ in S. (a) Prove that P, T, S are collinear. (b) Prove that P, K, L are collinear. Solution. (a) Since P, R and Q are collinear, we have P AQ P BR, hence AQ BR = AP BP. Conversely, P, T and S are collinear if it holds that AS BT = AP BP. So it suffices to rove BT BR = AS AQ. Since ABT = 90 = ALB and T AB = BAL, we have ABT ALB. And since ALB = 90 = QAB and LBA = ABQ, we have ALB QAB. Hence ABT QAB, so BT BA = AB AQ. Similarly, we have ABR AKB SAB, so Combining both results, we get BT BR which had to be roved. BR BA = AB AS. = BT / BA BR / BA = AB / AQ AB / AS = AS AQ,

5 (b) Let the line P K intersect BR in B and AQ in A and let the line P L intersect BR in B 2 and AQ in A 2. Consider the oints A, A and S on the line AQ, and the oints B, B and T on the line BR. As AQ BR and the three lines A B, AB and ST are concurrent (in P ), we have A A : AS = B B : BT, where all lengths are directed. Similarly, as A B, AR and SB are concurrent (in K), we have A A : AS = B R : RB. This gives so BB BT = RB RB = RB + BB RB BB = = + BB RB = BB BR, BT + BR Similary, using the lines A 2 B 2, AB and QR (concurrent in P ) and the lines A 2 B 2, AT and QB (concurrent in L), we find This gives so B 2 B : BR = A 2 A : AQ = B 2 T : T B. BB 2 BR = T B 2 T B = T B + BB 2 T B BB 2 =. = + BB 2 T B = BB 2 BT, + BR BT We conclude that B = B 2, which imlies that P, K and L are collinear.. Solution 2. (a) Define X as the intersection of AT and BS, and Y as the intersection of AR and BQ. To rove that P, S and T are collinear, we will use Menelaos theorem in ABX, so we have to rove AP BS XT P B SX T A =. Note that B is between P and A, X is between S and B, and X is between T and A, so it suffices to rove that AP BS XT P B SX T A =.

6 Because AQ and BR are arallel, we have AQP BRP, hence AP BP = QA RB. (5) Also, since ASB = KBR and BAS = 90 = BKR, we have ASB KBR, hence BS RB = AS AS, so BS = RB. (6) KB KB Similarly, we have AT B QAL, hence T A AQ T B T B =, so T A = AQ. (7) AL AL As ASX = ASB = 90 ABS = 90 ABK = KAB = Y AB, and SAX = 90 XAB = 90 LAB = ABL = ABY, we have SXA AY B, hence SX AY = AS AS, so SX = AY. (8) BA BA Similarly, we have BXT AY B, hence By combining (5) - (9), we find XT Y B = BT BT, so XT = Y B. (9) AB AB AP BS XT P B SX T A = QA RB AS KB RB BA AS AY BT AL Y B AB T B AQ = AL Y B KB AY. (0) Since Y LA = 90 = Y KB and AY L = BY K, we have AY L BY K, hence AL BK = AY BY, so AL BY =. () BK AY By combining (0) and (), we find as we wanted to rove. AP BS XT P B SX T A =, (b) Again, we will use Menelaos theorem in ABX, so we have to rove AP BK XL P B KX LA =.

7 Note that AP P B < 0, and BK KX < 0 if and only if XL LA AP BK XL P B KX LA =. < 0, so it suffices to rove that As BXL = AXK and BLX = 90 = AKX, we have BLX AKX, hence XL XK = BL AK. (2) Since ALB = 90 = QAB, we have ALB QAB, hence LA AQ = LB LB, so LA = AQ. (3) AB AB Similarly, we have AKB ABR, hence BK RB = AK AK, so BK = RB. (4) AB AB By combining (5) and (2) - (4), we find AP BK XL P B KX LA = QA RB BL AK AB LB AQ AK RB =, AB which is what we wanted to rove. Solution 3. As AKB = ALB = 90, the oints K and L belong to the circle with diameter AB. Since QAB = ABR = 90, the lines AQ and BR are tangents to this circle. Aly Pascal s theorem to the oints A, A, K, L, B and B, all on the same circle. This yields that the intersection Q of the tangent in A and the line BL, the intersection R of the tangent in B and the line AK, and the intersection of KL and AB are collinear. So KL asses through the intersection of AB and QR, which is oint P. Hence P, K and L are collinear. This roves art b. Now aly Pascal s theorem to the oints A, A, L, K, B and B. This yields that the intersection S of the tangent in A and the line BK, the intersection T of the tangent in B and the line AL, and the intersection P of KL and AB are collinear. This roves art a. Solution 4.

8 (a) W.l.o.g. we may assume that A = (0, 0) and B = (, 0) and the line through P is in the uer half lane, so l is the x-axis, a is the y-axis and b is the line x =. Take P = (, 0) ( > ) and Q = (0, q) (q > 0). Since P Q is given by x + y =, we find q R = (, q( ) ). Now AR is given by y = q( ) through B = (, 0), is given by y = x, hence BS, the line erendicular to AR and assing (x ). We find S = (0, q( ) q( ) ). Moreover BQ is given by y = q(x ), hence AT, the line erendicular to BQ and assing through A = (0, 0), is given by y = x. We find T = (, ). Since q q BT = /q = BP q( ) = AS, we conclude that P, T and S are collinear. AP (b) Point K is the intersection of AR and BS. Solving for x yields so q( ) x = (x ) q( ) ( ) q( ) + x = q( ) q( ) K = ( q( ) q( ) + q( ) x =, q( ) q( ) + q( ) q( ) + q( ) Point L is the oint of intersection of AT and BQ. Solving for x yields so x = q(x ) q ( ) q + q x = q x = q + q q ( ) q L = + q, + q. q q Let K 0 and L 0 be the rojections of K and L on the x-axis. We have to show that the following fractions are equal: ). K 0 K K 0 P = q( ) + q( ) q( ) q( ) + q( ) and L 0 L L 0 P = q +q q q +q

9 Working out cross roducts twice, this comes down to ( ) ( q? q( ) + + q = + q q( ) q( ) q q ( ) ( ) q + q q (? q( ) + q = + q q( ) + q( ) q( ) ) ) ( q + q q =? 2 q( ) + q( ) q( ) q + q q =? ( ) q( ) + q( ), q( ) q( ) + q( ) ) which is clearly true.

10 Problem 4. Find all quadrules (a, b,, n) of ositive integers, such that is a rime and a 3 + b 3 = n. Solution. Let (a, b,, n) be a solution. Note that we can write the given equation as (a + b)(a 2 ab + b 2 ) = n. As a and b are ositive integers, we have a+b 2, so a+b. Furthermore, a 2 ab+b 2 = (a b) 2 + ab, so either a = b = or a 2 ab + b 2 2. Assume that the latter is the case. Then is a divisor of both a+b and a 2 ab+b 2, hence also of (a+b) 2 (a 2 ab+b 2 ) = 3ab. This means that either is equal to 3 or is a divisor of ab. Since is a divisor of a + b, we have a b, hence either = 3, or a and b. If a and b, then we can write a = a, b = b with a and b ositive integers, and we have (a ) 3 + (b ) 3 = n 3, so (a, b,, n 3) then is another solution (note that (a ) 3 + (b ) 3 is a ositive integer greater than, so n 3 is ositive). Now assume that (a 0, b 0, 0, n 0 ) is a solution such that a. From the reasoning above it follows that either a 0 = b 0 =, or 0 = 3. After all, if we do not have a 0 = b 0 = and we have 0 3, then a. Also, given an arbitrary solution (a, b,, n), we can divide everything by reeatedly until there are no factors left in a. Suose a 0 = b 0 =. Then the solution is (,, 2, ). Suose 0 = 3. Assume that 3 2 (a 2 0 a 0 b 0 + b 2 0). As 3 2 (a 0 + b 0 ) 2, we then have 3 2 (a 0 + b 0 ) 2 (a 2 0 a 0 b 0 + b 2 0) = 3a 0 b 0, so 3 a 0 b 0. But 3 a 0 by assumtion, and 3 a 0 + b 0, so 3 b 0, which contradicts 3 a 0 b 0. We conclude that 3 2 (a 2 0 a 0 b 0 + b 2 0). As both a 0 + b 0 and a 2 0 a 0 b 0 + b 2 0 must be owers of 3, we have a 2 0 a 0 b 0 + b 2 0 = 3. Hence (a 0 b 0 ) 2 + a 0 b 0 = 3. We must have (a 0 b 0 ) 2 = 0 or (a 0 b 0 ) 2 =. The former does not give a solution; the latter gives a 0 = 2 and b 0 = or a 0 = and b 0 = 2. So all solutions with a are (,, 2, ), (2,, 3, 2) and (, 2, 3, 2). From the above it follows that all other solutions are of the form ( k 0a 0, k 0b 0, 0, n 0 + 3k), where (a 0, b 0, 0, n 0 ) is one of these three solutions. Hence we find three families of solutions: (2 k, 2 k, 2, 3k + ) with k Z 0, (2 3 k, 3 k, 3, 3k + 2) with k Z 0, (3 k, 2 3 k, 3, 3k + 2) with k Z 0. It is easy to check that all these quadrules are indeed solutions. Solution 2. Let (a, b,, n) be a solution. Note that we can write the given equation as (a + b)(a 2 ab + b 2 ) = n.

11 As a and b are ositive integers, we have a + b 2 and a 2 ab + b 2 = (a b) 2 + ab. So both factors are ositive and therefore must be owers of. Let k be an integer with k n such that a + b = k. Then a 2 ab + b 2 = n k. If we substitute b = k a, we find n k = (a + b) 2 3ab = 2k 3a( k a). We can rewrite this as: 3a 2 3 k a + 2k n k = 0, from which we see that a is a solution of the following quadratic equation in x: The discriminant of (5) is 3x 2 3 k x + 2k n k = 0. (5) D = ( 3 k ) ( 2k n k ) = 3 (4 n k 2k ) = 3 n k (4 3k n ). As n k = (a + b) 2 3ab < (a + b) 2 = 2k, we have n k < 2k, so 3k n > 0. Since a is a solution of (5), the discriminant must be nonnegative. Hence 4 3k n 0. If = 2, this imlies 3k n = or 3k n = 2; if = 3, this imlies 3k n = ; and if > 3, then 5 so 4 3k n can never be true. Suose = 2 and 3k n =. Then D = 3 2 2k (4 2) = 3 2 2k. But this is a not a square, so the solutions of (5) will not be integers, which yields a contradiction. Suose = 2 and 3k n = 2. Then D = 3 2 2k 2 (4 4) = 0, so the only solution of (5) is x = 3 2k = 2 3 2k. Therefore a = 2 k and b = 2 k a = 2 k, and this gives a solution for all k, namely (2 k, 2 k, 2, 3k 2). Suose = 3 and 3k n =. Then D = 3 3 2k (4 3) = 3 2k, so the solutions of (5) are x = 3k+ ±3 k = (3k ± 3 k ). Therefore a = 2 3 k or a = 3 k. For all k we find the solutions (2 3 k, 3 k, 3, 3k ) and (3 k, 2 3 k, 3, 3k ). We conclude that there are three families of solutions: (2 k, 2 k, 2, 3k 2) with k Z, (2 3 k, 3 k, 3, 3k ) with k Z, (3 k, 2 3 k, 3, 3k ) with k Z. It is easy to check that all these quadrules are indeed solutions.

19th Bay Area Mathematical Olympiad. Problems and Solutions. February 28, 2017

19th Bay Area Mathematical Olympiad. Problems and Solutions. February 28, 2017 th Bay Area Mathematical Olymiad February, 07 Problems and Solutions BAMO- and BAMO- are each 5-question essay-roof exams, for middle- and high-school students, resectively. The roblems in each exam are

More information

Math 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2,

Math 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2, MATH 4400 roblems. Math 4400/6400 Homework # solutions 1. Let P be an odd integer not necessarily rime. Show that modulo, { P 1 0 if P 1, 7 mod, 1 if P 3, mod. Proof. Suose that P 1 mod. Then we can write

More information

Pythagorean triples and sums of squares

Pythagorean triples and sums of squares Pythagorean triles and sums of squares Robin Chaman 16 January 2004 1 Pythagorean triles A Pythagorean trile (x, y, z) is a trile of ositive integers satisfying z 2 + y 2 = z 2. If g = gcd(x, y, z) then

More information

Arithmetic Consequences of Jacobi s Two-Squares Theorem

Arithmetic Consequences of Jacobi s Two-Squares Theorem THE RAMANUJAN JOURNAL 4, 51 57, 2000 c 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. Arithmetic Consequences of Jacobi s Two-Squares Theorem MICHAEL D. HIRSCHHORN School of Mathematics,

More information

p-adic Measures and Bernoulli Numbers

p-adic Measures and Bernoulli Numbers -Adic Measures and Bernoulli Numbers Adam Bowers Introduction The constants B k in the Taylor series exansion t e t = t k B k k! k=0 are known as the Bernoulli numbers. The first few are,, 6, 0, 30, 0,

More information

By Evan Chen OTIS, Internal Use

By Evan Chen OTIS, Internal Use Solutions Notes for DNY-NTCONSTRUCT Evan Chen January 17, 018 1 Solution Notes to TSTST 015/5 Let ϕ(n) denote the number of ositive integers less than n that are relatively rime to n. Prove that there

More information

MATH 3240Q Introduction to Number Theory Homework 7

MATH 3240Q Introduction to Number Theory Homework 7 As long as algebra and geometry have been searated, their rogress have been slow and their uses limited; but when these two sciences have been united, they have lent each mutual forces, and have marched

More information

Baltic Way 2008 Gdańsk, November 8, 2008

Baltic Way 2008 Gdańsk, November 8, 2008 Baltic Way 008 Gdańsk, November 8, 008 Problems and solutions Problem 1. Determine all polynomials p(x) with real coefficients such that p((x + 1) ) = (p(x) + 1) and p(0) = 0. Answer: p(x) = x. Solution:

More information

7. The olynomial P (x) =x, 9x 4 +9x, 4x +4x, 4 can be written in the form P (x) =(x, ) n Q(x), where n is a ositive integer and Q(x) is not divisible

7. The olynomial P (x) =x, 9x 4 +9x, 4x +4x, 4 can be written in the form P (x) =(x, ) n Q(x), where n is a ositive integer and Q(x) is not divisible . Which of the following intervals contains all of the real zeros of the function g(t) =t, t + t? (a) (,; ) (b) ( ; ) (c) (,; ) (d) (; ) (e) (,; ) 4 4. The exression ((a), + b), is equivalent to which

More information

NUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:

NUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z: NUMBER SYSTEMS Number theory is the study of the integers. We denote the set of integers by Z: Z = {..., 3, 2, 1, 0, 1, 2, 3,... }. The integers have two oerations defined on them, addition and multilication,

More information

DISCRIMINANTS IN TOWERS

DISCRIMINANTS IN TOWERS DISCRIMINANTS IN TOWERS JOSEPH RABINOFF Let A be a Dedekind domain with fraction field F, let K/F be a finite searable extension field, and let B be the integral closure of A in K. In this note, we will

More information

SOME SUMS OVER IRREDUCIBLE POLYNOMIALS

SOME SUMS OVER IRREDUCIBLE POLYNOMIALS SOME SUMS OVER IRREDUCIBLE POLYNOMIALS DAVID E SPEYER Abstract We rove a number of conjectures due to Dinesh Thakur concerning sums of the form P hp ) where the sum is over monic irreducible olynomials

More information

Excerpt from "Intermediate Algebra" 2014 AoPS Inc.

Excerpt from Intermediate Algebra 2014 AoPS Inc. Ecert from "Intermediate Algebra" 04 AoPS Inc. www.artofroblemsolving.com for which our grah is below the -ais with the oints where the grah intersects the -ais (because the ineuality is nonstrict), we

More information

Mersenne and Fermat Numbers

Mersenne and Fermat Numbers NUMBER THEORY CHARLES LEYTEM Mersenne and Fermat Numbers CONTENTS 1. The Little Fermat theorem 2 2. Mersenne numbers 2 3. Fermat numbers 4 4. An IMO roblem 5 1 2 CHARLES LEYTEM 1. THE LITTLE FERMAT THEOREM

More information

HOMEWORK # 4 MARIA SIMBIRSKY SANDY ROGERS MATTHEW WELSH

HOMEWORK # 4 MARIA SIMBIRSKY SANDY ROGERS MATTHEW WELSH HOMEWORK # 4 MARIA SIMBIRSKY SANDY ROGERS MATTHEW WELSH 1. Section 2.1, Problems 5, 8, 28, and 48 Problem. 2.1.5 Write a single congruence that is equivalent to the air of congruences x 1 mod 4 and x 2

More information

Practice Final Solutions

Practice Final Solutions Practice Final Solutions 1. True or false: (a) If a is a sum of three squares, and b is a sum of three squares, then so is ab. False: Consider a 14, b 2. (b) No number of the form 4 m (8n + 7) can be written

More information

MATH 6210: SOLUTIONS TO PROBLEM SET #3

MATH 6210: SOLUTIONS TO PROBLEM SET #3 MATH 6210: SOLUTIONS TO PROBLEM SET #3 Rudin, Chater 4, Problem #3. The sace L (T) is searable since the trigonometric olynomials with comlex coefficients whose real and imaginary arts are rational form

More information

Practice Final Solutions

Practice Final Solutions Practice Final Solutions 1. Find integers x and y such that 13x + 1y 1 SOLUTION: By the Euclidean algorithm: One can work backwards to obtain 1 1 13 + 2 13 6 2 + 1 1 13 6 2 13 6 (1 1 13) 7 13 6 1 Hence

More information

t s (p). An Introduction

t s (p). An Introduction Notes 6. Quadratic Gauss Sums Definition. Let a, b Z. Then we denote a b if a divides b. Definition. Let a and b be elements of Z. Then c Z s.t. a, b c, where c gcda, b max{x Z x a and x b }. 5, Chater1

More information

Complex Analysis Homework 1

Complex Analysis Homework 1 Comlex Analysis Homework 1 Steve Clanton Sarah Crimi January 27, 2009 Problem Claim. If two integers can be exressed as the sum of two squares, then so can their roduct. Proof. Call the two squares that

More information

f(r) = a d n) d + + a0 = 0

f(r) = a d n) d + + a0 = 0 Math 400-00/Foundations of Algebra/Fall 07 Polynomials at the Foundations: Roots Next, we turn to the notion of a root of a olynomial in Q[x]. Definition 8.. r Q is a rational root of fx) Q[x] if fr) 0.

More information

x 2 a mod m. has a solution. Theorem 13.2 (Euler s Criterion). Let p be an odd prime. The congruence x 2 1 mod p,

x 2 a mod m. has a solution. Theorem 13.2 (Euler s Criterion). Let p be an odd prime. The congruence x 2 1 mod p, 13. Quadratic Residues We now turn to the question of when a quadratic equation has a solution modulo m. The general quadratic equation looks like ax + bx + c 0 mod m. Assuming that m is odd or that b

More information

MA3H1 TOPICS IN NUMBER THEORY PART III

MA3H1 TOPICS IN NUMBER THEORY PART III MA3H1 TOPICS IN NUMBER THEORY PART III SAMIR SIKSEK 1. Congruences Modulo m In quadratic recirocity we studied congruences of the form x 2 a (mod ). We now turn our attention to situations where is relaced

More information

DIRICHLET S THEOREM ON PRIMES IN ARITHMETIC PROGRESSIONS. 1. Introduction

DIRICHLET S THEOREM ON PRIMES IN ARITHMETIC PROGRESSIONS. 1. Introduction DIRICHLET S THEOREM ON PRIMES IN ARITHMETIC PROGRESSIONS INNA ZAKHAREVICH. Introduction It is a well-known fact that there are infinitely many rimes. However, it is less clear how the rimes are distributed

More information

Introduction to Arithmetic Geometry Fall 2013 Lecture #10 10/8/2013

Introduction to Arithmetic Geometry Fall 2013 Lecture #10 10/8/2013 18.782 Introduction to Arithmetic Geometry Fall 2013 Lecture #10 10/8/2013 In this lecture we lay the groundwork needed to rove the Hasse-Minkowski theorem for Q, which states that a quadratic form over

More information

SMT Power Round Solutions : Poles and Polars

SMT Power Round Solutions : Poles and Polars SMT Power Round Solutions : Poles and Polars February 18, 011 1 Definition and Basic Properties 1 Note that the unit circles are not necessary in the solutions. They just make the graphs look nicer. (1).0

More information

MATH 361: NUMBER THEORY EIGHTH LECTURE

MATH 361: NUMBER THEORY EIGHTH LECTURE MATH 361: NUMBER THEORY EIGHTH LECTURE 1. Quadratic Recirocity: Introduction Quadratic recirocity is the first result of modern number theory. Lagrange conjectured it in the late 1700 s, but it was first

More information

Strong Matching of Points with Geometric Shapes

Strong Matching of Points with Geometric Shapes Strong Matching of Points with Geometric Shaes Ahmad Biniaz Anil Maheshwari Michiel Smid School of Comuter Science, Carleton University, Ottawa, Canada December 9, 05 In memory of Ferran Hurtado. Abstract

More information

P -PARTITIONS AND RELATED POLYNOMIALS

P -PARTITIONS AND RELATED POLYNOMIALS P -PARTITIONS AND RELATED POLYNOMIALS 1. P -artitions A labelled oset is a oset P whose ground set is a subset of the integers, see Fig. 1. We will denote by < the usual order on the integers and < P the

More information

XX Asian Pacific Mathematics Olympiad

XX Asian Pacific Mathematics Olympiad XX Asian Pacific Mathematics Olympiad March, 008 Problem 1. Let ABC be a triangle with A < 60. Let X and Y be the points on the sides AB and AC, respectively, such that CA + AX = CB + BX and BA + AY =

More information

Math 751 Lecture Notes Week 3

Math 751 Lecture Notes Week 3 Math 751 Lecture Notes Week 3 Setember 25, 2014 1 Fundamental grou of a circle Theorem 1. Let φ : Z π 1 (S 1 ) be given by n [ω n ], where ω n : I S 1 R 2 is the loo ω n (s) = (cos(2πns), sin(2πns)). Then

More information

The Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001

The Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001 The Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001 The Hasse-Minkowski Theorem rovides a characterization of the rational quadratic forms. What follows is a roof of the Hasse-Minkowski

More information

CHAPTER 2: SMOOTH MAPS. 1. Introduction In this chapter we introduce smooth maps between manifolds, and some important

CHAPTER 2: SMOOTH MAPS. 1. Introduction In this chapter we introduce smooth maps between manifolds, and some important CHAPTER 2: SMOOTH MAPS DAVID GLICKENSTEIN 1. Introduction In this chater we introduce smooth mas between manifolds, and some imortant concets. De nition 1. A function f : M! R k is a smooth function if

More information

Primes - Problem Sheet 5 - Solutions

Primes - Problem Sheet 5 - Solutions Primes - Problem Sheet 5 - Solutions Class number, and reduction of quadratic forms Positive-definite Q1) Aly the roof of Theorem 5.5 to find reduced forms equivalent to the following, also give matrices

More information

MAT 311 Solutions to Final Exam Practice

MAT 311 Solutions to Final Exam Practice MAT 311 Solutions to Final Exam Practice Remark. If you are comfortable with all of the following roblems, you will be very well reared for the midterm. Some of the roblems below are more difficult than

More information

Math 104B: Number Theory II (Winter 2012)

Math 104B: Number Theory II (Winter 2012) Math 104B: Number Theory II (Winter 01) Alina Bucur Contents 1 Review 11 Prime numbers 1 Euclidean algorithm 13 Multilicative functions 14 Linear diohantine equations 3 15 Congruences 3 Primes as sums

More information

MATH 2710: NOTES FOR ANALYSIS

MATH 2710: NOTES FOR ANALYSIS MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite

More information

Why Proofs? Proof Techniques. Theorems. Other True Things. Proper Proof Technique. How To Construct A Proof. By Chuck Cusack

Why Proofs? Proof Techniques. Theorems. Other True Things. Proper Proof Technique. How To Construct A Proof. By Chuck Cusack Proof Techniques By Chuck Cusack Why Proofs? Writing roofs is not most student s favorite activity. To make matters worse, most students do not understand why it is imortant to rove things. Here are just

More information

QUADRATIC RECIPROCITY

QUADRATIC RECIPROCITY QUADRATIC RECIPROCITY JORDAN SCHETTLER Abstract. The goals of this roject are to have the reader(s) gain an areciation for the usefulness of Legendre symbols and ultimately recreate Eisenstein s slick

More information

QUADRATIC RECIPROCITY

QUADRATIC RECIPROCITY QUADRATIC RECIPROCITY JORDAN SCHETTLER Abstract. The goals of this roject are to have the reader(s) gain an areciation for the usefulness of Legendre symbols and ultimately recreate Eisenstein s slick

More information

IMO Training Camp Mock Olympiad #2 Solutions

IMO Training Camp Mock Olympiad #2 Solutions IMO Training Camp Mock Olympiad #2 Solutions July 3, 2008 1. Given an isosceles triangle ABC with AB = AC. The midpoint of side BC is denoted by M. Let X be a variable point on the shorter arc MA of the

More information

The Euler Phi Function

The Euler Phi Function The Euler Phi Function 7-3-2006 An arithmetic function takes ositive integers as inuts and roduces real or comlex numbers as oututs. If f is an arithmetic function, the divisor sum Dfn) is the sum of the

More information

Engineering Mathematics (E35 317) Exam 3 November 7, 2007

Engineering Mathematics (E35 317) Exam 3 November 7, 2007 Engineering Mathematics (E35 317) Exam 3 November 7, 2007 This exam contains four multile-choice roblems worth two oints each, twelve true-false roblems worth one oint each, and four free-resonse roblems

More information

However another possibility is

However another possibility is 19. Special Domains Let R be an integral domain. Recall that an element a 0, of R is said to be prime, if the corresponding principal ideal p is prime and a is not a unit. Definition 19.1. Let a and b

More information

Small Zeros of Quadratic Forms Mod P m

Small Zeros of Quadratic Forms Mod P m International Mathematical Forum, Vol. 8, 2013, no. 8, 357-367 Small Zeros of Quadratic Forms Mod P m Ali H. Hakami Deartment of Mathematics, Faculty of Science, Jazan University P.O. Box 277, Jazan, Postal

More information

Chapter 3 Basic Number Theory

Chapter 3 Basic Number Theory Chapter 3 Basic Number Theory What is Number Theory? Well... What is Number Theory? Well... Number Theory The study of the natural numbers (Z + ), especially the relationship between different sorts of

More information

Combinatorics of topmost discs of multi-peg Tower of Hanoi problem

Combinatorics of topmost discs of multi-peg Tower of Hanoi problem Combinatorics of tomost discs of multi-eg Tower of Hanoi roblem Sandi Klavžar Deartment of Mathematics, PEF, Unversity of Maribor Koroška cesta 160, 000 Maribor, Slovenia Uroš Milutinović Deartment of

More information

6 Binary Quadratic forms

6 Binary Quadratic forms 6 Binary Quadratic forms 6.1 Fermat-Euler Theorem A binary quadratic form is an exression of the form f(x,y) = ax 2 +bxy +cy 2 where a,b,c Z. Reresentation of an integer by a binary quadratic form has

More information

IMO Training Camp Mock Olympiad #2

IMO Training Camp Mock Olympiad #2 IMO Training Camp Mock Olympiad #2 July 3, 2008 1. Given an isosceles triangle ABC with AB = AC. The midpoint of side BC is denoted by M. Let X be a variable point on the shorter arc MA of the circumcircle

More information

jf 00 (x)j ds (x) = [1 + (f 0 (x)) 2 ] 3=2 (t) = jjr0 (t) r 00 (t)jj jjr 0 (t)jj 3

jf 00 (x)j ds (x) = [1 + (f 0 (x)) 2 ] 3=2 (t) = jjr0 (t) r 00 (t)jj jjr 0 (t)jj 3 M73Q Multivariable Calculus Fall 7 Review Problems for Exam The formulas in the box will be rovided on the exam. (s) dt jf (x)j ds (x) [ + (f (x)) ] 3 (t) jjt (t)jj jjr (t)jj (t) jjr (t) r (t)jj jjr (t)jj

More information

GAUSSIAN INTEGERS HUNG HO

GAUSSIAN INTEGERS HUNG HO GAUSSIAN INTEGERS HUNG HO Abstract. We will investigate the ring of Gaussian integers Z[i] = {a + bi a, b Z}. First we will show that this ring shares an imortant roerty with the ring of integers: every

More information

Coding Theory ( Mathematical Background I)

Coding Theory ( Mathematical Background I) N.L.Manev, Lectures on Coding Theory (Maths I) p. 1/18 Coding Theory ( Mathematical Background I) Lector: Nikolai L. Manev Institute of Mathematics and Informatics, Sofia, Bulgaria N.L.Manev, Lectures

More information

PRIME NUMBERS YANKI LEKILI

PRIME NUMBERS YANKI LEKILI PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers:,2,..., These are constructed using Peano axioms. We will not get into the hilosohical questions related to this and simly assume the

More information

[Ch 3, 4] Logic and Proofs (2) 1. Valid and Invalid Arguments ( 2.3, 3.4) 400 lecture note #2. 1) Basics

[Ch 3, 4] Logic and Proofs (2) 1. Valid and Invalid Arguments ( 2.3, 3.4) 400 lecture note #2. 1) Basics 400 lecture note #2 [Ch 3, 4] Logic and Proofs (2) 1. Valid and Invalid Arguments ( 2.3, 3.4) 1) Basics An argument is a sequence of statements ( s1, s2,, sn). All statements in an argument, excet for

More information

12 th Annual Johns Hopkins Math Tournament Saturday, February 19, 2011 Power Round-Poles and Polars

12 th Annual Johns Hopkins Math Tournament Saturday, February 19, 2011 Power Round-Poles and Polars 1 th Annual Johns Hopkins Math Tournaent Saturday, February 19, 011 Power Round-Poles and Polars 1. Definition and Basic Properties 1. Note that the unit circles are not necessary in the solutions. They

More information

On the Multiplicative Order of a n Modulo n

On the Multiplicative Order of a n Modulo n 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 13 2010), Article 10.2.1 On the Multilicative Order of a n Modulo n Jonathan Chaelo Université Lille Nord de France F-59000 Lille France jonathan.chaelon@lma.univ-littoral.fr

More information

When do Fibonacci invertible classes modulo M form a subgroup?

When do Fibonacci invertible classes modulo M form a subgroup? Calhoun: The NPS Institutional Archive DSace Reository Faculty and Researchers Faculty and Researchers Collection 2013 When do Fibonacci invertible classes modulo M form a subgrou? Luca, Florian Annales

More information

An Estimate For Heilbronn s Exponential Sum

An Estimate For Heilbronn s Exponential Sum An Estimate For Heilbronn s Exonential Sum D.R. Heath-Brown Magdalen College, Oxford For Heini Halberstam, on his retirement Let be a rime, and set e(x) = ex(2πix). Heilbronn s exonential sum is defined

More information

MATH342 Practice Exam

MATH342 Practice Exam MATH342 Practice Exam This exam is intended to be in a similar style to the examination in May/June 2012. It is not imlied that all questions on the real examination will follow the content of the ractice

More information

1 Integers and the Euclidean algorithm

1 Integers and the Euclidean algorithm 1 1 Integers and the Euclidean algorithm Exercise 1.1 Prove, n N : induction on n) 1 3 + 2 3 + + n 3 = (1 + 2 + + n) 2 (use Exercise 1.2 Prove, 2 n 1 is rime n is rime. (The converse is not true, as shown

More information

HENSEL S LEMMA KEITH CONRAD

HENSEL S LEMMA KEITH CONRAD HENSEL S LEMMA KEITH CONRAD 1. Introduction In the -adic integers, congruences are aroximations: for a and b in Z, a b mod n is the same as a b 1/ n. Turning information modulo one ower of into similar

More information

International Mathematical Olympiad. Preliminary Selection Contest 2017 Hong Kong. Outline of Solutions 5. 3*

International Mathematical Olympiad. Preliminary Selection Contest 2017 Hong Kong. Outline of Solutions 5. 3* International Mathematical Olympiad Preliminary Selection Contest Hong Kong Outline of Solutions Answers: 06 0000 * 6 97 7 6 8 7007 9 6 0 6 8 77 66 7 7 0 6 7 7 6 8 9 8 0 0 8 *See the remar after the solution

More information

On Character Sums of Binary Quadratic Forms 1 2. Mei-Chu Chang 3. Abstract. We establish character sum bounds of the form.

On Character Sums of Binary Quadratic Forms 1 2. Mei-Chu Chang 3. Abstract. We establish character sum bounds of the form. On Character Sums of Binary Quadratic Forms 2 Mei-Chu Chang 3 Abstract. We establish character sum bounds of the form χ(x 2 + ky 2 ) < τ H 2, a x a+h b y b+h where χ is a nontrivial character (mod ), 4

More information

Intrinsic Approximation on Cantor-like Sets, a Problem of Mahler

Intrinsic Approximation on Cantor-like Sets, a Problem of Mahler Intrinsic Aroximation on Cantor-like Sets, a Problem of Mahler Ryan Broderick, Lior Fishman, Asaf Reich and Barak Weiss July 200 Abstract In 984, Kurt Mahler osed the following fundamental question: How

More information

Representing Integers as the Sum of Two Squares in the Ring Z n

Representing Integers as the Sum of Two Squares in the Ring Z n 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 17 (2014), Article 14.7.4 Reresenting Integers as the Sum of Two Squares in the Ring Z n Joshua Harrington, Lenny Jones, and Alicia Lamarche Deartment

More information

#A47 INTEGERS 15 (2015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS

#A47 INTEGERS 15 (2015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS #A47 INTEGERS 15 (015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS Mihai Ciu Simion Stoilow Institute of Mathematics of the Romanian Academy, Research Unit No. 5,

More information

We collect some results that might be covered in a first course in algebraic number theory.

We collect some results that might be covered in a first course in algebraic number theory. 1 Aendices We collect some results that might be covered in a first course in algebraic number theory. A. uadratic Recirocity Via Gauss Sums A1. Introduction In this aendix, is an odd rime unless otherwise

More information

ON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS

ON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS #A13 INTEGERS 14 (014) ON THE LEAST SIGNIFICANT ADIC DIGITS OF CERTAIN LUCAS NUMBERS Tamás Lengyel Deartment of Mathematics, Occidental College, Los Angeles, California lengyel@oxy.edu Received: 6/13/13,

More information

#A37 INTEGERS 15 (2015) NOTE ON A RESULT OF CHUNG ON WEIL TYPE SUMS

#A37 INTEGERS 15 (2015) NOTE ON A RESULT OF CHUNG ON WEIL TYPE SUMS #A37 INTEGERS 15 (2015) NOTE ON A RESULT OF CHUNG ON WEIL TYPE SUMS Norbert Hegyvári ELTE TTK, Eötvös University, Institute of Mathematics, Budaest, Hungary hegyvari@elte.hu François Hennecart Université

More information

where x i is the ith coordinate of x R N. 1. Show that the following upper bound holds for the growth function of H:

where x i is the ith coordinate of x R N. 1. Show that the following upper bound holds for the growth function of H: Mehryar Mohri Foundations of Machine Learning Courant Institute of Mathematical Sciences Homework assignment 2 October 25, 2017 Due: November 08, 2017 A. Growth function Growth function of stum functions.

More information

Legendre polynomials and Jacobsthal sums

Legendre polynomials and Jacobsthal sums Legendre olynomials and Jacobsthal sums Zhi-Hong Sun( Huaiyin Normal University( htt://www.hytc.edu.cn/xsjl/szh Notation: Z the set of integers, N the set of ositive integers, [x] the greatest integer

More information

DIRICHLET S THEOREM ABOUT PRIMES IN ARITHMETIC PROGRESSIONS. Contents. 1. Dirichlet s theorem on arithmetic progressions

DIRICHLET S THEOREM ABOUT PRIMES IN ARITHMETIC PROGRESSIONS. Contents. 1. Dirichlet s theorem on arithmetic progressions DIRICHLET S THEOREM ABOUT PRIMES IN ARITHMETIC PROGRESSIONS ANG LI Abstract. Dirichlet s theorem states that if q and l are two relatively rime ositive integers, there are infinitely many rimes of the

More information

2 Asymptotic density and Dirichlet density

2 Asymptotic density and Dirichlet density 8.785: Analytic Number Theory, MIT, sring 2007 (K.S. Kedlaya) Primes in arithmetic rogressions In this unit, we first rove Dirichlet s theorem on rimes in arithmetic rogressions. We then rove the rime

More information

Section 1 (closed-book) Total points 30

Section 1 (closed-book) Total points 30 CS 454 Theory of Computation Fall 2011 Section 1 (closed-book) Total points 30 1. Which of the following are true? (a) a PDA can always be converted to an equivalent PDA that at each step pops or pushes

More information

2013 Bored of Studies Trial Examinations. Mathematics SOLUTIONS

2013 Bored of Studies Trial Examinations. Mathematics SOLUTIONS 03 Bored of Studies Trial Examinations Mathematics SOLUTIONS Section I. B 3. B 5. A 7. B 9. C. D 4. B 6. A 8. D 0. C Working/Justification Question We can eliminate (A) and (C), since they are not to 4

More information

2 Asymptotic density and Dirichlet density

2 Asymptotic density and Dirichlet density 8.785: Analytic Number Theory, MIT, sring 2007 (K.S. Kedlaya) Primes in arithmetic rogressions In this unit, we first rove Dirichlet s theorem on rimes in arithmetic rogressions. We then rove the rime

More information

D i v i s i b i l i t y

D i v i s i b i l i t y a D i v i s i b i l i t y statement which asserts that all numbers possess a certain property cannot be proved in this manner. The assertion, "Every prime number of the form An + 1 is a sum of two squares,"

More information

Almost All Palindromes Are Composite

Almost All Palindromes Are Composite Almost All Palindromes Are Comosite William D Banks Det of Mathematics, University of Missouri Columbia, MO 65211, USA bbanks@mathmissouriedu Derrick N Hart Det of Mathematics, University of Missouri Columbia,

More information

2008 Euclid Contest. Solutions. Canadian Mathematics Competition. Tuesday, April 15, c 2008 Centre for Education in Mathematics and Computing

2008 Euclid Contest. Solutions. Canadian Mathematics Competition. Tuesday, April 15, c 2008 Centre for Education in Mathematics and Computing Canadian Mathematics Competition An activity of the Centre for Education in Mathematics and Computing, University of Waterloo, Waterloo, Ontario 008 Euclid Contest Tuesday, April 5, 008 Solutions c 008

More information

Eighth Homework Solutions

Eighth Homework Solutions Math 4124 Wednesday, April 20 Eighth Homework Solutions 1. Exercise 5.2.1(e). Determine the number of nonisomorphic abelian groups of order 2704. First we write 2704 as a product of prime powers, namely

More information

CERIAS Tech Report The period of the Bell numbers modulo a prime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education

CERIAS Tech Report The period of the Bell numbers modulo a prime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education CERIAS Tech Reort 2010-01 The eriod of the Bell numbers modulo a rime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education and Research Information Assurance and Security Purdue University,

More information

#A8 INTEGERS 12 (2012) PARTITION OF AN INTEGER INTO DISTINCT BOUNDED PARTS, IDENTITIES AND BOUNDS

#A8 INTEGERS 12 (2012) PARTITION OF AN INTEGER INTO DISTINCT BOUNDED PARTS, IDENTITIES AND BOUNDS #A8 INTEGERS 1 (01) PARTITION OF AN INTEGER INTO DISTINCT BOUNDED PARTS, IDENTITIES AND BOUNDS Mohammadreza Bidar 1 Deartment of Mathematics, Sharif University of Technology, Tehran, Iran mrebidar@gmailcom

More information

Number Theory Naoki Sato

Number Theory Naoki Sato Number Theory Naoki Sato 0 Preface This set of notes on number theory was originally written in 1995 for students at the IMO level. It covers the basic background material that an IMO

More information

Selected Math 553 Homework Solutions

Selected Math 553 Homework Solutions Selected Math 553 Homework Solutions HW6, 1. Let α and β be rational numbers, with α 1/2, and let m > 0 be an integer such that α 2 mβ 2 = 1 δ where 0 δ < 1. Set ǫ:= 1 if α 0 and 1 if α < 0. Show that

More information

36th United States of America Mathematical Olympiad

36th United States of America Mathematical Olympiad 36th United States of America Mathematical Olympiad 1. Let n be a positive integer. Define a sequence by setting a 1 = n and, for each k > 1, letting a k be the unique integer in the range 0 a k k 1 for

More information

34 th United States of America Mathematical Olympiad

34 th United States of America Mathematical Olympiad 34 th United States of America Mathematical Olympiad 1. Determine all composite positive integers n for which it is possible to arrange all divisors of n that are greater than 1 in a circle so that no

More information

. As the binomial coefficients are integers we have that. 2 n(n 1).

. As the binomial coefficients are integers we have that. 2 n(n 1). Math 580 Homework. 1. Divisibility. Definition 1. Let a, b be integers with a 0. Then b divides b iff there is an integer k such that b = ka. In the case we write a b. In this case we also say a is a factor

More information

MATH 210A, FALL 2017 HW 5 SOLUTIONS WRITTEN BY DAN DORE

MATH 210A, FALL 2017 HW 5 SOLUTIONS WRITTEN BY DAN DORE MATH 20A, FALL 207 HW 5 SOLUTIONS WRITTEN BY DAN DORE (If you find any errors, lease email ddore@stanford.edu) Question. Let R = Z[t]/(t 2 ). Regard Z as an R-module by letting t act by the identity. Comute

More information

Two applications of the theorem of Carnot

Two applications of the theorem of Carnot Annales Mathematicae et Informaticae 40 (2012) pp. 135 144 http://ami.ektf.hu Two applications of the theorem of Carnot Zoltán Szilasi Institute of Mathematics, MTA-DE Research Group Equations, Functions

More information

Factorability in the ring Z[ 5]

Factorability in the ring Z[ 5] University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln Dissertations, Theses, and Student Research Paers in Mathematics Mathematics, Deartment of 4-2004 Factorability in the ring

More information

SOUTH AFRICAN TERTIARY MATHEMATICS OLYMPIAD

SOUTH AFRICAN TERTIARY MATHEMATICS OLYMPIAD SOUTH AFRICAN TERTIARY MATHEMATICS OLYMPIAD. Determine the following value: 7 August 6 Solutions π + π. Solution: Since π

More information

Factorizations Of Functions In H p (T n ) Takahiko Nakazi

Factorizations Of Functions In H p (T n ) Takahiko Nakazi Factorizations Of Functions In H (T n ) By Takahiko Nakazi * This research was artially suorted by Grant-in-Aid for Scientific Research, Ministry of Education of Jaan 2000 Mathematics Subject Classification

More information

2. A die is rolled 3 times, the probability of getting a number larger than the previous number each time is

2. A die is rolled 3 times, the probability of getting a number larger than the previous number each time is . If P(A) = x, P = 2x, P(A B) = 2, P ( A B) = 2 3, then the value of x is (A) 5 8 5 36 6 36 36 2. A die is rolled 3 times, the probability of getting a number larger than the previous number each time

More information

THE ERDÖS - MORDELL THEOREM IN THE EXTERIOR DOMAIN

THE ERDÖS - MORDELL THEOREM IN THE EXTERIOR DOMAIN INTERNATIONAL JOURNAL OF GEOMETRY Vol. 5 (2016), No. 1, 31-38 THE ERDÖS - MORDELL THEOREM IN THE EXTERIOR DOMAIN PETER WALKER Abstract. We show that in the Erd½os-Mordell theorem, the art of the region

More information

Elementary Analysis in Q p

Elementary Analysis in Q p Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some

More information

Sets of Real Numbers

Sets of Real Numbers Chater 4 Sets of Real Numbers 4. The Integers Z and their Proerties In our revious discussions about sets and functions the set of integers Z served as a key examle. Its ubiquitousness comes from the fact

More information

SUBORBITAL GRAPHS FOR A SPECIAL SUBGROUP OF THE NORMALIZER OF. 2p, p is a prime and p 1 mod4

SUBORBITAL GRAPHS FOR A SPECIAL SUBGROUP OF THE NORMALIZER OF. 2p, p is a prime and p 1 mod4 Iranian Journal of Science & Technology, Transaction A, Vol. 34, No. A4 Printed in the Islamic Reublic of Iran, Shiraz University SUBORBITAL GRAPHS FOR A SPECIAL SUBGROUP * m OF THE NORMALIZER OF S. KADER,

More information

arxiv: v4 [math.nt] 11 Oct 2017

arxiv: v4 [math.nt] 11 Oct 2017 POPULAR DIFFERENCES AND GENERALIZED SIDON SETS WENQIANG XU arxiv:1706.05969v4 [math.nt] 11 Oct 2017 Abstract. For a subset A [N], we define the reresentation function r A A(d := #{(a,a A A : d = a a }

More information

Two applications of the theorem of Carnot

Two applications of the theorem of Carnot Two applications of the theorem of Carnot Zoltán Szilasi Abstract Using the theorem of Carnot we give elementary proofs of two statements of C Bradley We prove his conjecture concerning the tangents to

More information

y mx 25m 25 4 circle. Then the perpendicular distance of tangent from the centre (0, 0) is the radius. Since tangent

y mx 25m 25 4 circle. Then the perpendicular distance of tangent from the centre (0, 0) is the radius. Since tangent Mathematics. The sides AB, BC and CA of ABC have, 4 and 5 interior points respectively on them as shown in the figure. The number of triangles that can be formed using these interior points is () 80 ()

More information