Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "User:Shalomkeshet"

(→‎Problem 13)
(→‎Problem 9)
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-3)^2 - (n-4)^2 + (n-5)^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>.
+
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==

Revision as of 02:05, 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 $A, B, C, D$ and $E$ 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 $\triangle ABC$. They want to know whether there is a line $\textit{\textrm{l}}$ in the plane of $\triangle ABC$ such that the intersection of the interior of $\triangle ABC$ and the interior of its reflection $\triangle A'B'C'$ in $\textit{\textrm{l}}$ has an area more than $\frac{2}{3}$ the area of $\triangle ABC$. 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 $N$, which is defined as the smallest positive integer such that this number multiplied by the peak gaming year, i.e., $2008 \cdot N$, is a perfect square and $2007 \cdot N$ is a perfect cube. Timmy needs to find the remainder when $N$ is divided by $25$.

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 $(x, y)$. A child is added to the nice list if $x, y$ are natural numbers and $x,y \le 100$. Children who do not satisfy these conditions are added to the naughty list.

Find the minimum number of lines with gradient $\frac{3}{7}$ 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 $$n.99$ to skip the ad for each nonnegative integer $n$. A "sales tax" of $7.5\%$ 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 $\frac{4}{7}$. Ginger1 flings the three coins up, and then Ginger2 flings the three coins up. Let $\frac{m}{n}$ be the probability that Ginger1 gets the same number of heads as Ginger2, where $m$ and $n$ are coprime, positive integers. Find $m+n$.


Problem 7

Santa's sleigh appears as a right-angled triangle $\triangle OAB$ with $\angle A = 90^\circ$. It lies inside a right angle with vertex $O$. The altitude of $\triangle OAB$ from $A$ is extended beyond $A$ until it intersects the side of angle $\angle O$ at $M$. The distances from $M$ and $B$ to the second side of angle $\angle O$ are 2 and 1 respectively.

Find the value of $\overline{OA}$.


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 $x + iy$. If this meeting place is represented by $z$, then $|z|-2=0$ and $|z-i|-|z+5i|=0|$ hold true.

What is the gradient $m$ of the line of form $y=mx+c$?


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 $n$th iteration of his pattern be $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$, where the additions and subtractions alternate in twos. Frosty wants to know the remainder when $x_{100}$ is divided by $1000$.

Problem 10

On Christmas Eve, Santa’s elves are arranging gifts in different orders. There are $n$ gifts, where $n$ is an odd integer $>1$, and each gift has a value $v_1, v_2, \dots, v_n$.

For each permutation $a = (a_1, a_2, \dots, a_n)$ of $\{1, 2, \dots, n\}$, the total joy from that arrangement is given by $J(a) = \sum_{i=1}^n v_i a_i$.

Santa wonders if there exist two distinct ways to arrange the gifts, $a,b$ of $\{1, 2, \dots, n\}$ where $a \neq b$ such that the difference in the total joy, $J(a) - J(b)$, is divisible by $n!$. 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 $(a,b,p)$ (where $p$ is prime) that satisfies $a^p = b! + p$. 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,

"What is the non-uno complex solution to $1^x=2$ is of the form $-i\frac{ln(A)}{B \cdot C}$, then the value of $sin\left(\frac{A \cdot B \cdot C}{2}\right)$?" 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 $19$ demons to celebrate Christmas.

If no $two$ adjacent demon houses ever get invoked on the same day, and there are never more than $two$ demon houses in a row that do not get invoked on the same day, how many different patterns of nonadecagonic invokations are possible?

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=User:Shalomkeshet&oldid=237784"