Dreibens Modulo 7: A New Formula for Primality Testing

Abstract

In this paper, we discuss strings of 3’s and 7’s, hereby dubbed “dreibens.” As a first step towards determining whether the set of prime dreibens is infinite, we examine the properties of dreibens when divided by 7. by determining the divisibility of a dreiben by 7, we can rule out some composite dreibens in the search for prime dreibens. We are concerned with the number of dreibens of length n that leave a remainder i when divided by 7. By using number theory, linear algebra, and abstract algebra, we arrive at a formula that tells us how many dreibens of length n are divisible by 7. We also find a way to determine the number of dreibens of length n that leave a remainder i when divided by 7. Further investigation from a combinatorial perspective provides additional insight into the properties of dreibens when divided by 7. Overall, this paper helps characterize dreibens, opens up more paths of inquiry into the nature of dreibens, and rules out some composite dreibens from a prime dreiben search.