Discrete math is a form of mathematics that applies to steps of logic, there are such things as analogue computers whos means of measure is setup such they perform operations upon a continuous flow of logic, however, these types of computer are seldom used, found only in specific usecase's or situations, such as models and simulations. For the most part computers must have specific predefined discrete quanta in order to make their calculations.
When working with discrete maths considers sets of situations that are countable or otherwise distinct, individually definable; This area or branch of maths is particularly useful when applied to real world problems. For example: We use set theory to describe situation; A 'set' of stairs has a distinct number or set of steps, and your 'set' of feet is finite and countable. As such an algorithm can be defined that will explicitly describe the operation that is your walking up or down the stair.
Discrete math resembles to the logic that we use when making choices or decisions, how to navigate traffic lights or prepare a recipe in the kitchen.
This puzzle consists of an encrypted long division with a mapping of numbers to letters such that the math is hidden.
We could take a brut force approach here and map each of the letters to a number and then replace each letter in the solution with a number, when we start assigning letters there are ten ways that we can assign 0, taking one letter out that leaves nine ways that we can assign 1, which takes another letter out leaving eight letters to assign to 2 and so on and so fourth. 10! ten factorial which gives us.
10! = 10·9·8·7·6·5·4·3·2·1 = 3,628,800
If we suppose that we do not find the correct combination untill the very last one, the worst case senario, and that it takes 1 millisecond for each configurations computation; This means that it will take us about 3628 seconds to find the correct combination dividing that by sixty you get about sixty. It is going to take about an hour to find the combination. Surely there must be a way to find this solution faster; Using some of the principles of discrete math!
Next we will see what is known as a proof by contradiction, prooving that something is true by demonstrating that all the other casses are not true. So what can not be true; We look at the beginning of every number...
Which letters cannot be zero?
FBE