Tournament of Towns, 1981-1982
Spring-
Question from sources: Spring
Find all numbers that are divisible by 30 and have exactly 30 distinct divisors (enter the number of such numbers to check your answer)
Sources: -
Question from sources: Spring
In a quadrilateral, the lengths of all diagonals and all sides are less than 1. Prove that the quadrilateral can be covered by a circle with a radius of 0.9.
Sources: -
Question from sources: Spring
In a certain country, there are more than 101 cities. The capital is connected by flight routes to 100 cities, and every city other than the capital is connected by flight routes to exactly 10 cities. It is given that from any city, it is possible to reach any other city (possibly not by a direct route). Prove that it is possible to close half of the flight routes leading to the capital such that the possibility of reaching any city from any other city is preserved.
Sources: -
Question from sources: Spring
Given the sequence `1 , 1/2 ,1/3 ,1/4 ,1/5,...`, does there exist an arithmetic sequence composed of terms from the aforementioned sequence?
-
Of length 5
-
Of any length
Sources:Topics:Number Theory -> Modular Arithmetic / Remainder Arithmetic -> Divisibility Rules Proof and Example -> Constructing an Example / Counterexample Algebra -> Sequences -> Arithmetic Progression / Arithmetic Sequence Arithmetic -> Fractions Number Theory -> Greatest Common Divisor (GCD) and Least Common Multiple (LCM) -