Let's say you want to find all PRPs with the form k^n+n for k = 6 and n < 10000
https://sourceforge.net/projects/openpfgw/
Go to https://pinetools.com/generate-list-numbers
In our example, you would fill in the following:
| class NumberFormatter { | |
| constructor() { | |
| } | |
| toDec(numstr) { | |
| return parseInt(numstr, 10).toString(10); | |
| } | |
| toHex(numstr) { |
| const bitstringToBigInt = bstr => { | |
| let counter = 0n; | |
| let byteindex = 0n; | |
| for (let i = bstr.length - 1; i >= 0; i--) { | |
| if (bstr[i] === '1') { | |
| counter += 2n**byteindex; | |
| } | |
| byteindex++; |
| <?php | |
| class T5KParser { | |
| private $primelistURL = 'https://t5k.org/primes/lists/all.txt'; | |
| private $primelistRaw; | |
| public $primes = []; | |
| public $proofcodes = []; | |
| public function parse() { |
Let's say you want to find all PRPs with the form k^n+n for k = 6 and n < 10000
https://sourceforge.net/projects/openpfgw/
Go to https://pinetools.com/generate-list-numbers
In our example, you would fill in the following:
| using Primes | |
| function appendLeft(num, base, prims = []) | |
| for n in 1:(base-1) | |
| leftAppended = parse(BigInt, "$n$num", base = base) | |
| if isprime(leftAppended) | |
| appendLeft("$n$num", base, prims) | |
| else | |
| if ("$num" in prims) == false | |
| push!(prims, "$num") |
| /* "<name of block>": [<start of block>, <end of block>] */ | |
| { | |
| "Basic Latin": [0x0000, 0x007F], | |
| "Latin-1 Supplement": [0x0080, 0x00FF], | |
| "Latin Extended-A": [0x0100, 0x017F], | |
| "Latin Extended-B": [0x0180, 0x024F], | |
| "IPA Extensions": [0x0250, 0x02AF], | |
| "Spacing Modifier Letters": [0x02B0, 0x02FF], | |
| "Combining Diacritical Marks": [0x0300, 0x036F], | |
| "Greek and Coptic": [0x0370, 0x03FF], |
| DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE | |
| Version 2, December 2004 | |
| Copyright (C) 2004 Sam Hocevar <sam@hocevar.net> | |
| Everyone is permitted to copy and distribute verbatim or modified | |
| copies of this license document, and changing it is allowed as long | |
| as the name is changed. | |
| DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE |
| #!/usr/bin/env python3 | |
| import binascii | |
| import socket | |
| import sys | |
| from collections import OrderedDict | |
| # See https://web.archive.org/web/20180919041301/https://routley.io/tech/2017/12/28/hand-writing-dns-messages.html | |
| # See https://tools.ietf.org/html/rfc1035 |
| // Force latest tweets | |
| let twid_cookie = document.cookie.split(/;\s?/).filter(c => /^twid=/.test(c))[0]; | |
| if (twid_cookie) { | |
| let twid = twid_cookie.replace('twid=u%3D', ''); | |
| let forceRefresh = false; | |
| // Get DB | |
| let req = window.indexedDB.open('localforage', 2); | |
| req.onerror = ev => { |