76. Should be straightforward, but the key thing is to organise how you count and map it to a simple series
77. If unsure, try a few simple values of k and spot which elementary function gives the result.
78. Could do it a few ways, mod (divisibilty), induction, algebra (factors), …
79. Again, organize the count and one way is to think about which lengths are possible then count all combinations of a particular length.
80. Think about the polygons with the smallest and largest number of possible sides, then how can you generate ones inbetween.
81. Sketch x and log(x) and think about their product. Axis cross point, where it crosses y=x, … What happens when x<1 and maybe differentiate to check behaviour. Integral is fairly standard by parts.
82. Google if necessary, but there are a few famous ones and the key thing is to think about their properties.
83. The Gauss trick for summing arithmetic series should help think about the argument (or using the usual formula). Exploring a few simple series doesnt really give a lot here.
84. Dont really understand question, apart from to note its something to do with apparent weight being small.
85. Can prove using geometry or using complex (polar) numbers.