Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 7482 for “"Numbers"”.
-
On numbers
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Linguistics and Philosophy, 1984.
-
Perfect numbers and other numbers defined by the sum of their divisors
Perfect, abundant, and deficient numbers are defined in terms of the sum of the divisors function. The history and the discovery of perfect numbers is discussed, and the question of the existence of an odd perfect number is considered. There is a discussion of amicable pairs and multiply perfect …
-
Betti numbers / Lambert series
Text includes handwritten formulas
-
Expectation Numbers of Cyclic Groups
… properties for the first and second expectation numbers of large cyclic groups. The first chapter introduces the kth expectation number. This formula allows us to determine the expected size of any group. Explicit examples and computations of the first and second expectation number are given in …
-
Historic development of prime numbers
… thesis is to investigate the history of prime numbers and development of prime number theory. There are three major sections to this thesis, Ancient times, Dark Ages, and Modern times. The ancient time's section has topics on the `Ishango Bone', `Rhine Papyrus' with an investigation of Egyptian …
-
Some Results on Crossing Numbers
The drawing of the complete graph in which the vertices are placed on the rims of a cylinder and connected with geodesic edges is conjectured to produce the minimum number of edge crossings for a complete graph, which is its crossing number. This dissertation proves that no edge in this drawing can …
-
Complex Dynamics and Salem Numbers
For the second subject, we study certain sequences of polynomials that can provide a lower bound for a Salem number produced by Boyd's method [5], [6]. We establish a result that if P is a polynomial satisfying a suitable condition then we can find the lower bound for deg P - 2 P1P' 1 .
-
Periodic Bernoulli Numbers and Polynomials
Made available in DSpace on 2014-12-14T13:09:45Z (GMT). No. of bitstreams: 1 8009200.pdf: 1901905 bytes, checksum: fd94244d4e5dd00fb27c129d8a14e348 (MD5) Previous issue date: 1979
-
Hyperarithmetical Functions of Ordinal Numbers
Made available in DSpace on 2014-12-09T22:17:35Z (GMT). No. of bitstreams: 1 6706674.pdf: 1481875 bytes, checksum: 8a50fea5076bb690649350539813f6e9 (MD5) Previous issue date: 1966
-
On the metaphysics of numbers
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Linguistics and Philosophy, 1990.
-
Brjuno Numbers and Complex Dynamics
The Brjuno numbers play a fundamental role in the study of the 1-dimensional Complex Dynamics Theory. In this work we examine the proof of the Brjuno theorem by using elements of Number Theory. We also examine the topological version of the proof given by J. Yoccoz and his renormalization …
-
Safety in Numbers? The Effect of Increasing Numbers of Bicycle Commuters on Bicycle-Automobile Collisions
The idea that increasing the numbers of bicycle and pedestrians in an area lowers the automobile collision risk for individual cyclists and pedestrians is called the safety in numbers effect. This paper applies the safety in numbers effect to bicycling and pedestrian commuters in California cities …
-
Safety in Numbers? The Effect of Increasing Numbers of Bicycle Commuters on Bicycle-Automobile Collisions
The idea that increasing the numbers of bicycle and pedestrians in an area lowers the automobile collision risk for individual cyclists and pedestrians is called the safety in numbers effect. This paper applies the safety in numbers effect to bicycling and pedestrian commuters in California cities …
-
On the Pebbling Numbers of Graphs
Graph pebbling is an application which has evolved from the study of graph theory. The goal of pebbling in a graph is to use pebbling steps to move one pebble onto a designated root vertex. A pebbling step is produced by taking two pebbles from a vertex, moving one of them to an adjacent vertex, …
-
Bounds on Total Domination Subdivision Numbers.
<p>The domination subdivision number of a graph is the minimum number of edges that must be subdivided in order to increase the domination number of the graph. Likewise, the total domination subdivision number is the minimum number of edges that must be subdivided in order to increase the total …
Page 1 of 375