I hereby claim:
- I am ha0ye on github.
- I am hao_and_y (https://keybase.io/hao_and_y) on keybase.
- I have a public key ASALs4BLGzLmT9iU4H5GOc11WPPLg9KQvuwvbLG8MntrQwo
To claim this, I am signing this object:
Hao Ye ha0ye
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| travis_fold:start:worker_info | |
| [0K[33;1mWorker information[0m | |
| hostname: 12607e0a-d790-494c-abc0-33bec19d51ab@1.production-1-worker-org-a-4-gce | |
| version: v3.6.0 https://github.com/travis-ci/worker/tree/170b2a0bb43234479fd1911ba9e4dbcc36dadfad | |
| instance: travis-job-a2fd8785-6b65-4c56-b87e-cbd4d1016e0f travis-ci-garnet-trusty-1512502259-986baf0 (via amqp) | |
| startup: 26.186769693s | |
| travis_fold:end:worker_info | |
| [0Ktravis_fold:start:system_info | |
| [0K[33;1mBuild system information[0m | |
| Build language: ruby |
ha0ye
/ keybase.md
Created
May 26, 2017 21:09
ha0ye
/ partition function calculator.R
Last active
March 29, 2017 00:47
Compute the Partition Function Q: the number of ways of writing n as a sum of positive integers, disregarding order, but with the constraint that all integers are distinct.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # For more info, see http://mathworld.wolfram.com/PartitionFunctionQ.html | |
| # This uses the 2nd recurrence relation defined therein. | |
| max_n <- 1000 | |
| # helper function | |
| s <- integer(length = max_n) | |
| for(j in 1:sqrt((2*max_n+1)/3)) | |
| { | |
| n <- j * (3 * j + 1) / 2 |
NewerOlder