Scribd Logo
Upload

Welcome to Scribd!

  • 12 views

    Potwe 20 Ae NP 04 P

    Uploaded by

    ElevenPlus Parents
    This number tree has integers written in increasing order with each row containing twice as many as the row above. Each integer is connected to two below, one left and one right. The question asks for the sequence of left and right movements to travel from 0 to 1172 in the tree.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Potwe 20 Ae NP 04 P

    Uploaded by

    ElevenPlus Parents
    12 views1 page
    This number tree has integers written in increasing order with each row containing twice as many as the row above. Each integer is connected to two below, one left and one right. The question asks for the sequence of left and right movements to travel from 0 to 1172 in the tree.

    Original Title

    POTWE-20-AE-NP-04-P

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This number tree has integers written in increasing order with each row containing twice as many as the row above. Each integer is connected to two below, one left and one right. The question asks for the sequence of left and right movements to travel from 0 to 1172 in the tree.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    12 views1 page

    Potwe 20 Ae NP 04 P

    Uploaded by

    ElevenPlus Parents
    This number tree has integers written in increasing order with each row containing twice as many as the row above. Each integer is connected to two below, one left and one right. The question asks for the sequence of left and right movements to travel from 0 to 1172 in the tree.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 1

    Problem of the Week

    Problem E
    Find the Way

    Consider the following number tree.

    In this number tree, the integers greater than or equal to 0 are written out in
    increasing order, with the top row containing one integer and every row after
    containing twice as many integers as the row above it. Each integer is connected
    to two integers in the row below, one down and to the left and one down and to
    the right, as shown in the tree. For example, the number 5 is connected to the
    number 11 (down to the left) and the number 12 (down to the right) in the row
    below. Notice that we can get from 0 to 12 by going down right (R), down left
    (L), then down right (R).
    What is the sequence of left (L) and right (R) movements to get from the number
    0 to the number 1172 in the tree?

    You might also like