A collection of $n$ squares on the plane is called tri-connected if the following criteria are satisfied:

(i) All the squares are congruent.

(ii) If two squares have a point $P$ in common, then $P$ is a vertex of each of the squares.

(iii) Each square touches exactly three other squares.

How many positive integers $n$ are there with $2018\leq n \leq 3018$, such that there exists

a collection of $n$ squares that is tri-connected?

## APMO 2018 Problem 3

Discussion on Asian Pacific Mathematical Olympiad (APMO)

- samiul_samin
**Posts:**1004**Joined:**Sat Dec 09, 2017 1:32 pm

Return to “Asian Pacific Math Olympiad (APMO)”

Jump to

- General Discussion
- ↳ News / Announcements
- ↳ Introductions
- ↳ Social Lounge
- ↳ Site Support
- ↳ Test Forum
- ↳ Teachers' and Parents' Forum
- Mathematics
- ↳ Primary Level
- ↳ Junior Level
- ↳ Secondary Level
- ↳ Higher Secondary Level
- ↳ College / University Level
- Olympiads & Other Programs
- ↳ Divisional Math Olympiad
- ↳ Primary: Solved
- ↳ Junior: Solved
- ↳ Secondary: Solved
- ↳ H. Secondary: Solved
- ↳ National Math Olympiad (BdMO)
- ↳ National Math Camp
- ↳ Asian Pacific Math Olympiad (APMO)
- ↳ International Olympiad in Informatics (IOI)
- ↳ International Mathematical Olympiad (IMO)
- Olympiad Level
- ↳ Geometry
- ↳ Number Theory
- ↳ Algebra
- ↳ Combinatorics
- Sciences
- ↳ Physics
- ↳ Chemistry
- ↳ Computer Science
- ↳ Biology
- ↳ Astronomy & Astrophysics