Kwun Tong On Tai (constituency)
Kwun Tong On Tai (Chinese: 觀塘安泰) is one of the 40 constituencies in the Kwun Tong District.
Kwun Tong On Tai | |
---|---|
Elected Constituency for the Kwun Tong District Council | |
![]() Boundary of Kwun Tong On Tai in Kwun Tong District | |
District | Kwun Tong |
Legislative Council constituency | Kowloon East |
Population | 20,739 (2019)[1] |
Electorate | 7,139 (2019)[2] |
Current constituency | |
Created | 2019 |
Number of members | One |
Member(s) | Lam Wai (FPHE) |
Created from | Po Tat |
Created for the 2019 District Council elections, the constituency returns one district councillor to the Kwun Tong District Council, with an election every four years.
Kwun Tong On Tai loosely covers part of the public housing estates On Tai Estate, Shun Lee Estate and Shun On Estate. It has projected population of 20,739.[3]
Election results
2010s
Party | Candidate | Votes | % | ± | |
---|---|---|---|---|---|
FPHE | Lam Wai | 2,901 | 56.42 | ||
Democratic | Lin Kuan-tsun | 2,241 | 43.58 | ||
Majority | 660 | 12.84 | |||
Turnout | 5,152 | 72.24 | |||
FPHE win (new seat) |
gollark: Just define your problem generation problem rigorously and use Hutter search.
gollark: Just iterate over all possible strings and look for the most problemy ones.
gollark: Oh yes, I'll just do a 1729-dimensional Fourier transform on this 8051 to multiply these integers
gollark: In any case, the asymptotically-fastest multiplication algorithms are worse for any problem which fits into the universe.
gollark: Just take `x << 3 + x << 1` or something like that, unless it has something faster; you don't need some ultrahyperfast algorithm.
References
- "Recommended District Council Constituency Areas" (PDF). Electoral Affairs Commission.
- "Age and Sex profile of registered electors by 452 District Council Constituency Areas in 2019" (PDF). Registration and Electoral Office.
- "Recommended Constituency Areas Boundary Descriptions" (PDF). Electoral Affairs Commission.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.