Answer:
Step-by-step explanation:
To prove divisibility, we need to factor the divident such that one of its factors matches the divisor.
(I use the notation x|y to denote that x divides y)
(A)
(B)
In this case, it is easier to also factor the divisor to primes:
Both of these factor must be matched in the dividend in order to prove divisibility, and that indeed turns out to be true:
The property of equality of the rows, columns, and diagonals in the magic
square can be used to find the value of <em>n</em>.
The value of <em>n</em> is 6
Reasons:
The magic square can be presented as follows;
Given that the sum of the numbers in each row and in each column and in
each of the two diagonals are equal, to find the value of <em>n</em>, two rows having
different number of the variable <em>n</em> can be equated as follows;
The top row = n - 2 + 3 + n + 2 = The bottom row = 2 + 2·n - 5 + n
n - 2 + 3 + n + 2 = 2 + 2·n - 5 + n
2·n + 3 = 3·n - 3
3·n - 3 = 2·n + 3 (symmetric property)
3·n - 2·n = 3 + 3
n = 6
Learn more here: