Jump to content
BrainDen.com - Brain Teasers
  • 0


Guest
 Share

Question

Question 1

(x-a)(x-b)(x-c),,,(x-z)= :excl:

Solve for :excl:

Question 2

You have a chessboard, on which the two opposing diagonal corner squares have been removed. You have an infinite number of domino's, each of which cover exactly two squares on the chessboard. Without any domino overlapping another, and no domino hanging over an edge (So each domino must cover two squares) can you completely cover the chessboard with domino's?

Question 3

You have 10 trees in pots. Is it possible to plant the trees in five rows of four trees?

Link to comment
Share on other sites

11 answers to this question

Recommended Posts

  • 0

Question 3

You have 10 trees in pots. Is it possible to plant the trees in five rows of four trees?

If you plant all 10 trees in a single line, you'd effectively have 7 rows (linear groupings) of 4 trees.

Edited by LichWriter
Link to comment
Share on other sites

  • 0

For Questions 3

plant them so they make the shape of a five pointer star. With one tree at each of the points, and on tree where the two "lines" would cross

Link to comment
Share on other sites

  • 0
Question 1

(x-a)(x-b)(x-c),,,(x-z)= :excl:

Solve for :excl:

my apologies for empty post

:excl: = 0, since somewhere in the equation ...(x-x)... appears which is obviously 0, so :excl: is 0
Link to comment
Share on other sites

  • 0

This was done recently on the forum. There are 32 black and white square, getting rid of 2 diagonal squares will leave only 30 of one color. Since each domino covers 1 black and 1 white square it's impossible to cover 32 black and 30 white square with dominoes.

Link to comment
Share on other sites

  • 0

At some point you find the term (x-x), which equals 0. So you don't need to know any of the variables; one zero in the mix and the whole problem will always equal 0.

Link to comment
Share on other sites

  • 0

The third problem can be extended to planting n trees in n/2 rows of 4 trees, where n/2 is an odd number.

The answer always works in the same way, using end-points and crossing-points of lines which make an n/2 -pointed star

for example, 14 trees can be planted in 7 rows of 4 trees each, etc.

Donjar :rolleyes:

Link to comment
Share on other sites

  • 0

Um...technically the expression in question one is already solved for

:excl: . "Find the value of :excl: " would be a more appropriate request, in which case the previous couple of posters are correct, :excl: =0
Link to comment
Share on other sites

  • 0

Zero. (x-x) = 0. Anything and everything times zero, is zero.

Yes. On the sides, have pieces going the opposite way than the inner pieces, tracing a square ended zig-zag from blank to blank.

Draw a circle of 5 points, evenly spaced. Draw straight lines to connect each of the points to eachother. At each intersection put a point. There will be 5 sets of 4, because each segment (5 segments) will have 2 endpoints and two intersections (2+2=4).

Yay. Time for me to sleep.

Link to comment
Share on other sites

  • 0

Zero. (x-x) = 0. Anything and everything times zero, is zero.

Nice one!

Yes. On the sides, have pieces going the opposite way than the inner pieces, tracing a square ended zig-zag from blank to blank.

Sorry, dude. Incorrect.

Draw a circle of 5 points, evenly spaced. Draw straight lines to connect each of the points to eachother. At each intersection put a point. There will be 5 sets of 4, because each segment (5 segments) will have 2 endpoints and two intersections (2+2=4).

Yay. Time for me to sleep.

Nice one!

Link to comment
Share on other sites

Join the conversation

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

Guest
Answer this question...

×   Pasted as rich text.   Paste as plain text instead

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

Loading...
 Share

  • Recently Browsing   0 members

    • No registered users viewing this page.
×
×
  • Create New...