All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Shapes
Star-shaped polyominos (Posted on 2016-03-28) Difficulty: 3 of 5
A star-shaped polygon is a polygon that contains at least one point from which the entire polygon boundary is visible. The set of all such points is called the kernel.

A) Find the smallest polyomino that is not star-shaped.
B) Find the smallest polyomino whose kernel is a single point.
C) Find the smallest polyomino whose kernel is a line segment.
D) Find the smallest polyomino whose kernel is precisely half the area of the polyomino.

E) Prove or disprove: For every rational number, Q, where 0≤Q≤1 there is a polyomino whose kernel is Q times the area of the polyomino.

Note: smallest refers to the number of squares comprising the polyomino.

No Solution Yet Submitted by Jer    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
re(3): Solution Part A | Comment 4 of 7 |
(In reply to re(2): Solution Part A by Steve Herman)

I don't know how I manage such errors.  I fixed it.

  Posted by Jer on 2016-03-28 19:57:28

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information