Run this file on the command line using the python command with the sole argument being the power of (x+y) you wish to expand.
Example:
python binomialexpansion.py 3
Will output:
| CC = gcc | |
| CFLAGS = -I. | |
| test: main.o | |
| $(CC) -o $@ $(CFLAGS) main.o | |
| main.o: main.c | |
| $(CC) -c main.c $(CFLAGS) |
| /* | |
| * Copyright (c) 2011, Chris Dickinson | |
| * All rights reserved. | |
| * | |
| * Redistribution and use in source and binary forms, with or without | |
| * modification, are permitted provided that the following conditions are met: | |
| * * Redistributions of source code must retain the above copyright | |
| * notice, this list of conditions and the following disclaimer. | |
| * * Redistributions in binary form must reproduce the above copyright | |
| * notice, this list of conditions and the following disclaimer in the |
| var render = require("./renderer"); | |
| // The output of parser.js | |
| var t = [ | |
| { | |
| data: 'Xyz ', type: 'text' | |
| }, | |
| { | |
| type: 'script', |
| // Child filters - TBD | |
| var filters = { | |
| "nth-child": function(ctx, val){ | |
| var found = [], | |
| val = val-1; | |
| for(var j = 0; j < ctx.length; j++){ | |
| if(ctx[j][val]) | |
| found.push(ctx[j][val]); |
| # coding=UTF-8 | |
| import math | |
| inv = 1 | |
| pc = 0 | |
| lmt = 1000000 | |
| while(inv < lmt): | |
| pp = (6*inv) - 1 |
| #!/bin/bash -e | |
| # Installs the specified version of node.js | |
| # Usage: | |
| # node_update [v]0.0.0 | |
| base_dir=$HOME/GitProjects | |
| restore=$PWD | |
| if [ $# -ne 1 ] |
| # Eliptic Curve Cryptography w/ Julia! | |
| abstract EC | |
| ## The point O found at every horizontal line | |
| type ECInf <: EC | |
| end | |
| ## Points on the curve |