You can divide 50 by 5 (2+(1.50x2)) 50/5 is 10 10x + 20y.
Happy studying ^-^
Assuming a d-heap means the order of the tree representing the heap is d.
Most of the computer applications use binary trees, so they are 2-heaps.
A heap is a complete tree where each level is filled (complete) except the last one (leaves) which may or may not be filled.
The height of the heap is the number of levels. Hence the height of a binary tree is Ceiling(log_2(n)), for example, for 48 elements, log_2(48)=5.58.
Ceiling(5.58)=6. Thus a binary tree of 6 levels contains from 2^5+1=33 to 2^6=64 elements, and 48 is one of the possibilities. So the height of a binary-heap with 48 elements is 6.
Similarly, for a d-heap, the height is ceiling(log_d(n)).
The lengths of sides of a triangle have to satisfy the triangle inequality, which states that the sum of the two shorter sides must exceed the length of the third side.
Here 9+8=17 (not greater), so these segments do not form a triangle.
When 
, we have
and of course 3 | 6. ("3 divides 6", in case the notation is unfamiliar.)
Suppose this is true for 
, that
Now for 
, we have
so we know the left side is at least divisible by 
by our assumption.
It remains to show that
which is easily done with Fermat's little theorem. It says
where 
is prime and 
is any integer. Then for any positive integer 
,
Furthermore,
which goes all the way down to
So, we find that
QED
Answer:
147
Step-by-step explanation:
82+9(12÷3×2)-7
82+9(4×2)-7
82+9(8)-7
82+72-7
154-7
147
Follow PEMDAS
