Open Access. Powered by Scholars. Published by Universities.®
Discrete Mathematics and Combinatorics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Publication
- Publication Type
Articles 1 - 13 of 13
Full-Text Articles in Discrete Mathematics and Combinatorics
Divisibility Probabilities For Products Of Randomly Chosen Integers, Noah Y. Fine
Divisibility Probabilities For Products Of Randomly Chosen Integers, Noah Y. Fine
Rose-Hulman Undergraduate Mathematics Journal
We find a formula for the probability that the product of n positive integers, chosen at random, is divisible by some integer d. We do this via an inductive application of the Chinese Remainder Theorem, generating functions, and several other combinatorial arguments. Additionally, we apply this formula to find a unique, but slow, probabilistic primality test.
Irreducibility And Galois Groups Of Random Polynomials, Hanson Hao, Eli Navarro, Henri Stern
Irreducibility And Galois Groups Of Random Polynomials, Hanson Hao, Eli Navarro, Henri Stern
Rose-Hulman Undergraduate Mathematics Journal
In 2015, I. Rivin introduced an effective method to bound the number of irreducible integral polynomials with fixed degree d and height at most N. In this paper, we give a brief summary of this result and discuss the precision of Rivin's arguments for special classes of polynomials. We also give elementary proofs of classic results on Galois groups of cubic trinomials.
Combinatorial And Asymptotic Statistical Properties Of Partitions And Unimodal Sequences, Walter Mcfarland Bridges
Combinatorial And Asymptotic Statistical Properties Of Partitions And Unimodal Sequences, Walter Mcfarland Bridges
LSU Doctoral Dissertations
Our main results are asymptotic zero-one laws satisfied by the diagrams of unimodal sequences of positive integers. These diagrams consist of columns of squares in the plane; the upper boundary is called the shape. For various types of unimodal sequences, we show that, as the number of squares tends to infinity, 100% of shapes are near a certain curve---that is, there is a single limit shape. Similar phenomena have been well-studied for integer partitions, but several technical difficulties arise in the extension of such asymptotic statistical laws to unimodal sequences. We develop a widely applicable method for obtaining these limit …
Blackjack: The Math Behind The Cards, Hanna Blanchard
Blackjack: The Math Behind The Cards, Hanna Blanchard
Mathematics Senior Capstone Papers
In this paper the reader will learn about the math behind the cards in the game of Blackjack. Blackjack or “21” has been played around the world with various rules and regulations in both professional and informal environments. The ultimate objective of the game is to receive a total card value of 21, or as close to 21 as possible without exceeding it, from the cards in a player’s hand in order to beat the dealer’s total. The goal of this project is to calculate the probabilities of various hands to determine the best strategies to win 21. The probabilities …
Golden Arm: A Probabilistic Study Of Dice Control In Craps, Donald R. Smith, Robert Scott Iii
Golden Arm: A Probabilistic Study Of Dice Control In Craps, Donald R. Smith, Robert Scott Iii
UNLV Gaming Research & Review Journal
This paper calculates how much control a craps shooter must possess on dice outcomes to eliminate the house advantage. A golden arm is someone who has dice control (or a rhythm roller or dice influencer). There are various strategies for dice control in craps. We discuss several possibilities of dice control that would result in several different mathematical models of control. We do not assert whether dice control is possible or not (there is a lack of published evidence). However, after studying casino-legal methods described by dice-control advocates, we can see only one realistic mathematical model that describes the resulting …
Runs Of Identical Outcomes In A Sequence Of Bernoulli Trials, Matthew Riggle
Runs Of Identical Outcomes In A Sequence Of Bernoulli Trials, Matthew Riggle
Masters Theses & Specialist Projects
The Bernoulli distribution is a basic, well-studied distribution in probability. In this thesis, we will consider repeated Bernoulli trials in order to study runs of identical outcomes. More formally, for t ∈ N, we let Xt ∼ Bernoulli(p), where p is the probability of success, q = 1 − p is the probability of failure, and all Xt are independent. Then Xt gives the outcome of the tth trial, which is 1 for success or 0 for failure. For n, m ∈ N, we define Tn to be the number of trials needed to first observe n …
Educational Magic Tricks Based On Error-Detection Schemes, Ronald I. Greenberg
Educational Magic Tricks Based On Error-Detection Schemes, Ronald I. Greenberg
Ronald Greenberg
Magic tricks based on computer science concepts help grab student attention and can motivate them to delve more deeply. Error detection ideas long used by computer scientists provide a rich basis for working magic; probably the most well known trick of this type is one included in the CS Unplugged activities. This paper shows that much more powerful variations of the trick can be performed, some in an unplugged environment and some with computer assistance. Some of the tricks also show off additional concepts in computer science and discrete mathematics.
Educational Magic Tricks Based On Error-Detection Schemes, Ronald I. Greenberg
Educational Magic Tricks Based On Error-Detection Schemes, Ronald I. Greenberg
Computer Science: Faculty Publications and Other Works
Magic tricks based on computer science concepts help grab student attention and can motivate them to delve more deeply. Error detection ideas long used by computer scientists provide a rich basis for working magic; probably the most well known trick of this type is one included in the CS Unplugged activities. This paper shows that much more powerful variations of the trick can be performed, some in an unplugged environment and some with computer assistance. Some of the tricks also show off additional concepts in computer science and discrete mathematics.
Does Logic Help Us Beat Monty Hall?, Adam J. Hammett, Nathan A. Harold, Tucker R. Rhodes
Does Logic Help Us Beat Monty Hall?, Adam J. Hammett, Nathan A. Harold, Tucker R. Rhodes
The Research and Scholarship Symposium (2013-2019)
The classical Monty Hall problem entails that a hypothetical game show contestant be presented three doors and told that behind one door is a car and behind the other two are far less appealing prizes, like goats. The contestant then picks a door, and the host (Monty) is to open a different door which contains one of the bad prizes. At this point in the game, the contestant is given the option of keeping the door she chose or changing her selection to the remaining door (since one has already been opened by Monty), after which Monty opens the chosen …
Influences Of Probability Instruction On Undergraduates' Understanding Of Counting Processes, Kayla Blyman
Influences Of Probability Instruction On Undergraduates' Understanding Of Counting Processes, Kayla Blyman
Theses and Dissertations--Education Sciences
Historically, students in an introductory finite mathematics course at a major university in the mid-south have struggled the most with the counting and probability unit, leading instructors to question if there was a better way to help students master the material. The purpose of this study was to begin to understand connections that undergraduate finite mathematics students are making between counting and probability. By examining student performance in counting and probability, this study provides insights that inform future instruction in courses that include counting and probability. Consequently, this study lays the groundwork for future inquiries in the field of undergraduate …
On A Multiple-Choice Guessing Game, Ryan Cushman, Adam J. Hammett
On A Multiple-Choice Guessing Game, Ryan Cushman, Adam J. Hammett
The Research and Scholarship Symposium (2013-2019)
We consider the following game (a generalization of a binary version explored by Hammett and Oman): the first player (“Ann”) chooses a (uniformly) random integer from the first n positive integers, which is not revealed to the second player (“Gus”). Then, Gus presents Ann with a k-option multiple choice question concerning the number she chose, to which Ann truthfully replies. After a predetermined number m of these questions have been asked, Gus attempts to guess the number chosen by Ann. Gus wins if he guesses Ann’s number. Our goal is to determine every m-question algorithm which maximizes the probability of …
Cycle Lengths Of Θ-Biased Random Permutations, Tongjia Shi
Cycle Lengths Of Θ-Biased Random Permutations, Tongjia Shi
HMC Senior Theses
Consider a probability distribution on the permutations of n elements. If the probability of each permutation is proportional to θK, where K is the number of cycles in the permutation, then we say that the distribution generates a θ-biased random permutation. A random permutation is a special θ-biased random permutation with θ = 1. The mth moment of the rth longest cycle of a random permutation is Θ(nm), regardless of r and θ. The joint moments are derived, and it is shown that the longest cycles of a permutation can either be positively or …
Recounting The Odds Of An Even Derangement, Arthur T. Benjamin, Curtis D. Bennet, Florence Newberger
Recounting The Odds Of An Even Derangement, Arthur T. Benjamin, Curtis D. Bennet, Florence Newberger
All HMC Faculty Publications and Research
No abstract provided in this article.