Difference between revisions of "User:Shalomkeshet"
Shalomkeshet (talk | contribs) |
Shalomkeshet (talk | contribs) (→Problem 16) |
||
(12 intermediate revisions by the same user not shown) | |||
Line 59: | Line 59: | ||
Frosty the Snowman has been dormant all year, and now is finally his time to awaken from his deep slumber. He likes counting snowflakes and their intricate patterns. He observes the snowflakes and thinks of a certain pattern. | Frosty the Snowman has been dormant all year, and now is finally his time to awaken from his deep slumber. He likes counting snowflakes and their intricate patterns. He observes the snowflakes and thinks of a certain pattern. | ||
− | Let the <math>n</math>th iteration of his pattern be <math>x_{n} = n^2 + (n-1)^2 - (n- | + | Let the <math>n</math>th iteration of his pattern be <math>x_{n} = n^2 + (n-1)^2 - (n-2)^2 - (n-3)^2 + (n-4)^2 + \cdots + 4^2 + 3^2 - 2^2 - 1^2</math>, where the additions and subtractions alternate in twos. Frosty wants to know the remainder when <math>x_{100}</math> is divided by <math>1000</math>. |
− | |||
==Problem 10== | ==Problem 10== | ||
Line 72: | Line 71: | ||
==Problem 11== | ==Problem 11== | ||
According to the gingerbreads, a nice triplet of children is a triplet of three positive integers <math>(a,b,p)</math> (where <math>p</math> is prime) that satisfies <math>a^p = b! + p</math>. Name all such triplets. | According to the gingerbreads, a nice triplet of children is a triplet of three positive integers <math>(a,b,p)</math> (where <math>p</math> is prime) that satisfies <math>a^p = b! + p</math>. Name all such triplets. | ||
+ | |||
+ | |||
+ | ==Problem 12== | ||
+ | Mrs. Claus saw the three Ghosts of Christmas heading towards their meeting point. She knows that the Ghosts love complex numbers and decides to riddle one of them. She asks the Ghost of Christmas present, | ||
+ | |||
+ | "If the non-uno complex solution to <math>1^x=2</math> is of the form <math>-i\frac{ln(A)}{B \cdot C}</math>, then what is the value of <math>sin\left(\frac{A \cdot B \cdot C}{2}\right)</math>?" | ||
+ | |||
+ | The Ghost of Christmas present does not want to be late to the meeting but also doesn't want to ruin his public image. Help him solve this question. | ||
+ | |||
+ | |||
+ | ==Problem 13== | ||
+ | Apparently, no one in hell wants to celebrate Christmas. Death sees this and decides to bring in the festive mood just for this year. He summons a nonadecagon which will invoke <math>19</math> demons to celebrate Christmas. | ||
+ | |||
+ | If no <math>two</math> adjacent demon houses ever get invoked on the same day, and there are never more than <math>two</math> demon houses in a row that do not get invoked on the same day, how many different patterns of nonadecagonic invokations are possible? | ||
+ | |||
+ | |||
+ | ==Problem 14== | ||
+ | Bradley has been put on the naughty list for using the Fundamental Theorem of Engineering to solve | ||
+ | |||
+ | <cmath>\lim_{x \to 0} \frac{sin(x)}{x}</cmath> | ||
+ | |||
+ | Can you help him solve this problem properly? | ||
+ | |||
+ | |||
+ | ==Problem 15== | ||
+ | Bradley is in a pickle again. He has been asked to solve a physics problem, although he only knows mathematics. You, too, only know mathematics, and you are tasked to help Bradley solve the following problem: | ||
+ | |||
+ | "If the density of a spherical planet is varying with the radius as <math>\rho (r) = \rho_0 \left(1-\left(\frac{r^2}{R^2}\right)\right)</math>. At what <math>r</math> will its gravity be maximum?" | ||
+ | |||
+ | Luckily, there are secret notes with physics formulas that you can use to solve this problem: | ||
+ | |||
+ | These are constants: <math>G,r,R,\rho_0,M,V</math> | ||
+ | |||
+ | Gravity is <math>g</math> | ||
+ | |||
+ | <math>g(r)=\frac{GM(r)}{r^2}</math> | ||
+ | |||
+ | <math>\rho = \frac{Mass}{Volume}</math> | ||
+ | |||
+ | This is all you need to solve this problem, the rest is just calculus. | ||
+ | |||
+ | |||
+ | ==Problem 16== | ||
+ | After the Ghost of Christmas present solved Mrs. Claus' problem, he gave her a problem of his own. He asks, | ||
+ | |||
+ | "If <math>x</math> is an angle of a triangle, what is the minimum value of <math>\frac{9(x\sin x)^2 + 4}{x\sin x}</math>?" | ||
+ | |||
+ | He knows that Mrs. Claus is bad at calculus, and reassures her that calculus is not needed in this problem. Help Mrs. Claus solve this. | ||
+ | |||
+ | ==Problem 17== | ||
+ | Christmas has arrived today at <math>25/12/2024</math> and it lasts <math>12</math> days. | ||
+ | |||
+ | Santa wonders, what are the last three digits of <math>2024^{25^{12^{12}}}</math>? |
Latest revision as of 07:06, 25 December 2024
Welcome to Shalom Keshet's
Mathematical Challenge of Christmas Cheer (MCCC) [2024]
Merry Christmas ladies and gentlemen, today I have procured a set of Jolly Problems for you to solve, good luck!
Problem 1
Santa has brought 5 gifts for five people and and has placed them around the Christmas tree in a circular arrangement. If each of the gifts contains a surprise of one of the three types: toy, gadget and sweet, then the number of ways of distributing the surprises such that the gifts placed in adjacent positions get different surprise is ............
Problem 2
Santa's elves have prepared a nutcracker festival and have arranged them as a triangle . They want to know whether there is a line in the plane of such that the intersection of the interior of and the interior of its reflection in has an area more than the area of . Show the elves why such a line exists.
Problem 3
Little Timmy has been good this year and wishes for a mecharobot suit for Christmas. As his parents are associated with the Mafia, Santa has no choice but to comply with Timmy's wishes. The elves make a puzzle for Timmy to solve, and only if he solves it will he get his desired present.
The puzzle talks of a number , which is defined as the smallest positive integer such that this number multiplied by the peak gaming year, i.e., , is a perfect square and is a perfect cube. Timmy needs to find the remainder when is divided by .
Of course, you don't want to die either, so you need to help Timmy find the solution.
Problem 4
Santa has been busy in the workshop making little Timmy's gift, so he puts the responsibility of the nice and naughty lists on his elves.
According to the elves, each child can be represented as a lattice point . A child is added to the nice list if are natural numbers and . Children who do not satisfy these conditions are added to the naughty list.
Find the minimum number of lines with gradient we should draw in the way that each child belonging to the nice list lies on at least one of these lines.
Problem 5
The Grinch has cursed Rudolph the Red-Nosed Reindeer by trapping him in a Free-2-Play Mobile Game! Rudolph has to finish the game to escape this curse.
Each level he passes in the game starts an ad with a price of to skip the ad for each nonnegative integer . A "sales tax" of is applied on all levels.
If the total "cost" of completing the game, after tax, is an integer number of cents, find the minimum possible number of steps in the level. (Rudolph wants to spend as little time as possible so he pays to skip every ad)
Problem 6
Ginger1 and Ginger2 are two gingerbreadmen. They are getting bored because all their friends keep getting eaten. They decide to pass the time by playing a game.
The Gingers have two fair coins and a third coin that comes up heads with probability . Ginger1 flings the three coins up, and then Ginger2 flings the three coins up. Let be the probability that Ginger1 gets the same number of heads as Ginger2, where and are coprime, positive integers. Find .
Problem 7
Santa's sleigh appears as a right-angled triangle with . It lies inside a right angle with vertex . The altitude of from is extended beyond until it intersects the side of angle at . The distances from and to the second side of angle are 2 and 1 respectively.
Find the value of .
Problem 8
For some reason, all the different Ghosts of Christmas - past, present, and yet to come - have decided to meet up at their meeting place . If this meeting place is represented by , then and hold true.
What is the gradient of the line of form ?
Problem 9
Frosty the Snowman has been dormant all year, and now is finally his time to awaken from his deep slumber. He likes counting snowflakes and their intricate patterns. He observes the snowflakes and thinks of a certain pattern.
Let the th iteration of his pattern be , where the additions and subtractions alternate in twos. Frosty wants to know the remainder when is divided by .
Problem 10
On Christmas Eve, Santa’s elves are arranging gifts in different orders. There are gifts, where is an odd integer , and each gift has a value .
For each permutation of , the total joy from that arrangement is given by .
Santa wonders if there exist two distinct ways to arrange the gifts, of where such that the difference in the total joy, , is divisible by . Prove that such distinct arrangements do indeed exist.
Problem 11
According to the gingerbreads, a nice triplet of children is a triplet of three positive integers (where is prime) that satisfies . Name all such triplets.
Problem 12
Mrs. Claus saw the three Ghosts of Christmas heading towards their meeting point. She knows that the Ghosts love complex numbers and decides to riddle one of them. She asks the Ghost of Christmas present,
"If the non-uno complex solution to is of the form , then what is the value of ?"
The Ghost of Christmas present does not want to be late to the meeting but also doesn't want to ruin his public image. Help him solve this question.
Problem 13
Apparently, no one in hell wants to celebrate Christmas. Death sees this and decides to bring in the festive mood just for this year. He summons a nonadecagon which will invoke demons to celebrate Christmas.
If no adjacent demon houses ever get invoked on the same day, and there are never more than demon houses in a row that do not get invoked on the same day, how many different patterns of nonadecagonic invokations are possible?
Problem 14
Bradley has been put on the naughty list for using the Fundamental Theorem of Engineering to solve
Can you help him solve this problem properly?
Problem 15
Bradley is in a pickle again. He has been asked to solve a physics problem, although he only knows mathematics. You, too, only know mathematics, and you are tasked to help Bradley solve the following problem:
"If the density of a spherical planet is varying with the radius as . At what will its gravity be maximum?"
Luckily, there are secret notes with physics formulas that you can use to solve this problem:
These are constants:
Gravity is
This is all you need to solve this problem, the rest is just calculus.
Problem 16
After the Ghost of Christmas present solved Mrs. Claus' problem, he gave her a problem of his own. He asks,
"If is an angle of a triangle, what is the minimum value of ?"
He knows that Mrs. Claus is bad at calculus, and reassures her that calculus is not needed in this problem. Help Mrs. Claus solve this.
Problem 17
Christmas has arrived today at and it lasts days.
Santa wonders, what are the last three digits of ?