Is it possible for a knight to move around an 8 × 8 chessboard so that it makes every possible move exactly once (consider a move between two squares con- nected by a knight to be completed when the move is made in either direction)?

step-by-step explanation:

no, her answer is not correct.   we square the lengths of all sides and then determine whether the pythagorean theorem holds here:

9² + 15² = 306.   this is not equal to the square of the longest side ( that square being 395.   answer c is correct.

1.30

step-by-step explanation:

answer:  

step-by-step explanation:

odd numbers are only divisible by 1 and itself.

even numbers are divisible by more than 1 and itself.

for example 6 is even because it is divisible by more than 1 and its self. 1 x 6= 6 ; 2 x 3= 6

and 7 is odd because only 7 x 1 equals seveb