MathDB
2021 SMT Guts Round 6 p21-24 - Stanford Math Tournament

Source:

February 11, 2022
algebrageometrycombinatoricsnumber theoryStanford Math TournamentSMT

Problem Statement

p21. If f=cos(sin(x))f = \cos(\sin (x)). Calculate the sum n=02021f(nπ)\sum^{2021}_{n=0} f'' (n \pi).
p22. Find all real values of AA that minimize the difference between the local maximum and local minimum of f(x)=(3x24)(xA+1A)f(x) = \left(3x^2 - 4\right)\left(x - A + \frac{1}{A}\right).
p23. Bessie is playing a game. She labels a square with vertices labeled A,B,C,DA, B, C, D in clockwise order. There are 77 possible moves: she can rotate her square 9090 degrees about the center, 180180 degrees about the center, 270270 degrees about the center; or she can flip across diagonal ACAC, flip across diagonal BDBD, flip the square horizontally (flip the square so that vertices A and B are switched and vertices CC and DD are switched), or flip the square vertically (vertices BB and CC are switched, vertices AA and DD are switched). In how many ways can Bessie arrive back at the original square for the first time in 33 moves?
p24. A positive integer is called happy if the sum of its digits equals the two-digit integer formed by its two leftmost digits. Find the number of 55-digit happy integers.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here.