2024-03-27 04:21:52 +0200 | received badge | ● Popular Question (source) |
2024-03-27 04:21:52 +0200 | received badge | ● Notable Question (source) |
2016-11-03 03:17:51 +0200 | received badge | ● Scholar (source) |
2016-11-03 03:16:53 +0200 | received badge | ● Supporter (source) |
2016-04-23 21:14:14 +0200 | received badge | ● Student (source) |
2016-04-23 13:39:09 +0200 | asked a question | Drawing all paths from (0, 0) to (n, n) moving one unit right or up This question is just the same as this one made for Mathematica. I saw it and I was trying to reproduce it in Sage just for fun, but it's getting longer than I like and I would love to know your approach in Sage. I think it's a great way to learn. This is half of my try: At this point the list of list called paths is not well constructed. I realized I would have to put some How would you do it? |