The graphical solution procedure generally means you graph the constraint inequalities to identify the feasible solution region, then locate the objective function curve so as to maximize its value. When the objective function is a linear function, maximizing it generally means locating it at the vertex of the feasible region that makes it farthest from the origin.
The solution is
... (A, B) = (100, 50)
Answer:
4
Explanation:
Since it's a flippy number, we can set each digit into ababa
Since it can be divisible by 15, which means it can be divisible by both 5 and 3.
Since it is divisible by 5, the last digit will be either 0 and 5, but it cannot be 0 because 0 cannot be the first digit, so last digit must be 5.
So, ababa --> 5b5b5
It can also be divisible by 3. According to de divisibility rule of 3, if the sum of all digit is divisible by 3 then the number is divisible by 3.
Sum of all digits = 15 + 2b
it's divisible by 3 when b = 0,3,6,9
The answer is 4.
There are 4 such number.
