A problem and solution are shown below. My question is, why is it that in the solution, for each $y\in A_a,$ there exists some city $d_y$ in $D$ that can only be reached with four flights from $x$ while passing through $y$? From the definition of a substantial subset and the minimality of $A^*$, it seems that there exists $d\in D$ so that $d\not\in S_3(a)$ for any $a\in A_a$. But I can't see why this implies the claim above.
2026-04-04 14:18:43.1775312323
prove there is no city so that more than 2550 other cities have distance exactly four from it
65 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in COMBINATORICS
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Hard combinatorial identity: $\sum_{l=0}^p(-1)^l\binom{2l}{l}\binom{k}{p-l}\binom{2k+2l-2p}{k+l-p}^{-1}=4^p\binom{k-1}{p}\binom{2k}{k}^{-1}$
- Algebraic step including finite sum and binomial coefficient
- nth letter of lexicographically ordered substrings
- Count of possible money splits
- Covering vector space over finite field by subspaces
- A certain partition of 28
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
Related Questions in GRAPH-THEORY
- characterisation of $2$-connected graphs with no even cycles
- Explanation for the static degree sort algorithm of Deo et al.
- A certain partition of 28
- decomposing a graph in connected components
- Is it true that if a graph is bipartite iff it is class 1 (edge-coloring)?
- Fake induction, can't find flaw, every graph with zero edges is connected
- Triangle-free graph where every pair of nonadjacent vertices has exactly two common neighbors
- Inequality on degrees implies perfect matching
- Proving that no two teams in a tournament win same number of games
- Proving that we can divide a graph to two graphs which induced subgraph is connected on vertices of each one
Related Questions in CONTEST-MATH
- Solution to a hard inequality
- Length of Shadow from a lamp?
- All possible values of coordinate k such that triangle ABC is a right triangle?
- Prove that $1+{1\over 1+{1\over 1+{1\over 1+{1\over 1+...}}}}=\sqrt{1+\sqrt{1+\sqrt{1+\sqrt{1+...}}}}$
- Lack of clarity over modular arithmetic notation
- if $n\nmid 2^n+1, n|2^{2^n+1}+1$ show that the $3^k\cdot p$ is good postive integers numbers
- How to prove infinitely many integer triples $x,y,z$ such that $x^2 + y^2 + z^2$ is divisible by $(x + y +z)$
- Proving that $b-a\ge \pi $
- Volume of sphere split into eight sections?
- Largest Cube that fits the space between two Spheres?
Related Questions in PIGEONHOLE-PRINCIPLE
- Is it possible to make a computer network of 75 computers
- Pigeonhole principle: prove that a class of 21 has at least 11 male or 11 female students.
- Proving that a set of 2016 natural numbers contain a non-empty set with a sum divisible by 2016
- Question on proof of Erdos and Szekeres
- # of vertices and # of connected components proof problem?
- Prove that any collection of 8 distinct integers contains distinct x and y such that x - y is divisible by 7.
- Hint for problem on $4 \times 7$-chessboard problem related to pigeonhole principle
- Pigeonhole principle subsets
- $80$ balls in a row. $50$ of them are yellow and $30$ are blue. Prove that there are at least $2$ blue balls with a distance of exactly $3$ or $6$.
- Pigeon-hole principle question.
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?

The precise statement that follows from minimality: for each $y \in A_a$ (and in fact this would be true for each $y \in A^*$), there is some city $d_y \in D$ such that
This city $d_y$ is the city that justifies $y$'s inclusion in $A^*$; if for every $d_y \in D$ with a path $x - y - b_y - c_y - d_y$, there were also a path $x - y' - b_y' - c_y' - d_y$ with $y' \in A^* \setminus \{y\}$, then $A^* \setminus \{y\}$ would also have been substantial.
Note that we are not claiming that there is no length-$4$ path starting at $x$ and ending at $d_y$ that does not pass through $y$; there is simply no such path that goes through a vertex of $A^*$ other than $y$.
This is all we need to carry out the rest of the proof. When we show that all $2(m-1)$ cities $b_y, c_y$ with $y \in A_a$ are distinct, we are applying statement 2 to $y' = z$. When we show that $d(a,d_y) \ne 3$, we are applying statement 2 to $y' = a$.