AoPS Academy
be triangle and point 
be 
altitude of 
.
be a point on 
and 
such that 
and 
. Point 
is the intersection of 
and 
. Point 
be intersection of 
and 
. Line 
intersect circumcircle of again at 
.
.
bisect .
, define a sequence of integers 
by letting 
and 
for 
. Let 
. Determine the largest possible 
such that, for some positive integer , the numbers 
are all prime.
cities in a country, where 
is an integer. Some pairs of cities are connected by direct (two-way) flights. For two cities 
and 
we define:
A 
between and as a sequence of distinct cities 
, 
, such that there are direct flights between 
and 
for every 
;
A 
between and as a path between and such that no other path between and has more cities;
A 
between and as a path between and such that no other path between and has fewer cities. and in the country, there exist a long path and a short path between them that have no cities in common (except and ). Let 
be the total number of pairs of cities in the country that are connected by direct flights. In terms of , find all possible values 
,
,
, 
, 
is not greater than 
. and be points on a plane such that 
, where is a positive integer. Let 
be the set of all points such that 
, where 
is a real number. The path that traces is continuous, and the value of is minimized. Prove that is rational for all positive integers 
to the cross product 
reveals that a negative determinant [of 
] corresponds to a matrix which reverses the direction of the cross product of two vectors.[/quote]
and 
, but am confused on how to prove this statement for general vectors 
and 
although its supposed to be a quick comparison.
a
.
.
.
![$ a,b \in [0 ,1] . $](http://latex.artofproblemsolving.com/9/1/9/91980d5ca5d97fe4b61797e6fbb378211674d9cd.png)
Prove that
be reals such that 
and 
Prove that
Let 
Prove that
Let 
Prove that