For any positive integer $n$, let $G(n)$ be the number of pairs of adjacent bits in the binary representation of $n$ which are different. For example, $G(10)=3$ because the bits of $1010_2$ change at all three places and $G(12)=1$ because the bits of $1100_2$ change only from the fours to the twos place. For how many positive integers $n<2^{10}$ is it true that $G(n)=2$?

Carlos, an algebra teacher, is creating a series of powerpoint presentations to use during class lectures. after writing, formatting, and stylizing the first presentation, he would like to begin writing the next presentation. he plans to insert all-new content, but he wants to have the same formatting and style as in the first one. what would be the most efficient way for carlos to begin creating the new presentation? going under the file tab and opening the first presentation, deleting all content from each page, and adding new content going under the file tab and clicking on new in the left pane, then choosing new from existing going under the design tab and clicking on themes, then selecting the theme that was used for the first template going under the design tab and opening the template that was created for the first presentation