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$?

Write a function called checkfactor that takes two arrays of positive numbers, firstnumberrow and secondnumberrow. checkfactor checks if the first entry in firstnumberrow is divisible by the first entry in secondnumberrow, and performs the same operation on the next array elements until all entries have been checked. all the numbers are positive and the number of entries in the arrays are the same. the function should return the identified divisible numbers in two row arrays named firstdivisible and seconddivisible. restrictions: branches or loops should not be used. the code must use the internal mod and logical functions. hint: the mod function should be used to determine if two numbers are divisible. ex: for num1 and num2 if mod(num1,num2) is 0, then the two numbers are divisible. this is matlab