Welcome to BrainDen.com - Brain Teasers Forum
|Welcome to BrainDen.com - Brain Teasers Forum. Like most online communities you must register to post in our community, but don't worry this is a simple free process. To be a part of BrainDen Forums you may create a new account or sign in if you already have an account.
As a member you could start new topics, reply to others, subscribe to topics/forums to get automatic updates, get your own profile and make new friends.
Of course, you can also enjoy our collection of amazing optical illusions and cool math games.
If you like our site, you may support us by simply clicking Google "+1" or Facebook "Like" buttons at the top.
If you have a website, we would appreciate a little link to BrainDen.
Thanks and enjoy the Den :-)
Posted 20 February 2014 - 09:23 AM
By connecting the eight vertices of an octagon (with horizontal, vertical
and 45-degree lines, ignoring the perimeter) we define eight rows having
either four or five points of intersection.
Place sixteen consecutive (positive) integers on these points such that
- The sums along all eight rows are the same.
- The common sum is the smallest possible.
A harder problem is to create the largest possible common sum.
Vidi vici veni.
Posted 21 February 2014 - 01:45 AM Best Answer
EDIT: assuming all integers must be positive.
Edited by Rainman, 21 February 2014 - 01:46 AM.
Posted 23 February 2014 - 01:15 PM
OP doesn't require the numbers 1 through 16, just that the numbers are consecutive.
Posted 24 February 2014 - 07:22 AM
I can mark only one post, so it's Rainman's, for getting the lowest sum.
Rainman and SP finished off the rest of the analysis correctly.
Vidi vici veni.
0 user(s) are reading this topic
0 members, 0 guests, 0 anonymous users