The gardener planted his orange trees in a superbly ordered manner.
Not counting pairs of trees as a "row", he created nineteen rows of trees.
How many trees was it necessary for him to plant?
![]() |
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 :-) |
Best Answer bonanova, 08 April 2013 - 06:28 AM
Time to plant the trees.
Assuming interest on this puzzle is spent, let's close it out.
Honorable mention to plasmid, whose last post was clearly on the right track.
Go to the full post
Posted 15 February 2013 - 06:09 AM
The gardener planted his orange trees in a superbly ordered manner.
Not counting pairs of trees as a "row", he created nineteen rows of trees.
How many trees was it necessary for him to plant?
Posted 15 February 2013 - 04:35 PM
E F G H
I J K L
M N O P
R S T
5 horizontal rows
4 vertical columns
4 diagonals with slope 1 (ROL, NKH, MJG, IFC)
4 diagonals with slope -1 (SNI, TOJE, PKFA, LGB)
2 knight's move diagonals with slope -2 (AJS, BKT)
Edited by CaptainEd, 15 February 2013 - 04:38 PM.
Posted 15 February 2013 - 05:47 PM
Spoiler for a solutionSpoiler for 18 treesA B C
E F G H
I J K L
M N O P
R S T
5 horizontal rows
4 vertical columns
4 diagonals with slope 1 (ROL, NKH, MJG, IFC)
4 diagonals with slope -1 (SNI, TOJE, PKFA, LGB)
2 knight's move diagonals with slope -2 (AJS, BKT)
Posted 15 February 2013 - 06:19 PM
I see your point
DFG HIJL MOP QRS
ADH BIM FJQ GOR LPS
BFP AJOS DIR HMQ
AIQ QOL AFL BJR MJG DJP
Edit: from "more frugal" to "better still" that meets the OP with even fewer trees
Edited by CaptainEd, 15 February 2013 - 06:26 PM.
Posted 15 February 2013 - 07:13 PM
Wow! His name wasn't Martin, was it?
Please correct me if I'm wrong: a line of 4 counts as one row of 4, rather than two rows of three, right?
Sometimes it's Martin, a semi-idol of mine, but not this time.
It's gardener, lower case, with two "e"s.
Correct. A row of four is not also two (or four) rows of three.
A row is a row, and its size is the number of trees aligned with it.
Clue:
If the rows of length greater than three are excluded, there are (only) eighteen rows.
Posted 15 February 2013 - 11:08 PM
Spoiler for I got...18 rows formed by 13 trees. I can get 19 and even more with 14 trees. Is this close to your solution, Bonanova?
Yes. Very close.
It's as close as you can come and not be the minimum.
That was a hint at the answer.
0 members, 0 guests, 0 anonymous users
Community Forum Software by IP.Board 3.4.4
Licensed to: BrainDen
