A natural number is trodd if all their digits are different and if the sum of any three consecutive digits of is odd.
How many trodd 7 digit numbers can be made with the digits from 0 to 6?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
If a sum of three numbers is odd then either these three numbers are all odd or one of them is odd and the other two are even. As such, n will have one of these forms: o o o o o o o , e e o e e o e , o e e o e e o or e o e e o e e , with e being an even digit and o an odd one. Since there are only three odd numbers between 0 and 6 and only 4 even ones, we can conclude n is of the form: o e e o e e o . So, since there are 4 ! permutations between the four even digits and 3 ! between the odd ones, there are 4 ! ∗ 3 ! = 1 4 4 numbers which fullfill the condition given. Another way to calculate the possible combinations is to start with the first digit and recognizing that there are 3 possible digits for it, 4 for the next one, 3 for the next one ( given that one of the even digits has already been used) and so on, which yields the same answer: 3 ∗ 4 ∗ 3 ∗ 2 ∗ 2 ∗ 1 ∗ 1 = 1 4 4 .