Here we seek the shortest set of line segments, one attached to each of a square's corners, that need not connect with each other. Instead, what we ask of the line segments is that is they will block any ray of light attempting to pass through the square.

## Question

## bonanova 85

Recently we considered the shortest roadway that connects the four corners of a square.

Here we seek the shortest set of line segments, one attached to each of a square's corners, that need not connect with each other. Instead, what we ask of the line segments is that is they will block any ray of light attempting to pass through the square.

## Link to post

## Share on other sites

## 5 answers to this question

## Recommended Posts

## Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.