In this document I describe a solution to the 'marchingband' problem as stated on think-maths:
What is the fewest number of performers you require for your marching band to
have 64 marching options? (Only whole positive numbers will be accepted)
Where a 'marchingband' can march only in a rectangular shape.
| EMRO AF Afghanistan 647500 37171921 World;Asia;NonCKIR | |
| EURO AL Albania 28748 2876591 World;Europe;NonEU | |
| AFRO DZ Algeria 2381740 34178188 World;Africa;North Africa | |
| WPRO AS American Samoa (United States) 199 55465 World;Oceania;Polynesia | |
| EURO AD Andorra 468 77281 World;Europe;NonEU | |
| AFRO AO Angola 1246700 12799293 World;Africa;Central Africa | |
| AMRO AI Anguilla (United Kingdom) 91 14731 World;North America | |
| AMRO AG Antigua and Barbuda 442 96286 World;North America | |
| AMRO AR Argentina 2766890 44361150 World;South America | |
| EURO AM Armenia 29743 2951745 World;Europe;NonEU |
This gist describes my solution to Matt Parker's puzzle #8:
My solution involves looking at the pattern of folds when viewing the folded stack from the sides. And then using some python code to generate all possible ways the folds can match up in a way that you will still end up with two rows of 4 sheets.
The list below shows all ways to fold a piece of paper, including ways where the top-left ends up on the inside of the folded stack.
| #!/bin/bash | |
| # | |
| # Script which scans all your mounted timemachine volumes, and apfs snapshots for a specific file. | |
| # | |
| # Willem Hengeveld <itsme@xs4all.nl> | |
| # | |
| if [[ $(id -u) -ne 0 ]]; then | |
| sudo $0 "$@" | |
| exit $? |
| #!/bin/bash | |
| # query.sh from BreachCompilation - magnet:?xt=urn:btih:7ffbcd8cee06aba2ce6561688cf68ce2addca0a3 | |
| # works with older bash versions. | |
| # patch by Willem <itsme@xs4all.nl> | |
| dir=$( cd "$( dirname "${BASH_SOURCE[0]}" )" && pwd ) | |
| if [ "$1" != "" ]; then | |
| word1=$(echo $1 | tr A-Z a-z) | |
| letter1=$(echo $word1|cut -b1) | |
| if [[ $letter1 == [a-zA-Z0-9] ]]; then |
| """ | |
| Python script for finding a still available pretty phonenumber on the sha2017 POC network. | |
| Register your phone number on: https://poc.sha2017.org/ | |
| Author: Willem Hengeveld <itsme@xs4all.nl> | |
| This code is released under the Beerware license. | |
| """ | |
| from __future__ import print_function |
| """ | |
| Example how to decrypt whatsapp msgstore backups with extension .crypt12. | |
| Author: Willem Hengeveld <itsme@xs4all.nl> | |
| """ | |
| from Crypto.Cipher import AES | |
| import zlib | |
| import sys | |
| datafile = keyfile = None |
| # Linux kernel kallsyms unpacker | |
| # Version 0.2 | |
| # Copyright (c) 2010-2013 Igor Skochinsky | |
| # | |
| # This software is provided 'as-is', without any express or implied | |
| # warranty. In no event will the authors be held liable for any damages | |
| # arising from the use of this software. | |
| # | |
| # Permission is granted to anyone to use this software for any purpose, | |
| # including commercial applications, and to alter it and redistribute it |
| if [[ -z "$1" ]]; then | |
| exit 1 | |
| fi | |
| if [[ -e $1/bin/avr-gcc-7.1.0 ]]; then | |
| cppopt=gnu++1z | |
| elif [[ -e $1/bin/avr-gcc-4.9.2 ]]; then | |
| cppopt=gnu++11 | |
| else | |
| echo unknown compiler version |
| #!/bin/bash | |
| GREPARGS=() | |
| FINDPATHS=() | |
| while [[ $# != 0 ]]; do | |
| if [[ -d "$1" ]]; then | |
| FINDPATHS+=("$1") | |
| else | |
| GREPARGS+=("$1") | |
| fi | |
| shift |