p29. Consider pentagon ABCDE. How many paths are there from vertex A to vertex E where no edge is repeated and does not go through E.
p30. Let a1,a2,... be a sequence of positive real numbers such that ∑n=1∞an=4. Compute the maximum possible value of ∑n=1∞2nan (assume this always converges).
p31. Define function f(x)=x4+4. Let P=k=1∏2021f(4k−3)f(4k−1). Find the remainder when P is divided by 1000.
p32. Reduce the following expression to a simplified rational: cos79π+cos795π+cos797π
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here. algebrageometrycombinatoricsnumber theoryStanford Math TournamentSMT