prob134(N,startNum=4)=
{
	\\ answer = 18613426663617118
	t = 0;
	startNum++;
	default(primelimit,10000000);
	forprime(p1=startNum,N,
		p2 = nextprime(p1+1);
		d = 0;
		m = 1;
		n = 0;
		f = (10^(length(Strtex((p1)))));
		while (! d,
			n = m * p2;
			l = n % f;
			if (l == p1, d = 1);
			m+=2; \\ can assume the multiplication will always be an odd number
		);
		t += n;
		print1 (p1);
		print1 (": ");
		print (t);
	);
	print ("--");
	print (t);
}