Difference between revisions of "Mathtime Version 1 Issue 2"
(One intermediate revision by the same user not shown) | |||
Line 101: | Line 101: | ||
==Combinatorics== | ==Combinatorics== | ||
+ | |||
+ | ===Problem 1=== | ||
Two people decide to meet at a fire department building to discuss new additions to the fire crew. Both people are very busy running their own businesses, and they can only meet at sometime between <math>1</math> PM and <math>3</math> PM. Person <math>A</math> has a <math>15</math> minute lunch break to randomly spend at the fire building and Person <math>B</math> has a <math>20</math> minute lunch break to spend at the fire building. If they can meet each other at any time, then they can accomplish their required deed. What is the probability that they will be able to accomplish their deed? (Proposed by SP343) | Two people decide to meet at a fire department building to discuss new additions to the fire crew. Both people are very busy running their own businesses, and they can only meet at sometime between <math>1</math> PM and <math>3</math> PM. Person <math>A</math> has a <math>15</math> minute lunch break to randomly spend at the fire building and Person <math>B</math> has a <math>20</math> minute lunch break to spend at the fire building. If they can meet each other at any time, then they can accomplish their required deed. What is the probability that they will be able to accomplish their deed? (Proposed by SP343) | ||
− | + | ||
+ | ===Problem 2=== | ||
At the county fair, a gambler offers two bags. The first bag has <math>3</math> chocolate bars and <math>2</math> packs of raisins. The second bag has <math>5</math> chocolate bars and <math>4</math> packs of raisins. The boy that is drawing next is allergic to raisins and tells the man so. He replies, "Very well. In your draw, if at any time you draw a chocolate bar, you may keep the chocolate bar and leave. However, if at anytime you draw a pack of raisins, you may place the pack of raisins within the other bag and draw from that other bag. You must start drawing from Bag <math>A</math>." Find a formula that expresses the chance that the boy will eventually get a chocolate bar in terms of the number of draws <math>n</math>.(Proposed by SP343) | At the county fair, a gambler offers two bags. The first bag has <math>3</math> chocolate bars and <math>2</math> packs of raisins. The second bag has <math>5</math> chocolate bars and <math>4</math> packs of raisins. The boy that is drawing next is allergic to raisins and tells the man so. He replies, "Very well. In your draw, if at any time you draw a chocolate bar, you may keep the chocolate bar and leave. However, if at anytime you draw a pack of raisins, you may place the pack of raisins within the other bag and draw from that other bag. You must start drawing from Bag <math>A</math>." Find a formula that expresses the chance that the boy will eventually get a chocolate bar in terms of the number of draws <math>n</math>.(Proposed by SP343) | ||
− | + | ||
− | + | ===Problem 3=== | |
+ | |||
What is the expected value to draw for a bag that has <math>1</math> <math>$10</math> bill, <math>3</math> <math>$5</math> bills, <math>5</math> packs of <math>3</math> <math>$1</math> bills, <math>10</math> <math>$1</math> bills, and <math>19</math> fake Monopoly <math>$1,000,000</math> bills? (Proposed by SP343) | What is the expected value to draw for a bag that has <math>1</math> <math>$10</math> bill, <math>3</math> <math>$5</math> bills, <math>5</math> packs of <math>3</math> <math>$1</math> bills, <math>10</math> <math>$1</math> bills, and <math>19</math> fake Monopoly <math>$1,000,000</math> bills? (Proposed by SP343) | ||
− | + | ||
+ | ===Problem 4=== | ||
Carnegie Mellon's secret astrophysical department has <math>70</math> students. <math>3</math> classes are offered: Nuclear Implosion, Black Hole Prevention, and Extra-Terrestrial Life Hunt. The <math>70</math> students are divided up so that <math>37</math> students take Nuclear Implosion, <math>27</math> students observe Extra-Terrestrial Life, and <math>31</math> watch for Black Holes. If <math>6</math> elite students take all <math>3</math> classes and <math>11</math> procrastinating students don't take any classes, then how many people take Nuclear Implosion and Black Hole Prevention, but not Extra-Terrestrial Life? (Proposed by SP343) | Carnegie Mellon's secret astrophysical department has <math>70</math> students. <math>3</math> classes are offered: Nuclear Implosion, Black Hole Prevention, and Extra-Terrestrial Life Hunt. The <math>70</math> students are divided up so that <math>37</math> students take Nuclear Implosion, <math>27</math> students observe Extra-Terrestrial Life, and <math>31</math> watch for Black Holes. If <math>6</math> elite students take all <math>3</math> classes and <math>11</math> procrastinating students don't take any classes, then how many people take Nuclear Implosion and Black Hole Prevention, but not Extra-Terrestrial Life? (Proposed by SP343) | ||
− | + | ||
+ | ===Problem 5=== | ||
In an average Social Studies class at my school, there are <math>23</math> students. If <math>14</math> are blonde and <math>13</math> are girls, at least how many blonde girls are there? (Proposed by SP343) | In an average Social Studies class at my school, there are <math>23</math> students. If <math>14</math> are blonde and <math>13</math> are girls, at least how many blonde girls are there? (Proposed by SP343) | ||
+ | |||
+ | ===Problem 6=== | ||
How many combinations of letters can be made by rearranging the letters of <math>MATHTIME</math>? (Proposed by SP343) | How many combinations of letters can be made by rearranging the letters of <math>MATHTIME</math>? (Proposed by SP343) | ||
− | + | ||
+ | ===Problem 7=== | ||
<math>7</math> people go to a Thanksgiving feast. There, they are served <math>21</math> glasses of red wine, <math>3</math> glasses per person. The host of the party had placed a diamond ring in one of the glasses, to be given to the one he wished to propose to. Unfortunately, the waiter had mixed up the glasses so that he wasn't sure which glass had the ring. If the drinks were randomly served in <math>3</math> rounds of <math>7</math> drinks, then what is the chance that the bride would receive the right glass of wine in the <math>3^\text{rd}</math> round, as planned? (Proposed by SP343) | <math>7</math> people go to a Thanksgiving feast. There, they are served <math>21</math> glasses of red wine, <math>3</math> glasses per person. The host of the party had placed a diamond ring in one of the glasses, to be given to the one he wished to propose to. Unfortunately, the waiter had mixed up the glasses so that he wasn't sure which glass had the ring. If the drinks were randomly served in <math>3</math> rounds of <math>7</math> drinks, then what is the chance that the bride would receive the right glass of wine in the <math>3^\text{rd}</math> round, as planned? (Proposed by SP343) | ||
− | + | ||
+ | ===Problem 8=== | ||
A company wants to sell their product for a cure for Paul Bunyan's disease, a disease where a man might be transformed into a huge lumberjack with a great beard, angry at the huge amount of trees that are still standing. If an average person would look at an advertisement on a billboard <math>\frac{1}{3}</math> of the time, and would have a <math>\frac{1}{6}</math> chance of buying the item at first glance, which then steadily increases by <math>\frac{1}{12}</math> for each additional glance at the advertisement, what is the chance that the person will buy the item if he is taking a stroll around a block with the advertisement on one side <math>5</math> times? (Proposed by SP343) | A company wants to sell their product for a cure for Paul Bunyan's disease, a disease where a man might be transformed into a huge lumberjack with a great beard, angry at the huge amount of trees that are still standing. If an average person would look at an advertisement on a billboard <math>\frac{1}{3}</math> of the time, and would have a <math>\frac{1}{6}</math> chance of buying the item at first glance, which then steadily increases by <math>\frac{1}{12}</math> for each additional glance at the advertisement, what is the chance that the person will buy the item if he is taking a stroll around a block with the advertisement on one side <math>5</math> times? (Proposed by SP343) | ||
− | + | ||
+ | ===Problem 9=== | ||
A Native Cherokee tribe happened to come upon a magical sage. Not knowing this information, they helped her by feeding her and giving her shelter. In return, the sage offered them an opportunity to revive a random person from the grave. The tribe had recently lost their tribe leader, so they eagerly accepted. The sage warned that she only had a <math>\dfrac{2}{5}^\text{th}</math> chance of successfully reviving a dead person, and that there was a <math>\dfrac{3}{5}^\text{th}</math> chance that zombies would rise instead and kill them all. Additionally, the sage had only been able to revive a Cherokee <math>\dfrac{3}{8}^\text{th}</math> of the time. In the other times, she had brought back a violent Creek who had always narrowly missed killing her. Even worse was the fact that the spell took <math>5</math> days to prepare, then could only be done within <math>2</math> hours after preparation was finished. The spell could only be done if the sky was completely clear. If there was a <math>70\%</math> of a storm cloud coming in soon, then what is the chance that a Cherokee Chief was brought back from the dead, if <math>3</math> in every <math>100</math> Cherokees were chiefs? (Proposed by SP343) | A Native Cherokee tribe happened to come upon a magical sage. Not knowing this information, they helped her by feeding her and giving her shelter. In return, the sage offered them an opportunity to revive a random person from the grave. The tribe had recently lost their tribe leader, so they eagerly accepted. The sage warned that she only had a <math>\dfrac{2}{5}^\text{th}</math> chance of successfully reviving a dead person, and that there was a <math>\dfrac{3}{5}^\text{th}</math> chance that zombies would rise instead and kill them all. Additionally, the sage had only been able to revive a Cherokee <math>\dfrac{3}{8}^\text{th}</math> of the time. In the other times, she had brought back a violent Creek who had always narrowly missed killing her. Even worse was the fact that the spell took <math>5</math> days to prepare, then could only be done within <math>2</math> hours after preparation was finished. The spell could only be done if the sky was completely clear. If there was a <math>70\%</math> of a storm cloud coming in soon, then what is the chance that a Cherokee Chief was brought back from the dead, if <math>3</math> in every <math>100</math> Cherokees were chiefs? (Proposed by SP343) | ||
− | + | ===Problem 10=== | |
+ | |||
Three identical white pawns and five identical black pawns are randomly ordered in a line. An example of such an arrangement is WBBWBWBB. | Three identical white pawns and five identical black pawns are randomly ordered in a line. An example of such an arrangement is WBBWBWBB. | ||
Line 136: | Line 148: | ||
(Proposed by djmathman) | (Proposed by djmathman) | ||
− | + | ===Problem 11=== | |
I roll 4 dice with 6, 10, 12, and 20 sides each numbered 1-6, 1-10, 1-12, 1-20 respectively. What is the probability that the face-up value of the 12 sided die is greater than the sum of the values of the other dice? (Proposed by tc1729) | I roll 4 dice with 6, 10, 12, and 20 sides each numbered 1-6, 1-10, 1-12, 1-20 respectively. What is the probability that the face-up value of the 12 sided die is greater than the sum of the values of the other dice? (Proposed by tc1729) | ||
− | + | ||
+ | ===Problem 12=== | ||
Suppose that a knight (as in the chess piece) travelled to every square on a chess board and counted the number of squares he could attack on the board. For instance, in the center of the board, the knight is able to move to eight different squares from that spot. If each of these numbers was recorded and placed in a hat, what is the expected value of drawing one number? (Proposed by djmathman) | Suppose that a knight (as in the chess piece) travelled to every square on a chess board and counted the number of squares he could attack on the board. For instance, in the center of the board, the knight is able to move to eight different squares from that spot. If each of these numbers was recorded and placed in a hat, what is the expected value of drawing one number? (Proposed by djmathman) | ||
==Algebra== | ==Algebra== | ||
+ | |||
+ | ===Problem 1=== | ||
Have a root of <math>x^3 + 5x + 8</math> be <math>r</math>. Find the value of <math>a</math> such that <math>\dfrac{r^3 + 5r + 7}{r^3 + 5r + a} = -2</math>. (Proposed by KingofMath101) | Have a root of <math>x^3 + 5x + 8</math> be <math>r</math>. Find the value of <math>a</math> such that <math>\dfrac{r^3 + 5r + 7}{r^3 + 5r + a} = -2</math>. (Proposed by KingofMath101) | ||
+ | |||
+ | ===Problem 2=== | ||
Where <math>a</math>, <math>b</math>, <math>c</math>, and <math>d</math> are positive, prove that <math>(a^2b^2 + c^2d^2)(a^2c^2 + b^2d^2)(a^2d^2 + b^2c^2) \geq 8abcd</math> . (Proposed by KingofMath101) | Where <math>a</math>, <math>b</math>, <math>c</math>, and <math>d</math> are positive, prove that <math>(a^2b^2 + c^2d^2)(a^2c^2 + b^2d^2)(a^2d^2 + b^2c^2) \geq 8abcd</math> . (Proposed by KingofMath101) | ||
+ | |||
+ | ===Problem 3=== | ||
If <math>d</math> is a root of <math>2x^3 + 7x^2 - 4x + 1</math>, then simplify <math>d^7 + 4d^6 - 3d^5 + 22d^4 + 3d^3 - d^2 + 7d - 1</math> to a quadratic in terms of <math>d</math>. (Proposed by KingofMath101) | If <math>d</math> is a root of <math>2x^3 + 7x^2 - 4x + 1</math>, then simplify <math>d^7 + 4d^6 - 3d^5 + 22d^4 + 3d^3 - d^2 + 7d - 1</math> to a quadratic in terms of <math>d</math>. (Proposed by KingofMath101) | ||
+ | |||
+ | ===Problem 4=== | ||
Find <math>\prod_{x = 1}^{6}{\frac{x + 4}{x + 2} \cdot \frac{x + 3}{x + 5}}</math>. (Proposed by KingofMath101) | Find <math>\prod_{x = 1}^{6}{\frac{x + 4}{x + 2} \cdot \frac{x + 3}{x + 5}}</math>. (Proposed by KingofMath101) | ||
+ | |||
+ | ===Problem 5=== | ||
Determine the value of <math>\sqrt{4+\sqrt{4+\sqrt{4+\sqrt{4+\ldots}}}}</math>. (Proposed by KingofMath101) | Determine the value of <math>\sqrt{4+\sqrt{4+\sqrt{4+\sqrt{4+\ldots}}}}</math>. (Proposed by KingofMath101) | ||
+ | |||
+ | ===Problem 6=== | ||
Determine the value of <math>4^{3^2}-\left(4^3\right)^2</math>. (Proposed by SP343) | Determine the value of <math>4^{3^2}-\left(4^3\right)^2</math>. (Proposed by SP343) | ||
+ | |||
+ | ===Problem 7=== | ||
Find the sum of the reciprocals of <math>x^7+324x^6-20x^5+24x^3-6033x=-2011</math>.(Proposed by SP343) | Find the sum of the reciprocals of <math>x^7+324x^6-20x^5+24x^3-6033x=-2011</math>.(Proposed by SP343) | ||
+ | |||
+ | ===Problem 8=== | ||
<math>20</math> oz of a <math>15\%</math> acid mixture is added to a <math>50\%</math> acid mixture. The resulting mixture is <math>30\%</math> acid. How many oz of the <math>50\%</math> acid was added? (Proposed by SP343) | <math>20</math> oz of a <math>15\%</math> acid mixture is added to a <math>50\%</math> acid mixture. The resulting mixture is <math>30\%</math> acid. How many oz of the <math>50\%</math> acid was added? (Proposed by SP343) | ||
+ | |||
+ | ===Problem 9=== | ||
<math>\sqrt{7x+21}-x=3</math>. Find the value of <math>x</math>. (Proposed by SP343) | <math>\sqrt{7x+21}-x=3</math>. Find the value of <math>x</math>. (Proposed by SP343) | ||
+ | |||
+ | ===Problem 10=== | ||
The cube root of <math>\sqrt{1024}=16^x</math>. Solve for the value of <math>x</math>. (Proposed by SP343) | The cube root of <math>\sqrt{1024}=16^x</math>. Solve for the value of <math>x</math>. (Proposed by SP343) | ||
+ | |||
+ | ===Problem 11=== | ||
Given that <math>x=-3</math> is a root to <math>x^3-5x^2-7x+51</math>, find the sum of the two other roots. (Proposed by SP343) | Given that <math>x=-3</math> is a root to <math>x^3-5x^2-7x+51</math>, find the sum of the two other roots. (Proposed by SP343) | ||
+ | |||
+ | ===Problem 12=== | ||
Let <math>x_1</math> and <math>x_2</math> be integers that sum to <math>9</math>. Given that <math>x_2>x_1</math>, find a closed-form expression for <cmath>\sum_{a=x_1}^{x_2}\sum_{m=1}^{a} m</cmath> in terms of <math>x_2</math>. (Proposed by djmathman) | Let <math>x_1</math> and <math>x_2</math> be integers that sum to <math>9</math>. Given that <math>x_2>x_1</math>, find a closed-form expression for <cmath>\sum_{a=x_1}^{x_2}\sum_{m=1}^{a} m</cmath> in terms of <math>x_2</math>. (Proposed by djmathman) |
Latest revision as of 20:46, 1 January 2012
Number Theory
Problem 1
. What is the value of ? (Proposed by SP343)
Problem 2
What is the value of in base ? (Proposed by SP343)
Problem 3
, , and . What is the smallest possible positive value of ? (Proposed by SP343)
Problem 4
Prove that is divisible by . (Proposed by djmathman)
Problem 5
Determine the positive integer such that is a perfect square. (Proposed by djmathman)
Problem 6
Find the smallest integer value of such that is an integer greater than . (Proposed by djmathman)
Problem 7
What is the greatest possible integer value of such that has less than distinct positive divisors? (Proposed by djmathman)
Problem 8
Find all integers such that is divisible by . (Proposed by djmathman)
Problem 9
Prove that there are an infinite number of ordered integer pairs such that . (Proposed by djmathman)
Problem 10
Let . For how many values of does there exist at least values of less than such that is an integer? (Proposed by djmathman)
Problem 11
Let and be the sum and the product of the divisors or , respectively. Calculate . (Proposed by El-Etric)
Problem 12
What is the units digit of ? (Proposed by El-Etric)
Geometry
Problem 1
Supports are being placed inside a hemispherical dome. A support meters in length is meters closer to the edge of the dome than a support meters in length. Assuming that these supports have neglectible thickness and are perpendicular to the ground, find the radius of the dome. (Proposed by djmathman)
Problem 2
A circle in the coordinate plane passes through the points (, , and . Given that the equation of the circle can be written in the form where r, k, and h are integers, find . (Proposed by djmathman)
Problem 3
Circle is separated into quarter circles. Each quarter circle has a circle inscribed within the circle so that the inscribed circle is tangent to all sides. What is the ratio of the sum of the areas of all small circles to the area of the large circle? (Proposed by SP343)
Problem 4
circles are bound together with a tight rope. The rope is tight so that there is no extra rope left over when bound around the four circles. If the radius of a circle is and all the circles are congruent, what is the length of the rope? (Proposed by SP343)
Problem 5
Two triangles are combined together with overlap so that the Star of David is formed. This Star of David has outlying triangles that, when added together, has the same area as the inside hexagon. A circle is circumscribed around the Star of David. What is the ratio of the area of the Star of David to the area of the circle? (Proposed by SP343)
Problem 6
An average can of almonds is a cylinder container with a radius of and a height of . If the Almond company decides to increase the volume by , but also to decrease the height by , what does the radius of the new can have to be? Express your answer in simplest radical form. (Proposed by SP343)
Problem 7
A regular hexagon is inscribed within a circle, which in turn is inscribed within a square, which is then inscribed within a final large circle. If the area of the hexagon is units, find the area of the largest circle. (Proposed by SP343)
Problem 8
What is the greatest amount of intersections a circle, a square, and straight distinct lines could create? (Proposed by SP343)
Problem 9
An astronaut is tethered to a vertex of a cube with side length of 3 m. What is the total volume of the space the astronaut is able to visit if the length of the rope is 4m? (ERRATUM: The original problem forgot to specify the length of the rope) (Proposed by tc1729)
Problem 10
Triangle is an isosceles triangle with and . Let and be the points of intersection of the altitudes from points and respectfully. If , then the length of one leg of the triangle can be written in the form where , , and are positive integers and is not divisible by the square of any prime. Find . (Proposed by djmathman)
Problem 11
A circle is placed so that it touches the origin and has its center located on the y-axis. The circle is tangent to the line . Given that the radius of the circle can be written in the form where , , and are integers (not necessarily positive), find . (Proposed by djmathman)
Problem 12
A complex number is graphed on the complex plane such that . The line drawn from the origin to this point makes an angle with the real axis. As sweeps from to , what is the probability that ? (Proposed by BT)
Combinatorics
Problem 1
Two people decide to meet at a fire department building to discuss new additions to the fire crew. Both people are very busy running their own businesses, and they can only meet at sometime between PM and PM. Person has a minute lunch break to randomly spend at the fire building and Person has a minute lunch break to spend at the fire building. If they can meet each other at any time, then they can accomplish their required deed. What is the probability that they will be able to accomplish their deed? (Proposed by SP343)
Problem 2
At the county fair, a gambler offers two bags. The first bag has chocolate bars and packs of raisins. The second bag has chocolate bars and packs of raisins. The boy that is drawing next is allergic to raisins and tells the man so. He replies, "Very well. In your draw, if at any time you draw a chocolate bar, you may keep the chocolate bar and leave. However, if at anytime you draw a pack of raisins, you may place the pack of raisins within the other bag and draw from that other bag. You must start drawing from Bag ." Find a formula that expresses the chance that the boy will eventually get a chocolate bar in terms of the number of draws .(Proposed by SP343)
Problem 3
What is the expected value to draw for a bag that has bill, bills, packs of bills, bills, and fake Monopoly bills? (Proposed by SP343)
Problem 4
Carnegie Mellon's secret astrophysical department has students. classes are offered: Nuclear Implosion, Black Hole Prevention, and Extra-Terrestrial Life Hunt. The students are divided up so that students take Nuclear Implosion, students observe Extra-Terrestrial Life, and watch for Black Holes. If elite students take all classes and procrastinating students don't take any classes, then how many people take Nuclear Implosion and Black Hole Prevention, but not Extra-Terrestrial Life? (Proposed by SP343)
Problem 5
In an average Social Studies class at my school, there are students. If are blonde and are girls, at least how many blonde girls are there? (Proposed by SP343)
Problem 6
How many combinations of letters can be made by rearranging the letters of ? (Proposed by SP343)
Problem 7
people go to a Thanksgiving feast. There, they are served glasses of red wine, glasses per person. The host of the party had placed a diamond ring in one of the glasses, to be given to the one he wished to propose to. Unfortunately, the waiter had mixed up the glasses so that he wasn't sure which glass had the ring. If the drinks were randomly served in rounds of drinks, then what is the chance that the bride would receive the right glass of wine in the round, as planned? (Proposed by SP343)
Problem 8
A company wants to sell their product for a cure for Paul Bunyan's disease, a disease where a man might be transformed into a huge lumberjack with a great beard, angry at the huge amount of trees that are still standing. If an average person would look at an advertisement on a billboard of the time, and would have a chance of buying the item at first glance, which then steadily increases by for each additional glance at the advertisement, what is the chance that the person will buy the item if he is taking a stroll around a block with the advertisement on one side times? (Proposed by SP343)
Problem 9
A Native Cherokee tribe happened to come upon a magical sage. Not knowing this information, they helped her by feeding her and giving her shelter. In return, the sage offered them an opportunity to revive a random person from the grave. The tribe had recently lost their tribe leader, so they eagerly accepted. The sage warned that she only had a chance of successfully reviving a dead person, and that there was a chance that zombies would rise instead and kill them all. Additionally, the sage had only been able to revive a Cherokee of the time. In the other times, she had brought back a violent Creek who had always narrowly missed killing her. Even worse was the fact that the spell took days to prepare, then could only be done within hours after preparation was finished. The spell could only be done if the sky was completely clear. If there was a of a storm cloud coming in soon, then what is the chance that a Cherokee Chief was brought back from the dead, if in every Cherokees were chiefs? (Proposed by SP343)
Problem 10
Three identical white pawns and five identical black pawns are randomly ordered in a line. An example of such an arrangement is WBBWBWBB.
a. The above arrangement is an example arrangement that has at least two black pawns adjacent to each other. Prove that every possible arrangement results in at least two black pawns adjacent to each other.
b. The above arrangement is an example arrangement in which no two white pawns are next to each other. Determine the number of arrangements for which this is so.
(Proposed by djmathman)
Problem 11
I roll 4 dice with 6, 10, 12, and 20 sides each numbered 1-6, 1-10, 1-12, 1-20 respectively. What is the probability that the face-up value of the 12 sided die is greater than the sum of the values of the other dice? (Proposed by tc1729)
Problem 12
Suppose that a knight (as in the chess piece) travelled to every square on a chess board and counted the number of squares he could attack on the board. For instance, in the center of the board, the knight is able to move to eight different squares from that spot. If each of these numbers was recorded and placed in a hat, what is the expected value of drawing one number? (Proposed by djmathman)
Algebra
Problem 1
Have a root of be . Find the value of such that . (Proposed by KingofMath101)
Problem 2
Where , , , and are positive, prove that . (Proposed by KingofMath101)
Problem 3
If is a root of , then simplify to a quadratic in terms of . (Proposed by KingofMath101)
Problem 4
Find . (Proposed by KingofMath101)
Problem 5
Determine the value of . (Proposed by KingofMath101)
Problem 6
Determine the value of . (Proposed by SP343)
Problem 7
Find the sum of the reciprocals of .(Proposed by SP343)
Problem 8
oz of a acid mixture is added to a acid mixture. The resulting mixture is acid. How many oz of the acid was added? (Proposed by SP343)
Problem 9
. Find the value of . (Proposed by SP343)
Problem 10
The cube root of . Solve for the value of . (Proposed by SP343)
Problem 11
Given that is a root to , find the sum of the two other roots. (Proposed by SP343)
Problem 12
Let and be integers that sum to . Given that , find a closed-form expression for in terms of . (Proposed by djmathman)