Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Publication
- Publication Type
Articles 1 - 3 of 3
Full-Text Articles in Number Theory
On Rugina’S System Of Thought, Florentin Smarandache
On Rugina’S System Of Thought, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
This article investigates Rugina's orientation table and gives particular examples for several of its seven models. Leon Walras's Economics of Stable Equilibrium and Keynes's Economics of Disequilibrium are combined in Rugina's orientation table in systems which are s percent stable and 100 ÿ s percent unstable, where s may be 100, 95, 65, 50, 35, 5, and 0. Classical logic and modern logic are united in Rugina's integrated logic, and then generalized in neutrosophic logic.
The Rsa Cryptosystem, Rodrigo Iglesias
The Rsa Cryptosystem, Rodrigo Iglesias
Williams Honors College, Honors Research Projects
This paper intends to present an overview of the RSA cryptosystem. Cryptosystems are mathematical algorithms that disguise information so that only the people for whom the information is intended can read it. The invention of the RSA cryptosystem in 1977 was a significant event in the history of cryptosystems. We will describe in detail how the RSA cryptosystem works and then illustrate the process with a realistic example using fictional characters. In addition, we will discuss how cryptosystems worked prior to the invention of RSA and the advantage of using RSA over any of the previous cryptosystems. This will help …
An Algorithm To Determine All Odd Primitive Abundant Numbers With D Prime Divisors, Jacob Liddy
An Algorithm To Determine All Odd Primitive Abundant Numbers With D Prime Divisors, Jacob Liddy
Williams Honors College, Honors Research Projects
An abundant number is said to be primitive if none of its proper divisors are abundant. Dickson proved that for an arbitrary positive integer d there exists only finitely many odd primitive abundant numbers having exactly d prime divisors. In this paper we describe a fast algorithm that finds all primitive odd numbers with d unique prime divisors. We use this algorithm to find all the number of odd primitive abundant numbers with 6 unique Divisors. We use this algorithm to prove that an odd weird number must have at least 6 prime divisors.