Mischa Rodermond mrpapercut

Running PRP tests

Let's say you want to find all PRPs with the form k^n+n for k = 6 and n < 10000

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")

	<?php

	class T5KParser {
	private $primelistURL = 'https://t5k.org/primes/lists/all.txt';
	private $primelistRaw;

	public $primes = [];
	public $proofcodes = [];

	public function parse() {

	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++;

	class NumberFormatter {
	constructor() {

	}

	toDec(numstr) {
	return parseInt(numstr, 10).toString(10);
	}

	toHex(numstr) {