online advertising
Processing math: 94%

Sunday, March 27, 2016

A primer for mathematics competitions - Section 1.2 - Appetizer Problem

Problem:


Solution:

Here I present my solution. The book's solution is MUCH simpler but that is not mine.

We know BX:XC=2:3, so let BX=2p. XC=3p.
Similarly, CY=q, YA=2q.

Let AB=r, our goal is to compute the length ratios.

AX=AB+BX=r+2p.
AX=AC+CX=(3q)3p.

Therefore: AX=15(3r6q) (Just eliminate p from the equations above)

BY=BA+AY=r2q

Observe that we have two ways to get to O, either starting from A or B.

Let AO=αAX
Let BO=βBY

Now α(15(3r6q))=αAX=AO=AB+BO=r+βBY=r+β(r2q)

Now the amazing thing happens, we can solve α and β at the same time by equating coefficients.

α(15(3r6q))=r+β(r2q)

35α=1β (matching coefficients of r)
65α=2β (matching coefficients of q)

Solving, get α=56, β=12.

So AO:OX=5:1, BO:OY=1:1.

Next, we tackle the CO:OZ and AZ:ZB. To do that, we compute CO in two ways.

Let CO=γCZ
Let AZ=δAB

CO=CB+BO=CA+AB+12BY=3q+r+12(r2q)=12(r+4q)

CZ=CA+AZ=3q+δAB=3q+δr.

Now 12(r+4q)CO=γCZ=γ(3q+δr)

Now we equate coefficients again and get

12=γδ (matching coefficients of r)
2=3γ

Solving, get γ=23, δ=34.

So CG:GZ=2:1, AZ:ZB=1:3.

Now at this point, we have all the length ratios we wanted. For triangles with opposite angle, we know triangle area is 12absinθ, so the length ratio give us triangle area ratios.

Since we do not need to vectors anymore, abusing the notation, we reuse PQRSTU to mean the triangle areas of AOZ,AOY,ZOB,YOC,BOX,XOC.

The length ratios give us these equations:

2P=5U
R=2S
5T=Q

We wanted R+T, but we do not know Q, so even more is required. Here is another observation, ABX:ACX=2:3 because they share the same height but with different base, that gives 3(P+R+T)=2(Q+S+U), at this point, we can solve Q=5.5U+4S1.4, and therefore R+T=2a+16.5b+4a7.

Even then, it is not enough, because we have no matching answer, now we pull in one more equation with the observation that CAE:CBE=3:1 using the similar argument, now we get 5 equations:

2P=5U
R=2S
5T=Q
3(P+R+T)=2(Q+S+U)
P+Q+S=3(R+T+U),

We know these equations will not give an exact answer because it is simply up to scaling. We arbitrarily set U=1 and solve these equations (with a solver, coz I am lazy), we finally get our answers.

P = 2.500
Q = 4.722
R = 0.556
S = 0.278
T = 0.944
U = 1.000

So R + T = 1.5 and that is 9213=9b2

So finally, that's our answer! Phew.

Sunday, March 20, 2016

UTM Ideals Varieties and Algorithm - Chapter 2 Section 2 Exercise 6

Problem:


Solution:

It is simply reversing the variable order.

Suppose a set of polynomial is invlex ordered with respect to the variable order x>y>z, then it is lex ordered with respect to the variable order z>y>x, this is obvious to see from the definition.

Saturday, March 19, 2016

A primer for mathematics competitions - Section 1.1 - Appetizer Problem 3

Problem:


Solution:

We know the method for computing the radius for the inscribed circle. Now let's think about the radius of the circumscribed circle.

The key observation is that it is a right angled triangle inside a circle, so the hypotenuse must be the diameter, and therefore R=c2, in our previous case, that would be 52.

To avoid the algebra, we can simply test the options and see which one gives 1:2.5. That gives option (A) right away.

Knowing the answer is (A), working backwards, we know the radius of the inscribed circle is aba+b+c.

This is a particularly good looking formula. Let's see why.

Using exactly the same computation we had in the last problem, we have

da=1acbc=cab.

The equation of the angle bisector is

xa+ya(ca)b=1.

Solving for x by subsituting y=x, we get

x=a1+bca=a(ca)b+ca and that is our representation for the radius of the inscribed circle.

I claim that the two representations are equal, to see that, we write

a(ca)b+ca=aba+b+ca(ca)(a+b+c)=(ab)(b+ca)a2c+abc+ac2a3a2ba2c=ab2+abca2babc+ac2a3a2b=ab2+abca2bac2a3=ab2ac2a3=a(c2a2)ac2a3=ac2a3

Reading backwards, now we have shown the both representations are equal (of course, the given one look much better)

A primer for mathematics competitions - Section 1.1 - Appetizer Problem 2

Problem:


Solution:

There must be a lot of different ways to approach this problem, but personally, I like to address geometric problem analytically, or even better, algebraically.

First, we recall the fact that an inscribed circle's center is at the intersections of the angle bisectors. The equation of the angle bisector for the right angle is particularly easy, it is simply y=x, now if we found another angle bisector's equation, then we are done.

Suppose we draw the angle bisector of the angle between the hypotenuse and the base, we get a diagram like this.

I want to find the y-intercept value d of that angle bisector, because then I can use intercept form for straight-line to find the equation of it. Now we know that d3=tanα2, now we can use this awesome formula I found online.

tanα2=1cosαsinα

Now we can easily calculate d=3tanα2=31cosαsinα=313545=32.

Therefore, the angle bisector's equation is x3+y32=1, in intercept form.

Solving the intersection point of this with y=x gives x=y=1, that is the center of our inscribed circle, and therefore the radius is also 1.

So the answer is (A) - A for appetizer?


A primer for mathematics competitions - Section 1.1 - Appetizer Problem 1

Problem:


Solution:

Letting the center of the circle O, the square to have side length 2s and the circle have radius r.

By Pythagoras theorem, we can get this relation. (Sorry Pythagoras, I just keep forgetting how to spell your name ... )

s2+(2sr)2=r2

This can easily simplify to 5s24sr=0, so we get r=5s4.

Therefore the area ratio is πr2(2s)2=π(5s)242(2s)2=25π64.

The answer is (A).

Thursday, March 10, 2016

UTM Ideals Varieties and Algorithm - Chapter 2 Section 2 Exercise 5

Problem:


Solution:

All we needed to do for this problem is to verify the three rules.

(i) > is a total (or linear order) on Zn0

This is simple to verify according to the definition. As long as two monomials are not the same, then either one is strictly larger than the other.

(ii) If α>β and γZn0, then α+γ>β+γ.

This is also simple to verify. if α has a total degree larger than β, then so is α+γ and β+γ. Otherwise if the rightmost element of αβ is negative, then so is α+γ and β+γ as well.

(iii) > is a well ordering

For any set of n tuple, their total order is a set of non-negative integer and therefore there exist a smallest total degree, consider that subset of n tuples with smallest total degree.

For any set of n tuple with the same total order, their last element is an integer, and therefore exists a smallest first element, consider that subset of n tuples with smallest total degree and smallest last element. (*)

Repeat the above until we find the one with every element smallest. Now we have found a smallest element.

Suppose we have two elements α and β with same total degree to compare with and α has a smallest last element, then αβ will have a negative rightmost non-zero element.

UTM Ideals Varieties and Algorithm - Chapter 2 Section 2 Exercise 4

Problem:


Solution:

All we needed to do for this problem is to verify the three rules.

(i) > is a total (or linear order) on Zn0

This is simple to verify according to the definition. As long as two monomials are not the same, then either one is strictly larger than the other.

(ii) If α>β and γZn0, then α+γ>β+γ.

This is also simple to verify. if α has a total degree larger than β, then so is α+γ and β+γ. Otherwise if α is lexicographically larger than β, then so is α+γ and β+γ as well.

(iii) > is a well ordering

For any set of n tuple, their total order is a set of non-negative integer and therefore there exist a smallest total degree, consider that subset of n tuples with smallest total degree.

For any set of n tuple with the same total order, their first element is an integer, and therefore exists a smallest first element, consider that subset of n tuples with smallest total degree and smallest first element.

Repeat the above until we find the one with every element smallest. Now we have found a smallest element.

Wednesday, March 9, 2016

Convex Optimization Exercise 2.1

Problem:


Solution:

The case for k=1 is trivial. The case for k=2 is given as definition. Using induction, we can assume θ1x1++θk1xk1C work for any set of θ that sums to 1.

Now consider

θ1x1++θkxk=θ1x1++θk1xk1+θkxk=1θk1θk(θ1x1++θk1xk1)+θkxk=(1θk)(θ11θkx1++θk11θkxk1)+θkxk

Now we know the sum inside the bracket is in C by the induction hypothesis, and therefore the point we wanted to prove is also in C because of the definition.


Tuesday, March 8, 2016

UTM Ideals Varieties and Algorithm - Chapter 2 Section 2 Exercise 3

Problem:


Solution:

Here is the Exercise 1 statement.


Okay, I know this is stupid, this is just an exercise!

Part (a)
lex order: z2+z+3y+x3+x2+2x
LM(f)=z2
LT(f)=z2
multideg(f)=(2,0,0)
(2, 0, 0)
(1, 0, 0)
(0, 1, 0)
(0, 0, 3)
(0, 0, 2)
(0, 0, 1)

grlex order: x3z2+x2+z+3y+2x
LM(f)=x3
LT(f)=x3
multideg(f)=(0,0,3)
(0, 0, 3)
(2, 0, 0)
(0, 0, 2)
(1, 0, 0)
(0, 1, 0)
(0, 0, 1)

grevlex order: x3+z2x2+z+3y+2x
LM(f)=x3
LT(f)=x3
multideg(f)=(0,0,3)
(0, 0, 3)
(2, 0, 0)
(0, 0, 2)
(1, 0, 0)
(0, 1, 0)
(0, 0, 1)

Part (b)
lex order: 3x5yz4+xyz3+2x2y8xy4
LM(f)=x5yz4
LT(f)=3x5yz4
multideg(f)=(4,1,5)
(4, 1, 5)
(3, 1, 1)
(0, 8, 2)
(0, 4, 1)

grlex order: 3x5yz4+2x2y8+xyz3xy4
LM(f)=x5yz4
LT(f)=3x5yz4
multideg(f)=(4,1,5)
(4, 1, 5)
(0, 8, 2)
(3, 1, 1)
(0, 4, 1)

grevlex order: 2x2y83x5yz4+xyz3xy4
LM(f)=x2y8
LT(f)=2x2y8
multideg(f)=(0,8,2)
(0, 8, 2)
(4, 1, 5)
(3, 1, 1)
(0, 4, 1)

UTM Ideals Varieties and Algorithm - Chapter 2 Section 2 Exercise 2

Problem:


Solution:

Part (a) grlex
Part (b) grevlex
Part (c) lex


UTM Ideals Varieties and Algorithm - Chapter 2 Section 2 Exercise 1

Problem:


Solution:

It is a really simple sorting exercise, so let's do some warmup.

Part (a)
lex order: x3+x2+2x+3yz2+z
LM(f)=x3
LT(f)=x3
multideg(f)=(3,0,0)
(3, 0, 0)
(2, 0, 0)
(1, 0, 0)
(0, 1, 0)
(0, 0, 2)
(0, 0, 1)

grlex order: x3+x2z2+2x+3y+z
LM(f)=x3
LT(f)=x3
multideg(f)=(3,0,0)
(3, 0, 0)
(2, 0, 0)
(0, 0, 2)
(1, 0, 0)
(0, 1, 0)
(0, 0, 1)

grevlex order: x3+x2z2+2x+3y+z
LM(f)=x3
LT(f)=x3
multideg(f)=(3,0,0)
(3, 0, 0)
(2, 0, 0)
(0, 0, 2)
(1, 0, 0)
(0, 1, 0)
(0, 0, 1)

Part (b)
lex order: 3x5yz4+2x2y8xy4+xyz3
LM(f)=x5yz4
LT(f)=3x5yz4
multideg(f)=(5,1,4)
(5, 1, 4)
(2, 8, 0)
(1, 4, 0)
(1, 1, 3)

grlex order: 3x5yz4+2x2y8xy4+xyz3
LM(f)=x5yz4
LT(f)=3x5yz4
multideg(f)=(5,1,4)
(5, 1, 4)
(2, 8, 0)
(1, 4, 0)
(1, 1, 3)

grevlex order: 2x2y83x5yz4xy4+xyz3
LM(f)=x2y8
LT(f)=2x2y8
multideg(f)=(2,8,0)
(2, 8, 0)
(5, 1 ,4)
(1, 4, 0)
(1, 1, 3)

Friday, March 4, 2016

Differential Geometry of Curves and Surfaces - Chapter 1 Section 3 Exercise 3

Problem:


Note the errata to this problem here. In particular, B should be on the line with OC and that's the half line r.

Solution:

Note that OCA is a right angle.

CA2a=sinθ
BA2a=tanθ
CA2+CB2=BA2

(2asinθ)2+CB2=(2atanθ)2
OP2=CB2=4a2(tan2θsin2θ)

With some trigonometry, we get

sec2θ=1+tan2θ=1+t2
cos2θ=1sec2θ=11+t2
sin2θ=1cos2θ=111+t2=t21+t2
tan2θsin2θ=t2t21+t2=t4+t2t21+t2=t41+t2

So we get OP=2at21+t2

x=OPcosθ=2at21+t2
y=OPsinθ=2at31+t2

This time around I solved the problem with a good diagram and geometrical insight without using MATLAB.

Part (b) is trivial, when t±, x2a, y0,

α=2a1(1+t2)2((1+t2)2tt2(2t),(1+t2)3t2t3(2t))

So α(t)=(0,2a) as t±

At this point I am still confused, look like α(t) should be (0,2a) and not (2a,0)?

Thursday, March 3, 2016

Problems in Number Theory

Problem:


Solution:

The key step in this problem is to let n=A2p3q5r, it can be easily seen that A=1 for minimal value in the set.

The fact that these roots are natural number give rise to these equations:

p - 1 = 0 \mod 2
p = 0 \mod 3
p = 0 \mod 5

q = 0 \mod 2
q - 1 = 0 \mod 3
q = 0 \mod 5

r = 0 \mod 2
r = 0 \mod 3
r - 1 = 0 \mod 5

By Chinese remainder theorem, we get p = 15 , q = 10 , r = 6 , so the answer is

2^15 \times 3^10 \times 5^6 = 30,233,088,000,000