id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
elements-9303	Diep-Nguyen, Arthur	Dreibens Modulo 7: A New Formula for Primality Testing	2016	11	.pdf	application/pdf	3237	140	77	In other words, one would have yet another method to determine the number of dreibens of length n divisible by 7. 98 ElEmEnts : : spring 2016 conclusIon While we are still far from determining whether the set of prime dreibens is finite or infinite, our exploration of dreibens modulo 7 has cast much light on the problem. We can perform similar calculations for An where n ≡ 1, 2, 3, 4, 5 (mod 6), thereby allowing us to quickly find An for any n. Hence, we can easily determine An for any n, allow- ing us to rule out many composite dreibens.	cache/elements-9303.pdf	txt/elements-9303.txt