Create a fractal with circles using the same process as the Sierpinski triangle (https://en.wikipedia.org/wiki/Sierpinski_triangle) respectively the Sierpinski carpet (https://en.wikipedia.org/wiki/Sierpinski_carpet).
Starting point is the unit circle. Cut out circles with decreasing radii. In the end it should look like the profile picture.
Return the area (in multiples of pi) of the remaining part of the unit circle after n iterations!
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers19
Suggested Problems
-
Return the first and last characters of a character array
11791 Solvers
-
Remove the two elements next to NaN value
702 Solvers
-
1481 Solvers
-
Determine the number of odd integers in a vector
819 Solvers
-
07 - Common functions and indexing 1
452 Solvers
More from this Author9
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
I believe these solutions are not right. By the profile picture it seems that each time 7 circles are generated and 1 of 7 circles is removed. At the second iteration we would have for Area, 1 - 1/3 - 6/81 which is 66/81, and not 68/81. It seems that some people found a formula used in the test suite....but that hardly represents the picture. This problem needs a better description. It is not clear at all what should be done. Sierpinski triangle divide each side by 2, Sierpinski carpet divide each side by 3, and a Sierpinski circle would divide by what number? By the profile picture, it seems that the length of the circle is to be divided by 6 (since it generates hexagon-like structures)....but this recursive step wouldn't reach the solution in the test suite.
PS: It is also possible that the user changed his profile picture, but then this would make this problem unsolvable without hacking.