DescriptionWhile computers have long been used for numeric computations, their growing power to handle symbolic manipulations is becoming increasingly useful in mathematics. Our "experimental mathematics" approach uses symbolic computing as an essential tool to both conjecture and prove new results, often with little or no human intervention. Here, we will illustrate how we used experimental mathematics to explore several combinatorial problems. Namely, we will start out with a brief analysis of the generating functions of some statistics associated with random walks in the plane. Then, we will do the same for certain families of simultaneous core integer partitions; this constitutes the bulk of the thesis and contains our main results. We will briefly cover our attempts to apply computer implementations of inclusion-exclusion to Ramsey theory and Boolean satisfiability. Finally, we will introduce a Boolean analog of Erdos' integer covering systems and go over some related results and conjectures.