Pascals triangle example: you have n friends you want to invite k of them how many combinations can you make if they cant just be in a different order (ex ABC = BAC or ABC = ACB) the book also taught me about scratches flintmax (floating point integer limit) where scratch stops being accurate with its calculations scratch's is 9007199254740992 SO DO NOT PUT BIG NUMBERS PLEASE
