P2
Part of Russian TST 2020
Problems(3)
Delightful sets of vertices
Source: Russian TST 2020, Day 4 P2
3/21/2023
There are 10,000 vertices in a graph, with at least one edge coming out of each vertex. Call a set of vertices delightful if no two of its vertices are connected by an edge, but any vertex not from is connected to at least one vertex from . For which smallest is there necessarily a delightful set of at most vertices?
graph theorycombinatorics
Inequality with gcd
Source: Russian TST 2020, Day 6 P2
3/21/2023
Given a natural number find the smallest such that for any positive integers and .
number theoryinequalitiesgreatest common divisor
Inscribed octagon, geometry
Source:
8/3/2021
Octagon is inscribed in a circle with center . It is known that , and . The circle passes through , and touches ; circle passes through , and touches ; the circle passes through , and touches ; the circle passes through , and touches . The common external tangent to and cross the line passing through and at the point . Prove that one of the common tangents to and passes through .
octagoncirclesradical axisconcurrencycommon tangentsgeometry