Division of Informatics
Forrest Hill & 80 South Bridge
#943 | |
|---|---|
| Title: | Refactorable Numbers - A Machine Invention |
| Authors: | Colton,SG |
| Date: | Feb 1999 |
| Presented: | Appearing in the Journal of Integer Sequences, Vo12, Article 99.1.2 |
| Keywords: | |
| Abstract: | The HR (or Hardy-Ramanujan) program invents and analyses definitions in areas of pure mathematics, including finite algebras, graph theory and number theory. While working in number theory, HR recently invented a new integer sequence, the refactorable numbers, which are defined and developed here. A discussion of how HR works, along with details of well known sequences reinvented by HR and other new sequences invented by HR is also given. |
| Download: | NO ONLINE COPY |
![[Search These Pages]](http://www.dai.ed.ac.uk/icons/dai_search.gif){kind=icon}
![[DAI Home Page]](http://www.dai.ed.ac.uk/icons/dai_home.gif){kind=icon}
![[Comment]](http://www.dai.ed.ac.uk/icons/dai_comment.gif){kind=icon}