Masaken
Unknown Member
consider the tile below consisting of three equilateral triangles of side length 1 unit. [i only have the physical copy so i drew it up as best as i could if it makes no sense pls tell me so i can draw it again:]
prove the following result for positive integers n, using mathematical induction.
an equilateral triangle of side length 2^n units may be covered by the tiles above (in any orientation) such that a single equilateral triangle of side length 1 unit is left over at one of the vertices. the tiles may not overlap.
ok so i have the worked solutions for this but when i read it i just don't get it. how would i go about with this question?? (preferably with some explanations as to why you did what you did) like how would i start?? i got up to n=1 but i didn't know how to visualise or even how to consider going about doing the n=k step... pls help, thanks in advance
prove the following result for positive integers n, using mathematical induction.
an equilateral triangle of side length 2^n units may be covered by the tiles above (in any orientation) such that a single equilateral triangle of side length 1 unit is left over at one of the vertices. the tiles may not overlap.
ok so i have the worked solutions for this but when i read it i just don't get it. how would i go about with this question?? (preferably with some explanations as to why you did what you did) like how would i start?? i got up to n=1 but i didn't know how to visualise or even how to consider going about doing the n=k step... pls help, thanks in advance