Difference between revisions of "Random Problem"
(→Hard Problem) |
(→Solution 1) |
||
Line 80: | Line 80: | ||
'''Credits to Daniel Mathias''' | '''Credits to Daniel Mathias''' | ||
− | For each of the <math>24</math> main diagonals passing through the center there are <math>46</math> vertices not on the diagonal. For each of those vertices, there are two diagonals (or one diagonal and an edge) connecting the vertex to an endpoint of the main diagonal. The distances from the center to these two diagonals are <math>\sin\theta</math> and <math>\cos\theta</math> for some <math>\theta</math> and the sum of the squared distances is <math>\sin{2}\theta+\cos{2}\theta=1</math>, as shown. | + | For each of the <math>24</math> main diagonals passing through the center there are <math>46</math> vertices not on the diagonal. For each of those vertices, there are two diagonals (or one diagonal and an edge) connecting the vertex to an endpoint of the main diagonal. The distances from the center to these two diagonals are <math>\sin\theta</math> and <math>\cos\theta</math> for some <math>\theta</math> and the sum of the squared distances is <math>\sin^{2}\theta+\cos^{2}\theta=1</math>, as shown. |
https://imgur.com/a/gUYewP1 | https://imgur.com/a/gUYewP1 | ||
− | This would give a total sum of <math> | + | This would give a total sum of <math>24\times46=1104</math>, but since <math>24\times46\times2=2208</math> counts each of <math>1056</math> diagonals and <math>48</math> edges twice, the total sum desired is |
− | <cmath> | + | <cmath>24\times23=552</cmath> |
Revision as of 16:06, 24 March 2023
Contents
Easy Problem
The sumcan be expressed as , where and are positive integers. What is ?
Solution
Submitted by BinouTheGuineaPig | A step-by-step solution
We see that the general form for each term can be expressed in terms of as follows.
Now, to find the entire sum, it can be expressed as follows.
Here, we see that a whole chunk of terms cancel each other out, leaving us with
This means .
Therefore, the answer is .
Medium Problem
Show that there exist no finite decimals such that when its digits are rearranged to a different decimal , .
Solution
???
Hard-ish Problem
A cylinder is inscribed in a circular cone with base radius of and height of . What is the maximum possible volume of this cylinder in the form of ?
Solution
Submitted by BinouTheGuineaPig | A step-by-step solution
We create a cross-section of the cylinder in the cone, "slicing down" from the apex of the cone as follows.
Volume of the cylinder
Now, we find all inflection points in the graph of this equation, by finding the values of where the gradient is , in other words where .
or
We will obviously use the larger value of to find the maximum volume of the cylinder, as follows.
Therefore, the maximum cylinder volume can be expressed as .
Hard Problem
A regular -gon is inscribed in a circle with radius . Let be the set of distances (not necessarily distinct) from the center of the circle to each side of the -gon, and be the set of distances (not necessarily distinct) from the center of the circle to each diagonal of the -gon. Let be the union of and . What is the sum of the squares of all of the elements in ?
Solution 1
Credits to Daniel Mathias
For each of the main diagonals passing through the center there are vertices not on the diagonal. For each of those vertices, there are two diagonals (or one diagonal and an edge) connecting the vertex to an endpoint of the main diagonal. The distances from the center to these two diagonals are and for some and the sum of the squared distances is , as shown.
This would give a total sum of , but since counts each of diagonals and edges twice, the total sum desired is