Return how many Triangular Tiling grid points there are inside a circle of radius r centred at (0,0) (including points on the edge).
Assume that a Triangular Tiling grid is a 2D Hexagonal Bravais lattice with | a1 | = | a2 | = 1 and φ = 120°.
Neither string operations nor interpolations are allowed!
Solution Stats
Problem Comments
-
1 Comment
Rafael Siqueira Telles Vieira
on 23 Jun 2020 at 20:26
This problem set has so many problems about dots that I'm starting to see spots in my vision.
Problem Recent Solvers36
Suggested Problems
-
4710 Solvers
-
Least common multiple of many numbers
193 Solvers
-
Construct a string from letters and counts
142 Solvers
-
Similar Triangles - find the height of the tree
209 Solvers
-
Longest run of consecutive numbers
900 Solvers
More from this Author18
Problem Tags
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)