On the Foundation of Abstract Algebra. II

1936 ◽  
Vol 37 (2) ◽  
pp. 265 ◽  
Author(s):  
Oystein Ore
Keyword(s):  
Abstract Algebra ◽  
Algebra Ii

Lectures in Abstract Algebra. II: Linear Algebra

1955 ◽  
Vol 39 (327) ◽  
pp. 76
Author(s):  
W. Ledermann ◽  
Nathan Jacobson
Keyword(s):  
Linear Algebra ◽  
Abstract Algebra ◽  
Algebra Ii

scholarly journals Including School Mathematics Teaching Applications in an Undergraduate Abstract Algebra Course

PRIMUS ◽  
2021 ◽  
pp. 1-29
Author(s):  
James A. Mendoza Alvarez ◽  
Andrew Kercher ◽  
Kyle Turner ◽  
Elizabeth G. Arnold ◽  
Elizabeth A. Burroughs ◽  
...  
Keyword(s):  
Mathematics Teaching ◽  
Abstract Algebra ◽  
School Mathematics

Achievement in algebra II using computer programming

1979 ◽  
Vol 13 (2) ◽  
pp. 9-14
Author(s):  
Michael P. Tilford
Keyword(s):  
Computer Programming ◽  
Algebra Ii

Structure factor algebra. II

1957 ◽  
Vol 10 (9) ◽  
pp. 606-607 ◽  
Author(s):  
E. F. Bertaut ◽  
J. Waser
Keyword(s):  
Structure Factor ◽  
Factor Algebra ◽  
Algebra Ii

A Little Color in Abstract Algebra

1982 ◽  
Vol 89 (6) ◽  
pp. 417 ◽  
Author(s):  
G. P. Wene
Keyword(s):  
Abstract Algebra

scholarly journals Dreibens Modulo 7: A New Formula for Primality Testing

Elements ◽  
2016 ◽  
Vol 12 (1) ◽  
Author(s):  
Arthur Diep-Nguyen
Keyword(s):  
Number Theory ◽  
Linear Algebra ◽  
Abstract Algebra ◽  
Additional Insight ◽  
Primality Testing ◽  
New Formula ◽  
Insight Into ◽  
Rule Out

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.

Sign in / Sign up

Export Citation Format

Share Document