Consider the isosceles triangle with and the circle of radius centered at Let be the midpoint of The line intersects a second time at Let be a point on such that Let be the intersection of and Prove that
The kingdom of Anisotropy consists of cities. For every two cities there exists exactly one direct one-way road between them. We say that a path from to is a sequence of roads such that one can move from to along this sequence without returning to an already visited city. A collection of paths is called diverse if no road belongs to two or more paths in the collection.
Let and be two distinct cities in Anisotropy. Let denote the maximal number of paths in a diverse collection of paths from to . Similarly, let denote the maximal number of paths in a diverse collection of paths from to . Prove that the equality holds if and only if the number of roads going out from is the same as the number of roads going out from .
Consider a scalene triangle with incentre and excentres and , opposite the vertices and respectively. The incircle touches and at and respectively. Prove that the circles and have a common point other than .
As shown in the figure, there are two points and outside triangle such that and . Connect and , which intersect at point . Let intersect at point . Prove that .
Suppose we have distinct positive integers , and an odd prime not dividing any of them, and an integer such that if one considers the infinite sequence and looks at the highest power of that divides each of them, these powers are not all zero, and are all at most . Prove that there exists some (which may depend on ) such that whenever divides an element of this sequence, the maximum power of that divides that element is exactly .
Expected Intersections from Random Pairing on a Circle
tom-nowy2
N4 hours ago
by lele0305
Let be a positive integer. Consider points on the circumference of a circle.
These points are randomly divided into pairs, and line segments are drawn connecting the points in each pair.
Find the expected number of intersection points formed by these segments, assuming no three segments intersect at a single point.
Find the maximum number of Permutation of set {} such that for every 2 different number and in this set at last in one of the permutation comes exactly after
We haveso is odd and is even. Say , with , thenso or .
If thenso , and only gives a solution in natural numbers. In this case we get , which gives , so this doesn't work.
Hence , and so . Thenso , and only gives a solution in natural numbers. In this case we get , which gives , so this doesn't work.
Hence I assume you mean whole numbers rather than natural numbers.
In this case gives the solution and .
We also have to check the case . Here we haveso , and only gives a solution in whole numbers. In this case we get , which gives , so this doesn't work.
Hence there are no solutions in natural numbers and only one solution in whole numbers.