I was working on a question and involved 11 and I wondered what the divisibility rule was?
So then I had a bit of a think about it.
Let be a number divisible by . The
Now which is congruent to because , which is a multiple of 11.
Thus
Odd powers will be negative and even positive.
So if we start at one end of the number and add every second digit (i.e. first digit plus third digit plus fifth digit etc.) and then subtract the other digits (i.e. second digit, fourth digit, six digit, etc.), if that equals zero then the number is divisible by 11.
Two rectangular garden beds have a combined area of . The larger bed has twice the perimeter of the smaller and the larger side of the smaller bed is equal to the smaller side of the larger bed. If the two beds are not similar, and if all edges are a whole number of metres, what is the length, in metres, of the longer side of the larger bed? AMC 2007 S.14
Let’s draw a diagram
From the information in the question, we know
(1)
and
(2)
Equation becomes
As the sides are whole numbers, consider the factors of 40.
Remember
Perimeter Large
Perimeter Small
Comment
must be greater than
This one works
This one also works
not a whole number
Not possible
Not possible
Not possible
There are two possibilities
The large garden bed could be by and the smaller by (Area Perimeters and )
or
The large garden bed could be by and the smaller by (Area Perimeters and )
I am came across this problem and was fascinated. It’s from this book
At first I went straight to the 14-sided polygon, and tried to draw the diamonds (parallelograms), but then I thought let’s start smaller and see if there is a pattern.
Clearly a square contains 1 diamond (itself).
Pentagon
It’s not possible with a pentagon.
Hexagon
A hexagon has 6 diamonds
Septagon
I am guessing it’s not possible to fill a regular 7-sided shape with diamonds
It’s not possible with odd numbers of sides. Regular polygons with an odd number of sides have no parallel sides, so we can’t cover it with rhombi (which have opposite sides parallel).
Octagon
An octagon has 6 diamonds.
We know a decoagon has 10 diamonds (from the question)
Let’s put together what we know
Diamonds
These are the triangular numbers, so when the number of diamonds is , and for it’s .
We can work out a rule for calculating the number of diamonds given the number of sides.
Because the difference in the values is not , I am going to get and in terms of and then combine the two equations.
From the above table,
We know this rule is quadratic as the second difference is constant, hence
(1)
(2)
Solve simultaneously, subtract equation from equation
In combinatorial mathematics, a derangement is a permutation of the elements of a set in which no element appears in its original position.
For example, if we have the set , there are permutations
But only of them are derangements – and
I did a practical question on this here. In that question I used a tree diagram, but there must be a way to determine the number of derangements given elements.
We know elements has derangements, what about elements? We know there are permutations
ABCD
BACD
CABD
DABC
ACBD
BADC
CADB
DACB
ACDB
BCAD
CBAD
DBAC
ABDC
BCDA
CBDA
DBCA
ADBC
BDAC
CDAB
DCAB
ADCB
BDCA
CDBA
DCBA
I have highlighted the derangements. when there are derangements.
Let’s try to generalise.
In how many ways can one element be in its original position? Choose one element from the 4 to be in its original position, and then arrange the remaining three elements.
So far, we have
Clearly we are counting some arrangements multiple times, for example ABDC has A and B in the correct position, so we need to add all of the arrangements with elements in their original position.
In how many ways can two elements be in their original position?
So now we have,
But once again we have counted some arrangements multiple times, so we need to subtract all of the arrangements with elements in their original position.
In how many ways can three elements be in their original position?
So now we have,
We now need to add all of the arrangements with elements in their original position.
In how many ways can four elements be in their original position?