r/MathForAll • • Mar 28 '15

ProSet 1: Divisibility and Factors

32 Upvotes

Welcome to the first post of the MathForAll subreddit. I am going to hit the ground running with a problem set ("ProSet" for short).

Each week, I will try to post a few problems for your minds only :). I will definitely include several problems that are accessible to many, but may also include 1 or 2 more challenging ones.

This week the theme is divisibility. And without further ado:

  • What is the smallest number over a trillion divisible by 6?

  • What is the smallest number over a trillion divisible by 9?

  • What is the smallest number over a trillion divisible by 11?

  • What is the smallest number over a trillion divisible by 7?

  • What is the smallest number over a trillion divisible by 1250? HINT at bottom.

  • What is the smallest number over a trillion divisible by 1024? Hint at bottom.

  • Find all prime numbers that divide 2 trillion.

  • Find all prime numbers that divide 3 trillion.

  • Find all prime numbers that divide 91 trillion.

  • Find all prime numbers that divide 99 trillion.

Challenge:

  • Suppose f(x) = x2 - 4x + 4. Is (f(100))10 divisible by 2? How about 5? How about 7?

HINT: Some of the above were powers of 2 or powers of 5 :)


r/MathForAll • • Mar 30 '15

Put something in the sidebar/description

30 Upvotes

What is this sub?


r/MathForAll • • Mar 29 '15

ProSet 2: Sequences Part I (A Discovery ProSet)

29 Upvotes

I am getting ahead in the ProSet's.

So a sequence is just a list of numbers that goes on forever. An example would be 0, 1, 2, 3, 4 ... Now the "..." means "follow the pattern and continue writing the next number in the pattern until your laptop is covered in your blood." Seriously, though it means follow the pattern as best you can.

Here are three types of sequences (many others exist):

*arithmetic -- consecutive elements have the same increment or decrement.

Example: 4, 6, 8, 10, 12 ... The pattern is keep adding 2.

*geometric -- consecutive elements have the same ratio (note here the ratio can be a fraction).

Example: 162, 108, 72, 48, 16, 32/3 ... Keep multiplying by 2/3.

*Fibonacci -- The third term is the sum of the first two terms. The fourth term is the sum of the second and third term. The fifth term is the sum of the third and fourth term ...

Example: 1, 1, 2, 3, 5, 8, 13, 21 ... How do I get those? The first two are BOTH 1: 1, 1, 1 + 1, 1 + 2, 2 + 3, 3 + 5, 5 + 8 ...

What is the 100th number in the following arithmetic sequences:

1, 2, 3, 4, 5 ...

5, 10, 15, 20 ...

-1, -2, -3, -4, -5 ...

2, 3, 4, 5, 6 ...

7, 12, 17, 22 ...

What is the 10th number in the following geometric sequences:

1, 2, 4, 8, 16 ...

5, 10, 20, 40 ...

-1, 1, -1, 1, -1 ...

2, 4, 8, 16 ...

1000, 400, 160, 64 ... (hint: it is a fraction)

Fill in the missing piece! Use the numbers given to see if the sequence can be arithmetic, geometric, or Fibonacci. Then fill in the missing information.

1, ___, 7, 10, 13 ...

1, ___, 7, 13, 20 ...

10, 7, ___, 1, ...

8, 12, ___, 27 ...

Discovery Activity: Plot the value versus positions of any arithmetic graph. So for (5, 10, 15, 20) you would graph (1, 5), (2, 10), (3, 15), (4, 20). Again (position, value at that position). What is special about arithmetic sequences when graphed in such away?

Take two arithmetic sequences and create another sequence by adding the same entries together. Is the resulting sequence also?

Try adding two Geometric sequences. What do you find? How about two fibonacci?

Hmm ...

-ForgetsID


r/MathForAll • • Mar 30 '15

Game Theory, Part 1

26 Upvotes

Consider 2-player games satisfying the following:

  • Both players can make the same moves from the same position.

  • The game ends after a finite number of turns (no infinite loops).

  • Exactly one player wins when the game ends (no ties).

  • There is no randomness.

  • Both players know everything about the rules of the game and the current position (perfect information).

  • Players alternate turns.

These are called impartial combinatorial games.

Examples of games that aren't impartial combinatorial games:

  • Chess-One player can only move white pieces, and the other player can only move black pieces.

  • Chopsticks-There are infinite loops.

  • Tic Tac Toe-There are ties.

  • Coin Flip-Random.

  • Poker-You don't know other players' hands.

  • Prisoner's Dilemma-Simultaneous play.

Examples of impartial combinatorial games:

  • Nim: Start with some piles of stones. On your turn, you remove any positive number of stones from a single pile. The player who takes the last stone wins.

  • Subtraction games: Like Nim, but you can only take specific numbers of stones from a pile. (e.g. Remove up to 4 stones, remove a factor of the number of stones in the pile, remove a power of 3 stones, etc.)

  • Green Hackenbush: Draw lines up from the ground, with more lines connected to them (a rooted graph). On your turn, erase a line. Any lines left "floating," not connected to the ground/root, are also erased. The player who removes the last line wins.

  • Chomp: Start with a rectangular piece of chocolate perforated into smaller squares. On your turn, pick one square and eat everything up and to the right of it. The player who eats the last (bottom left) square loses.

  • Sprouts: Start with a bunch of dots. On your turn, connect two dots with a (not necessarily straight) line that doesn't intersect any other lines, and put a new dot on the line. Each dot can only have three lines coming out of it (a new dot on a line already has two). The last player who can move wins.

  • Brussels Sprouts: Like Sprouts, but instead of dots, you use "X"s. Each "X" can have four lines, one in each prong of the X. When you add a line, you draw a short segment across it to add an "X."

  • Soy Sprouts: Like Brussels Sprouts, but adding an "X" on your line is optional.

  • Wyt Queens: Place some queens on a quarter-infinite chessboard. On your turn, move a queen. Queens move like in chess, but they can only move up, right, and up-right (towards the corner). Queens can move through each other and stand on the same square. The last player to move wins.

  • Wyt Kings, Nights, or Rooks: Same as Wyt Queens, but with other pieces.

Questions:

  • In each of these games, can you figure which player can always win in any starting position? Which positions are first-player wins and which are second-player wins?

  • What happens when you "add" games? (Put together two games, on your turn you move in one of them)

  • What if we remove one (or more) of the restrictions on our games?

  • What other interesting combinatorial games are there?

At least one of the games I listed is unsolved, at least one is trivially boring to play, and at least one is solved but interesting. You can play them with each other (or with me) in the comments.


r/MathForAll • • Mar 30 '15

Ten Minute Challenges: Order of Operations [No Calculator]

16 Upvotes

Hello, /r/mathforall! I have access to a few interesting math problems and I thought you might be interested in them. These problems are from local competitions among several different high schools in the area where these competitions were held.

The questions below are ordered in groups of three, with the first question being the easiest, the second being a bit harder, and the third being the hardest. You have ten minutes to solve each group of three problems. Of course, you don't have to time yourself if you don't want to, but it makes for an interesting challenge. Additionally, if you want to keep track of your score, then simply use whatever number the question is as point values (for example, question 3 is worth three points). See if you can get a perfect eighteen!

The subject of these questions is Order of Operations. All of these questions deal with working out the nature of arithmetic equations and expressions.

Ready...Set...GO!


  1. Let the operation ∆ be defined for positive integers a and b by a∆b = ab + b. If x∆(x-1) = 323, find x∆(x+1).

2. If a#b#c = a^-b + c^-a - abc, then compute the value of 4#(-2)#(-2)-1 .

3. If no order of operations existed, name all unique solutions there would be to the following problem:

12+8÷4-2

Answers (Please excuse the childish handwriting.)


  1. Using the numbers 3, 5, 7, and 9 (exactly once each), and the symbols -, ×, and ÷ (exactly once each), and no parentheses, write an expression whose value is 32. (For example, if you were asked for an expression whose value was 25.6, you could write 9 × 3 − 7 ÷ 5.)

2. Let the operations ⊕ and ⊗ be defined as follows: x ⊕ y = x^y + y^x and x ⊗ y = x^y · y^x . Note that, in the order of these operations, ⊗ takes precedence over ⊕, which takes precedence over all other operations. Compute 1 ⊗ 2 ⊕ 3 ⊗ 1.

3. Suppose that 4/9 is found to the nearest hundredth, and this approximation is subtracted from the exact value of 4/9. The multiplicative inverse of this difference is the square of a positive number. Compute this positive number.

Answers


  1. Let M be the value of 2 × 3 + 4 × 5 if the standard order of operations is not used and the operations are performed from left to right. Let N be the value of 2 × 3 + 4 × 5 if the standard order of operations is used. Compute M − N.

2. Compute the value of (((· · ·((1 − 2) + 3) − 4) + 5) − · · ·) − 2014).

3. Starting with the number 100, suppose you perform the following four operations: add 4, subtract 4, multiply by 4, and divide by 4, one after another, each exactly once, but not exactly in that order. Compute the greatest number that can result from this process.

Answers


r/MathForAll • • Mar 30 '15

Introduction: Primes

15 Upvotes

We call a number prime if it isn't divisible by anything other than itself and 1. The first few primes are 2, 3, 5, 7, ...

1 doesn't count as a prime; although it sort of satisfies our definition, its properties are very different than the ones that primes have and it doesn't really make sense to group it with them.

Here's one way in which primes can be very useful: Every single number can be written as the product of primes in just one way! For example, 2015 is 5*13*31, and 90 is 2*3*3*5 (notice that we have 3 twice, which we're allowed to do).

This list of primes that multiplies out to some number is called that number's prime factorization, and the primes that are factors of it are called, unsurprisingly, prime factors. Try this out with some other numbers to get a sense of how prime factorizations work!

Here are some facts about primes that you should try to convince yourself of. If you're having trouble, look at the Divisibility and Factors ProSet and try listing some more prime numbers (work them out by hand, it will help).

  • 2 is the only even prime number.

  • After 5, all primes end in 1, 3, 7, or 9.

  • 3, 5, and 7 are the only three odd numbers that are in consecutive order and are all prime. For example, out of 29, 31, and 33, only the first two are prime.

  • There are an infinite number of primes.

That last one is a little more difficult to grasp, because even though it seems true, the primes look like they're getting less common as we increase. How do we know they won't run out? Well, there's a proof that there are infinitely many primes, and it goes like this:

Suppose you've found every single prime, and you've put them into a big list. I'm going to find a prime that isn't on your list, by multiplying them all together and adding 1. My number is one more than a multiple of each prime on your list, which means that it can't be a multiple of any of them. So my number has prime factors that aren't on your list! This means that no matter how long of a list you write, there will be prime numbers that aren't on it.

Here are some problems to work on related to primes:

  • Think back to Sequences Part 1. Can you come up with an arithmetic sequence whose first 3 terms are prime? First 4? 5? 6?

  • What can you say about the differences between consecutive terms in sequences like that?

  • I've got a rule for working out if a number is prime. After 5, I say that a number is prime is its last digit is 1, 3, 7, or 9 and the sum of its digits isn't a multiple of 3. Unfortunately, my rule doesn't work. What the first number that I'm wrong about?

  • If I list all the prime numbers in order, will I ever write two numbers that are separated by 5 or more? By 10 or more?

  • Try writing even numbers (greater than 2) as the sum of 2 primes. Can you always do it?

  • Twin primes are primes that are only two apart - for example, 11 and 13. Are there infinitely many twin primes as well?

As it turns out, these last two questions are famous unsolved problems that no one knows the answers to! Prime numbers aren't just a useful tool in cryptography (though they very much are) - they are at the heart of some very difficult and fundamental math problems.


r/MathForAll • • Mar 30 '15

A History of Mathematics in 54 Minutes

Thumbnail
youtube.com
13 Upvotes

r/MathForAll • • Apr 04 '15

Game Theory, Part 2: Nim

10 Upvotes

Nim is a simple impartial combinatorial game. To play Nim, start with some piles of objects (stones, sticks, etc., or just a list of numbers). On your turn, you remove any (positive) number of objects from any one pile. The person who takes the last object wins (equivalently, the first player who can't move loses).

I will write a position in Nim as an ordered n-tuple, e.g. (1,2,3) is the position with a pile of 1, a pile of 2, and a pile of 3. The legal moves from (1,2,3) are (0,2,3), (1,1,3), (1,0,3), (1,2,2), (1,2,1), and (1,2,0).

We call a position a "P-position" if the previous player can force a win, and an "N-position" if the next player can. ("Winning" and "Losing" positions are somewhat ambiguous; it's winning for which player?)

  • (), or (0), is a P-position.

  • A one-pile game, (n) for n>0, is an N-position.

  • (n,n) is a P-position.

Make sure you understand why each of these is true! How can either the previous or next player force a win?

If you "add" two P-positions, what do you get? What about two N-positions, or one of each? Or do you need more information about the positions? (The sum of two positions in Nim is found by combining the two positions; (1,2,3)+(4)=(1,2,3,4))

The ultimate goal is to find an easy way to tell whether a position is N or P. Do you have any ideas for what the rule might be? Try small cases, and look for a pattern.


r/MathForAll • • Apr 02 '15

Doodling in Math: Sick Number Games

Thumbnail
youtube.com
10 Upvotes

r/MathForAll • • Mar 31 '15

Mathematics as an Aesthetic Discipline

Thumbnail euclid.nmu.edu
9 Upvotes

r/MathForAll • • Mar 30 '15

ProSet 3: Turtles and Races (Math Storytime)

9 Upvotes

Apologies for the initial bumps. Hopefully this subreddit will be awesome soon :).

Deleted my original ProSet 3 to have a more light-hearted post. In fact I think having a story every 3-5 posts is fine, but we will see how things go.

Xeno's (a.k.a. Zeno's) Paradox

Xeno (look him up!) had a funny thought about Achilles and a turtle having a race.

Let us say Achilles runs 10 times faster than a turtle and the two have a race where the turtle has a 1000 m lead.

Again the turtle is 1/10th as fast as Achilles but the turtle gets a head start of 1000 m.

So (according to Xeno) the race proceeds thusly: Achilles makes up the original distance apart of 1000 m and he is rather happy with himself because the race is almost over and he can avoid the embarrassment of being beat by a turtle. Or IS the race over?

So Achilles looks ahead and sees that the turtle has moved forward another 100 m. So Achilles starts to run again. He runs 100m to where the turtle was, but the turtle runs another 10 meters. Sheesh!! This goes on for a bit and Zeno contends that Achilles cannot beat the turtle!! The sneaky green guy is always getting ahead and Achilles is always playing catch-up.

So let us add up the first few numbers. Achilles runs 1000 m then 100 m then 10 m then 1 m then 0.1 m ... So the sum of the first 2 distances is 1100 m. The sum of the first 3 distances is 1110 m. The sum of the first 4 distances is 1111 m. Here is the pattern for a while:

1000, 1100, 1110, 1111, 1111.1, 1111.11, 1111.111 ...

The numbers above represent the total amount of distance Achilles runs. Three possible ways to think about this:

  1. if you know your decimals, you might see that 1111.11111.... looks like 1111 1/9.

  2. If you know your geometric series formulas, you know that the total distance is (using Geometric series) 1111 1/9

  3. Just by looking at it we are adding digits to the END of the number. This means all this adding will never become more than 1111.11112.

All three of these observations imply that adding together an infinite number of numbers together can be bounded (bounded -- strictly between two real values). That is to say: 1 + 1 + 1 + 1 ... will eventually get bigger than ANY real number you name. Yet, our problem: 1000 + 100 + 10 + 1 + 0.1 + 0.01 + 0.001 can never be over 1111.11112?!? Again you can add an infinite number of things and it may turn out that the sum will never get over a certain number (1111.11112 for us). So when Achilles runs 1111.11112 meters he will have beaten the turtle. Hooray, Achilles!

-ForgetsID


r/MathForAll • • Mar 31 '15

A Mathematician's Lament

Thumbnail maa.org
8 Upvotes

r/MathForAll • • Oct 26 '18

This article about slide rules has a great explanation of logarithms that is beginner-friendly

Thumbnail
tryretool.com
7 Upvotes

r/MathForAll • • Aug 19 '15

Trick to accurately convert Celsius to Fahrenheit in your head. (x post from how to)

7 Upvotes

I'm sure this is a known trick to some, but I was messing around with Celsius to Fahrenheit and looking at the relationships. If you're not familiar the written formula is C = F * 9/5 + 32. I call this on the fly method DAS Celsius converter as a little mnemonic, cause das Germans use celsius and it stands for Double, ADD, Subtract.

  • Double the celsius value

  • Add 32

  • Subtract 10% of the doubled value

    (This last one sounds more complicated than it is, just moving a decimal point.)

Examples:


Celsius = 37

Doubled = 74

Add 32 = 106

Subtract 7.4 = 98.6


Celsius = 58

Doubled = 116

Add 32 = 148

Subtract 11.6 = 136.4


(negative temps to, but make sure you subtract a negative, i.e. add)

Celsius = -13

Doubled = -26

Add 32 = 6

Subtract -2.6 = 8.6


Notes:

  • If you don't like subtracting decimals, just round it then subtract, you'll be pretty damn close and it's a little easier to do on the fly.

  • The formula for this method is F = 2C - C/5 +32


r/MathForAll • • Apr 08 '15

Participate in the Online Math Open! It's a 10 day long math competition where you get in a group and try and solve 30 challenging math problems. All the problems utilize high school skills, but that doesn't make them any less hard. The competition started 3 days ago, but check them out anyway!

Thumbnail internetolympiad.org
7 Upvotes

r/MathForAll • • Apr 22 '15

Game Theory, Part 4: Solving Nim and Subtraction Games

6 Upvotes

In parts 2 and 3, I challenged you to find all winning positions for nim and some subtraction games. Let's find them.

To recap, a P-position is a position from which the previous player (the one who just moved) can force a win, and and N-position is one from which the next player (the one whose turn it is) can force a win. Nim is played with several piles of stones, and a legal move is to remove any number of stones from any one pile. A subtraction game is usually played with one pile of stones, and a legal move is to remove a "valid" number of stones (see part 3 for examples.) In both games, the first player who can't move loses (almost equivalently, the player to take the last stone/the player to make the last move wins).

Let's do nim first. Starting with simple positions:

  • (0) is P, since the next player can't move, and loses.

  • (n) for n>0 is N, since the next player takes all the stones, forcing a win.

  • (1,1) is P, since the next player has to move to (1), which is N.

  • (1,2) is N, since the next player can move to (1,1) and force a win.

  • (2,2) is P, since the next player can only move to (1,2) and (2), which are both N.

Make sure you understand all of these! If you can't figure out why, ask in the comments!

Here's my first general claim: if b>a>0, (a,a) is P, and (a,b) is N.

Here's why: From (a,a), it's my opponent's turn and I want to force a win. He moves to (c,a) for some c<a. I move to (c,c). I keep mirroring his moves, keeping the game of the form (x,x). Eventually he has to move to (0,x)=(x), and I win. From (a,b), I move to (a,a), and I win.

What's the general rule for determining whether a position is N or P based on what it can move to? A position can move to one of the following:

  • Neither N or P

  • Only N

  • Only P

  • Both N and P

If I want to force a win, I want to move to a P, so that I'm the previous player. I want my opponent to have to move back to N....

Spoilers: N cbfvgvba vf C vss vg pna'g zbir gb nal C-cbfvgvbaf.

I've found all the one- and two- pile P positions; let's move on to three piles. Here are some of them:

(1,2,3)  (1,4,5)  (1,6,7)
(2,4,6)  (2,5,7)  (2,8,10)
(3,4,7)  (3,5,6)  (3,8,11)
(4,8,12) (4,9,13) (4,10,14)

Hmm... They seem to be adding to each other, but not always, and (1,3,4) isn't one of them. There are never two of the form (a,b,x) and (a,b,y) (Why? Hint: WLOG x>y. If those are both P, my opponent can force a win when it's my turn in (a,b,x). But then I move to (a,b,y)...).

Do you notice any general patterns? If you can find a pattern for three piles, it's pretty easy to generalize it to more piles. If you see a pattern, can you convince yourself or someone else that it always works? Hint: Gel ybbxvat ng gur ahzoref va ovanel

Once you get through all this, try applying the same logic to subtraction games, and see which ones you can find a simple pattern for.


r/MathForAll • • Apr 09 '15

Ten Minute Challenges: Pythagorean Relations [Calculator Okay]

6 Upvotes

It's been about a week, I figure I'd do another one of these. This one is calculator permitted. You can use a graphing calculator for all of these questions if you feel the desire to do so.

The questions below are ordered in groups of three, with the first question being the easiest, the second being a bit harder, and the third being the hardest. You have ten minutes to solve each group of three problems. Of course, you don't have to time yourself if you don't want to, but it makes for an interesting challenge. Additionally, if you want to keep track of your score, then simply use whatever number the question is as point values (for example, question 3 is worth three points). See if you can get a perfect eighteen!

I was a bit jealous of your guys's abilities to figure the previous ones out so quickly, so I have a more challenging topic for you: Pythagorean Relations. All of these problems will utilize the properties of the sides of right triangles.

Ready...Set...GO!!


  1. The diagonals of a rhombus have lengths 16′ and 30′. Find the number of feet in the perimeter of the rhombus.

2. Squares are constructed on each side of right ∆ABE as shown: EN ⊥ AB. Compute the number of square cm in the area of JAEK if NL = 4 cm and AC = 12 cm.

3. Compute the area of the smallest 30°-60°-90° right triangle where the longer leg = a √b and the shorter leg = b √a for integers a, b where a > 1 and b > 1.

Answers


  1. In the accompanying diagram, ABCD is an isosceles trapezoid with bases AB and DC. If AB = 7, DC = 15, and AD = 5, compute the length of altitude AR.

2. Lightning hit a tree one-fifth of the way up the trunk from the ground. The tree broke so that the top of the tree landed 50 feet from the base of the tree, and the piece that fell was still attached (barely) to the trunk of the tree. The tree was originally F feet and I inches tall, where 0 ≤ I < 12 and I is rounded to the nearest whole number. Compute the ordered pair (F, I). Note: Your answer must be an ordered pair.

3. In right triangle ABC, AC is the hypotenuse, AB = 2√6 and BC = 5√3. The length of the altitude to the hypotenuse, in simplest form, may be expressed as (x√y)/z where x, y, and z are positive integers. Compute x + y + z.

Answers


  1. The diagonals of a rhombus measure 8 and 10. Each side of the rhombus measures √N. Compute N.

2. The hypotenuse of a right triangle measures 13√2. One leg measures 6√3. To the nearest integer, how long is the other leg?

3. We know that right triangles exist in which the hypotenuse is 1 unit longer than a leg – for example, the 5-12-13 triangle. Suppose that the sides of one such triangle ABC are represented by the ordered triple (a, b, c), where a < b and c represents the hypotenuse. If triangle ABC is the smallest such triangle whose perimeter exceeds 100, compute the ordered triple (a, b, c). Be sure to give your answer as an ordered triple.

Answers


Huh. I seem to be getting progressively worse in my handwriting as I make the answers. If you don't understand anything, let me know in the comments.


r/MathForAll • • Jul 09 '20

And from the Ashes of this Subreddit ...

5 Upvotes

LOL. I had forgotten about this subreddit. Thanks to CoVid and the situation here in some parts of the USA, I've decided to post more Problem Sets. Expect something nice in a week or two. BUT FIRST ... I'd like to share an ENTIRELY new type of "competition."

We're Going Co-op, Folks!!!

I'm going to give a situation and have voluntary players churn out as many related problems or related results as you can!!!

I, personally, think this sounds like uber fun. PLEASE do not plagiarize (do I need to say that?). Enjoy folks. Do some thinking. Make some friends. Enjoy the math!

This subreddit is back! (though only for one post so far ... so ... not a particularly significant sample size.)

Happy Mathing!


r/MathForAll • • Jun 08 '16

I love math but am allowing some physics -- a Dr. Brian Greene demonstration on Colbert's show.

Thumbnail
youtu.be
5 Upvotes

r/MathForAll • • Sep 16 '15

What are some real world examples of algebra 2 being used?

5 Upvotes

r/MathForAll • • Jul 20 '15

I Feel Like Writing A Math Book ... "Back-Seat Dividing: Roads, Paths, and other related math for your in-car entertainment."

5 Upvotes

A Math Book I Feel Like Writing: "Back-Seat Math: Roads, Paths, and other related math for your in-car entertainment." (I highly recommend that the driver not play these games while driving)

  1. Calculate how much more time it takes to get to where you are going. Knowing the total distance and distance traveled and the time elapsed (a ratio estimation).

  2. Calculate the speed of the car: Much more straightforward on interstates with the mile markers. Simply measure the time between mile markers (your choice: consecutive markers or every "n" miles) in seconds and convert to mph or km/h. If you do not have mile markers, use the "# miles to next_city_here" posts. Divide the distance by the time you take to get to the city.

  3. Konigsberg-Type Problems: Just a fun math point to bring up.

  4. License Plate Game: Find a plate that beats the current plate in three digits/numbers ... 6TVK990 beats 7ZAB461 (7, Z, 1 in the second number beat out their counterparts 6, T, 0) but not 6AGH889 (only 9 is higher in the second plate) ... Good probability practice.

  5. Xeno's Paradox? Kids sorry we can't even beat a turtle to where we are going. (I have reservations about using this one)

  6. Measure speeds of other cars passing / getting passed by you. Measuring how many seconds/parts of a second they take to get from outside of backseat window to outside of front seat window. (then add your speed!)

  7. Measuring how much less time it will take those other cars to travel 120 mi / 120 km.

  8. Taking statistics to estimate if you are in the top 25%, 50%, 75% of cars driving that day.

  9. Half a billion Graph Theory Topics jk :)

  10. D = R x T problems from high school / middle school algebra (including my favorite fly/train physics problem)

  11. Explanation of "we cannot feel speed." I.e. On a plane if you throw a ball straight up, will it hurl through to the back of the plane at 300 mi/hr? Of course not! It behaves as if you were on the Earth throwing it up and down. (and the dirty secret is the Earth isn't standing still either -- nor is our sun nor galaxy)

Still coming up with other things to add.

-ForgetsID

EDIT: for the calculation ones, it should be a competition and team effort (your choice: paper or mental math). Many people try to get the right answer first (to within an agreed on amount of error). BUT they must agree on the answer first. Team effort in checking each other's work to get the accepted number.


r/MathForAll • • May 02 '15

Game Theory, Part 5: How to Win at Nim

5 Upvotes

Spoiler Alert! If you haven't already, read the last post and try to solve nim on your own!


With that out of the way....

Fact: A position in nim is a P-position if and only if the "nim sum" of the number of stones in each pile is 0.

You might want to know what nim sum means. The nim sum of a and b, also called a XOR b, written a⊕b, is the sum of a and b in binary without carrying. Convert your numbers to binary, and their nim sum has a 1 in some digit if and only if exactly one of the numbers has a 1 in that digit.

Examples:

  • 3⊕2=11⊕10=1

  • 5⊕3=101⊕11=110=6

  • 6⊕9=110⊕1001=1111=15

  • n⊕n=0 (why?)

If there are more than two piles, add them in any order; ⊕ is commutative.

Now I need to show that any nonzero sum position can move to a zero sum position, and that a zero sum position can't. If I always move to zero, my opponent moves to something nonzero, and I move back to zero. Eventually I move to the game (0), and win.

Suppose a game has nonzero nim sum. Find the first (leftmost) (binary) digit that isn't zero. Pick a pile that has a 1 in that digit, and take some stones from that pile. In changing the 1 to a 0, whatever you do to the remaining digits, the number gets smaller. So you can choose a number of stones to take that makes the nim sum 0.

Example: Consider the game (110100110,110010101,101101). This has nim sum 11110. The second number, 110010101, has a 1 in the 5th digit from the right, so we subtract from it. To get 0, we should change it to 110001011. So we take 1010, or ten, stones from the second pile.

Now suppose a game has nim sum 0. When you subtract from a pile, the number of stones changes. In particular, there is a first digit that changes from 1 to 0. That digit in the nim sum must change, and since it starts at 0, it changes to a 1. So the final nim sum is not 0.

Did that make sense? If you don't understand, tell me and I'll try to explain it better.

I'll leave the solution to subtraction games for you to solve; it's less important and a fun puzzle.

I'd appreciate more responsiveness; am I writing these well? Are they fun to read and think about? Are you learning anything or getting excited about math? Is anyone who hasn't seen this before trying to solve the problems, and if so, why aren't you commenting? Are they too hard? Is my writing too full of mathematical jargon for people who don't know the terminology to understand? If I don't get any comments on this post, I'll probably stop here. It's a fine place to stop, but we haven't gotten to the main punchline yet.


r/MathForAll • • Apr 16 '15

Neat fractions tip that I found

5 Upvotes

This guy's page - a great way to approximate fractions.


r/MathForAll • • Jul 09 '20

COOP Topic! July 8th: The "Taxicab Stop" Coloring Theorem

4 Upvotes

Suppose you have a set of points on a square lattice connected by "roads" made from segments of the same square lattice. For example:

Find the maximum number of colors required to color each city (given by letters A - G) so that no two cities connected by a road will have the same color!

If you are wondering what kind of creativity is allowed when you are "creating similar problems or theorems" feel free to post. I will try to respond quickly!

Good Luck Team World! We'll battle bravely!
Happy Mathing!

I gotta do laundry :P :)


r/MathForAll • • Apr 26 '19

Why does 1/3=0.33333.... ⬇️

Post image
4 Upvotes