•  
  •  
 

Abstract

Abstract. Motivated by the theory of Cayley hash functions, we aim to write a matrix as a product of another set of given matrices. Riley gave such an algorithm using Fibonacci numbers. We extend Riley’s work to the Pell numbers. We compare our algorithm to Riley’s method and find that it is an improvement in certain cases.

Author Bio

This work was completed for the NSF IUSE - Scholars Academy Research program as a continuation of an NSF poster project I did over the summer with my current advisor. As for a bit about me, I am a student at Kean University, double majoring in Computer Science and Mathematics. My goal after university is to become a quantitative trader and work at a hedge fund. I also plan on pursuing at least a master's degree after finishing my undergraduate research. I have a lot of hobbies that I enjoy in my free time, such as billiards and fishing.

Included in

Algebra Commons

Share

COinS