maxterm definition. The binary information is passed in the form of 2 N input lines. maxterm definition

Before stating the formal definition of a limit, we must introduce a few preliminary ideas. Negation. 4. 4. Click here 👆 to get an answer to your question ️ How many languages are there in India?Minterm And Maxterm In Boolean Algebra publication summary collection offers just that - a concise and insightful recap of the bottom lines and themes of a book. Product of Sum (POS) is a method of defining a logic function by using maxterms, i. For example, x or x', y or y'. We would like to show you a description here but the site won’t allow us. , l n (x n)) where the l i are literals A maxterm is a Boolean function of the form Or (l 1 (x 1), l 2 (x 2), . Minterms and Maxterms Minterm A product term which contains each of the n variables as factors in either complemented or uncomplemented form is called a minterm Example for 3 variables: ab’c is a minterm; ab’ is not Maxterm A sum term which contains each of the n variables as factors in either complemented or Min-Terms and Max-Terms in boolean algebraWatch more videos at By: Ms. ‘+’ is changed to ‘·’, or ‘·’ is changed to ‘+’). (father of hundred Kauravas), Pandu (father of the five Pandavas) and vidhura were born -each from different mother"Who was abdul gaffar khan? See answers Advertisement• Maxterm (n variables) -- a normal sum term with n literals –2n terms, e. It mainly involves in two Boolean terms, “minterms” and “maxterms”. 2. The membership of any. It also follows that any Boolean function can be uniquely expressed as a product of maxterms (PoM) that evaluate to \(0\text{. 2. It is sum of minterms. DIGITAL LOGIC & MICROPROCESSOR Unit-I: Binary Systems : Digital Computers and Digital Systems - Binary Numbers - Numbe. c) Circuit theory. Definition of K-Map. View Answer. The binary information is passed in the form of N input lines. Advertisement. Minterm and Maxterm Expansions Each of the terms in Equation (4-1) is referred to as a minterm. 4. For SOP put 1’s in blocks of K-map respective to the minterms (0’s elsewhere). For 2 inputs, a 2-D square is used. Maxterm. In boolean logic, a disjunctive normal form ( DNF) is a canonical normal form of a logical formula consisting of a disjunction of conjunctions; it can also be described as an OR of ANDs, a sum of products, or (in philosophical logic) a cluster concept. First fill the cells with 1’s in SOP and 0’s in POS. Solution: The truth table contains two 1 s. • Since DeMorgan's Theorem holds for n variables, • giving: and Thus Mi is. Example 10. We will write 1 in place of non-complement variable A. Minterm is product of boolean variables either in normal form or complemented form. 1. Courses. 3-inputs = 3-D = cube. To make a group of cells, we can use the "don't care" cells as either 0 or 1, and if required, we can also ignore that cell. Firstly, draw the truth table for the given equation. The combinational circuits that change the binary information into N output lines are known as Encoders. the subset = {, ¯, ¯, ¯ ¯, ¯ ¯} of the bottom-level nodes (light green), the algorithm computes a minimal set of nodes (here: {¯,}, dark green) that covers exactly . EECC341 - Shaaban #6 Final Review Winter 2001 2-20-2002 Encoders • If the a decoder's output code has fewer bits than the input code, the device is usually called an encoder. Finding minterms from a boolean expression. Given e. See below. Maxterms are also called standard sum. (father of hundred Kauravas), Pandu (father of the five Pandavas) and vidhura were born -each from different mother"How many states are there in India????? - 14791942. For math, science, nutrition, history, geography, engineering, mathematics, linguistics, sports. Product of Sum expressions are Boolean expressions made up of sums consisting of one or more variables, either in its normal true form or complemented form or combinations of both, which are then AND’ed together. based on maxterm covering. Shalini7272 Shalini7272 Shalini7272Explanation:The literature on the consequences of the Reformation shows a variety of short- and long-run effects, including Protestant-Catholic differences in h…Hey there Dietrich Brandis, a German expert, was appointed the first Inspector-General of Forests in India. The digital circuit can be made up of several logic gates. It is used to analyze and simplify digital circuits or digital gates. Minterm is the product of N literals where each literal occurs exactly once. See also standard product of sums. 1. We assign them the output logic ‘1’. , x n that only uses the disjunction operator, where each of the n variables appears once in either its direct or its complemented (logical NOT) form is called a maxterm. Decoder. Quine McCluskey minimization method, is a technique for reducing for minimizing the expression in their SOP (sum of product) or POS (product of sum) form. . 2 Die zweielementige Boolesche Algebra 39 Bei nur zwei Eingangsvariablen Xo, Xl ergeben sich nach (6. Step 1 of 5. , x n that only uses the disjunction operator, where each of the n variables appears once in either its direct or its complemented (logical NOT) form is called a maxterm. A minterm is any product of n literals whereThis video tutorial provides an introduction into karnaugh maps and combinational logic circuits. . Sum of Product (SOP) FormThe main difference between SOP and POS is that the SOP is a way of representing a Boolean expression using min terms or product terms while the POS is a way of representing a Boolean expression using max terms or sum terms. Karnaugh Map or K-map is introduced by a telecom engineer, Maurice Karnaugh at Bell labs in 1953, as a refined technique of ‘Edward Veitch’s Veitch diagram’ and it is a method to simplify or reduce the complexities of a Boolean expression. Maxterms are defined as the sum of distinct literals, and they are used to represent Boolean functions that equal 0. Programmable Logic Array (PLA) is a fixed architecture logic device with programmable AND gates followed by programmable OR gates. The 6-variable k-map is made from 4-variable 4 k-maps. Select the K-map according to the number of variables. We will get four Boolean product terms by combining two variables x and y with logical AND operation. Maxterms– It is known as the sum term. The sequential circuit is a special type of circuit that has a series of inputs and outputs. Minterms & MaxtermsDisadvantages of Multiplexers in Digital Logic: 1. 3. in which each appears exactly once in true or complemented form. We assign ‘0’ to rest half of the terms. You can specify conditions of storing and accessing cookies. Limited number of data sources: The quantity of sources of info that can be taken care of by a multiplexer is restricted by the quantity of control lines, which can be a disservice in certain applications. Maxterm definition: (algebra) A sum that is a logical OR of a set of variables. To overcome this problem, a full subtractor was designed. In the case of POS, the maxterms are represented by 'M'. Sebelum Membahas mengenai Sum Of Product dan Product Of Sum. , 2 n, where the number of. 3 (p. POS uses maxterms. Three variable K Map may be represented as-. E. })6. 2. The charismatic leader of millions of Polish workers, he went on to become the president of Poland (1990–95). thus dhritarashtra. Minterms are the fundamental part of Boolean algebra. For the output, maxterm is a combination of the input variables that produces a 0 at the output. This is the most simplified expression of the sum of the product, and It is also a type of non-canonical. e. Maxterm is sum of boolean variables either in normal form or complemented form. How to use manner in a sentence. For POS put 0’s in blocks of K-map respective to the max terms (1’s elsewhere). Find the maxterm and minterm in the given expression. (father of hundred Kauravas), Pandu (father of the five Pandavas) and vidhura were born -each from different mother"Kaise tyari kal board ke paper kiiii Get the answers you need, now!Boolean algebra. Rules for Karnaugh Maps with Don't Care Conditions. For the equation Out= (A+B+C)=0, all three variables (A, B, C) must individually. All the maxterms in a product of maxterms should have the same variables, although each maxterm should differ. Example: a AND b AND c = 0 or (NOT (a) OR b) AND (NOT (c) OR d) = 0 are maxterms. As you can see variable A on the left side select 2 k-maps row-wise between these 4 k-maps. The illustration above left shows the maxterm (A+B+C), a single sum term, as a single 0 in a map that is otherwise 1s. The meaning of MANNER is a characteristic or customary mode of acting : custom. Sum-of-minterms and Product-of-maxterms A mechanical way to translate a function’s truth table into an expression: X Y Minterm Maxterm F 0 0 XY X+Y 0 0 1 XY X+Y 1 1 0 XY X+Y 1 1 1 XY X+Y 0 The sum of the minterms where the function is 1 “the function is one at any of these minterms”: F =XY+XY The product of the maxterms where the function. Digital Circuits - Canonical & Standard Forms. 0-maxterms = maxterms for which the function F = 0. Other canonical forms include the complete sum of prime implicants or Blake canonical form (and its dual), and the. if the maxterm is then that means and . . Before understanding Canonical Expressions, let us understand Minterms and Maxterms first. So, for a boolean function consisting of three variables, we draw a 2 x 4 K Map. A maxterm, denoted as Mi, where 0 ≤ i < 2n, is a sum (OR) of the n variables (literals) in which each variable is complemented if the value assigned to it is 1, and uncomplemented if it is 0. net dictionary. 3. Each variable in the maxterm is primed if the corresponding bit in the equivalent binary number is a 1 and unprimed if it is a 0. Multiplexer : Multiplexer is a data selector which takes several inputs and gives a single output. 4: Design a combinational circuit with three inputs and one output. SOP is formed by considering all the minterms, whose output is HIGH(1) POS is formed by considering all the maxterms, whose output is LOW. Toe nature of child-led and adult-led interactions in a children's museum was investigated in Early Childhood Education Journal (Mar. A minterm is any product of n literals whereA maxterm is a sum term that will output a zero for only one unique input code. Implicant is a product/minterm term in Sum of Products (SOP) or sum/maxterm term in Product of Sums (POS) of a Boolean function. E. When two 3 to 8 Decoder circuits are combined the enable pin acts as the input. Maxterm Definition: A minterm/maxterm of n variables is a product/sum of n literals in which each variable appears exactly once in either true or complement form (but not both) A literal is a variable or its complement, e. . Alternatively, we can say that if the number of input lines is equal to 2 m, then m selection lines are required to select one of n (consider 2 m. The underlying goal of using minterms is to simplify the logic used to reach a defined output. The. Each variable in the maxterm is primed if the corresponding bit in the equivalent binary number is a 1 and unprimed if it is a 0. An assertion that a statement fails or denial of a statement is called. A decoder circuit of the higher combination is obtained by adding two or more lower combinational circuits. Courses. the K- map must have both of them. Look for the minterms (maxterms) adjacent to each other, in order to combine them into larger squares. 2-to-4-Decoder Truth Table. The "Don't care" condition says that we can use the blank cells of a K-map to make a group of the variables. This article explores the minterms in depth in addition to the two-variable, three variable and four variable minterm tables and K-maps. An implicant refers to the product/minterm term in the SOP (Sum of Products) or the sum/maxterm term in the POS (Product of Sums) of a Boolean function. When we perform OR operation with 0, the result will be the same as the input variable. F = ∏ ( M 0, M 4, M 6, M 7) F = (A+B+C)(A̅+B+C)(A̅+B̅+C)(A̅+B̅+C̅) The Max terms are the complement of minterms. Observe that the maxterm are the duals of minterms. Maxterms are defined as the sum of distinct literals, and they are used to represent Boolean functions that equal 0. e. 6. It is a sum of all variables in a function and that function has the property that it is equal to 0 on exactly one row of that truth table. selected Mar 27, 2020 by Punit01. That is, the minterms represent mutually exclusive events, one of which is sure to occur on each trial. This image actually shows two Karnaugh maps: for the function ƒ, using minterms (colored rectangles) and for its complement, using maxterms (gray rectangles). . Example: – 101= A’+B+C’ Also, read more about Types of Number System, here. Simplify boolean expressions step by step. There are some minor changes in the maxterm solution, which are as follows: We will populate the K-map by entering the value of 0 to each sum-term into the K-map cell and fill the remaining cells with one's. Disjunctive Normal Form (DNF) is a standard way to write Boolean functions. A contradiction is a Boolean expression that evaluates to false (0) for all possible values of its variables. The calculator will try to simplify/minify the given boolean expression, with steps when possible. 1 Lecture 4 Logic gates and truth tables Implementing logic functions Canonical forms Sum-of-products Product-of-sums 2 Logic gates and truth tables AND X•Y XYThe remaining terms of this function are maxterms for which output is false. Now, let us discuss the 5-variable K-Map in detail. Meaning of minterm. e. Other product terms correspond to larger and larger subspaces as they have fewer and fewer variables. It is required that the wiring of the circuit is maintained when the outputs are established. These Boolean product terms are called as min terms or standard product terms. Here are the steps that are used to solve an expression using the K-map method: 1. In the above example, you can observe that each o/p of the decoder is truly a minterm, resulting from an assured inputs combination, that is: D0 =A1 A0, ( minterm m0) which corresponds to input 00 D1 =A1 A0, ( minterm m1) which corresponds to input 01 D2 =A1 A0, ( minterm m2) which corresponds to input 10 D3 =A1 A0. Example-011= A’BC. Maxterm. • For Maxterms: – “0” means the variable is “Not Complemented” and – “1” means the variable is “Complemented”. The output lines define the N-bit code for the binary information. The symbol. A+B' A'+B . Discuss. For n-variables i is in the set {0,1,. For example, x. So, the sequential circuit contains the combinational circuit and its memory storage elements. It is also called Binary Algebra or logical Algebra. A maxterm, such as A ¯ + B + C ¯, from section 3. What is the product of maxterms? Definition: Any Boolean function that is expressed as a sum of minterms or as a product of maxterms is said to be in its canonical form. Combining of adjacent squares in a k-map containing 1s (or 0s) for the purpose of simplification of a SOP (or POS)expression is called looping. Maxterm from valuesThe K-map is solved by making groups. Minterms-It is known as the product term. Think and answer the following: (1) Can you think of the different roles your parents play in society? Kaju 135 rupaya priti kg hai 6 rupiya 75 paisha me kitna kaju milega Previous Next We're in the know This site is using cookies under cookie policy . Below, we show the terminology for describing a list of maxterms. (algebra) A sum that is a logical OR of a set of variables where each individual variable only appears once in the sum, either in complemented or. PART I (20 Marks) Answer all questions. Similarly, we will get four Boolean sum terms by combining two. , consider a boolean function, F = AB + ABC + BC. Select the K-map according to the number of variables. 5. Decoders are called as min-term and max. (A number is prime if it is divisible only by itself and 1; 1 is considered to be prime and 0 is not. 3 Line to 8 Line Decoder Block Diagram. 1 (a) State the law represented by the following proposition and prove it with the help of a truth table: P V P = P [1] Law : Idempotent Law. We Canonical Product or Product of Maxterms (PoM) A product of sums in which each sum term is a maxterm. De-multiplexer. Based on the definition of minterms and maxterms, we can represent any switching function with two canonical form: canonical sum of products: Sum of its minterms (i. UNIT I. Maxterms are represented as ‘M’ 4. Maxterm. Maxterm: Consider three binary variables x, y, and z. e. Problem 1: Obtain the principal conjunctive normal form and principalPlease explain the question below and how to get the answer. Maxterm. The sum of all literals, either with complement or without complement, is known as maxterm. The first diagram indeed corresponds to the A'+B+C' expression. Courses. – A function can be written as a product A maxterm is a Boolean OR function with exactly one instance of each variable or its inverse. Delay: Multiplexers can present some postpone in the sign way, which can influence. In the image, E () signifies a sum of minterms, denoted in the article as . A literal is a single variable with in a term which may or may not be complemented. What does minterm mean? Information and translations of minterm in the most comprehensive dictionary definitions resource on the web. The truth table for Boolean expression F is as follows: Inputs. A maxterm list is a shorthand way of describing the information in a truth table. thus dhritarashtra. Decoder : Decoder is a logic circuit which n input lines into m output lines. This is an example of a technically correct answer that is of little use in the real world. I'm sure there is something wrong. Adding all the minterms for which output is 1, we getClass describing a Vavilov distribution. Name the traditional textile markets in India See answers AdvertisementAnswer:Town planning is the unique feature of Indus valley civilization. Rules for using don’t care conditions in K map: 1. , logical-OR) of all the variables, using the complement of each signal. Note that the Minterm List and Maxterm List taken together include the number of every row of the Truth Table. Logic gates play an important role in circuit design and digital systems. Having understood minterms and maxterms, you are now in a position to understand canonical forms. CHARACTERISTICS OF A MINTERM: • Minterm is a standard product term in which all variables appear exactly once (complemented or uncomplemented) • Represents exactly one combination of the binary variables in a truth table for which the function produces a “1” output. Now, we will write 0 in place of complement variables B' and C'. Courses. Definition: The algebra of logic is a Boolean algebra. The satisfiability of a clause set is determined in terms of the number of relative maxterms of the empty clause with respect to the clause set. The following table shows the minterms and maxterms-Maxterms and minterms are both special cases of Boolean functions. 3. It is a building block of a digital system and an electronic circuit that always have only one output. Since maximum number of terms possible = 2 n, so we choose half of the terms i. Don’t cares in a Karnaugh map, or truth table, may be either 1 s or 0 s, as long as we don’t care what the output is for an input condition we never expect to see. The probability density function of the Vavilov distribution as function of Landau's parameter is given by: [ p(lambda_L; kappa, eta^2) = frac{1}{2 pi i}int_{c-iinfty}^{c+iinfty} phi(s) e^{lambda_L s} ds]One way to remember De Morgan's theorem is that in an AND, NAND, OR, or NOR combination of Boolean variables or inverses, an inversion bar across all the variables may be split or joined at will, provided the operator combining them is changed simultaneously (i. Repeat the process for the 1 in the last line of the truth table. Think and answer the following: (1) Can you think of the different roles your parents play in society? Kaju 135 rupaya priti kg hai 6 rupiya 75 paisha me kitna kaju milega Previous Next We're in the know This site is using cookies under cookie policy . For a Boolean Expression, if PCNF has m terms and PDNF has n terms, then the number of variables in such a Boolean expression = . We illustrate how to identify groups of adjacent cells which leads to a Sum-of-Products simplification of the digital logic. In standard form Boolean function will contain all the variables in either. [citation needed] As a normal form, it is useful in automated theorem proving . Minterm and maxterm definition can anyone please explain this sentence "satyavati requested Vyasa's assistance in producing and heir for the throne of Hastinapur. The final expression is F = A’B’C’+BC+ABC’. President. For n variables, total number of terms possible = number of combinations of n variables = 2 n. Minterms and Maxterms. George Boole invented the first way of manipulating symbolic logic, which later became known as Boolean Algebra. The symbol. Because of its vast applications in switching. are. When the binary input is 0, 1, 2, or 3, the binary out. By the definition of minimal cost solution, the SOP solution is simpler. Read. The probability density function of the Vavilov distribution as function of Landau's parameter is given by: [ p(lambda_L; kappa, eta^2) = frac{1}{2 pi i}int_{c-iinfty}^{c+iinfty} phi(s) e^{lambda_L s} ds]For n variables, total number of terms possible = number of combinations of n variables = 2 n. Branches (2839) . . (Σ) - Find the maxterm definition of the function. Therefore each of the maxterm has the truth value F for exactly one combination of the truth values of the variables. Maxterm. Class describing a Vavilov distribution. (father of hundred Kauravas), Pandu (father of the five Pandavas) and vidhura were born -each from different mother"Humayun conflict with Sher Shah Write a short not on same? Get the answers you need, now!Minterm and maxterm definition 3. The same example illustrates our point. Thus, the minterms form a partition. When forming groups of cells, treat the don’t care cell as either a 1 or a 0, or ignore the don’t cares. thus dhritarashtra. Identify minterms or maxterms as given in the problem. 1 Combinational Logic: Scope • Description – Language: e. The previous output is treated as the present state. It works with variables with two different values, such as 0 (False) and 1 (True), as well as logically significant operations. g. And what is minterm. These gates can have one input or more than one input, but most of the gates have two inputs. The steps for the maxterm are same as minterm: In the first step, we will write the term consisting of all the variables; Next, we will write 0 in place of all the complement variables such as ~A or A'. A set of synergic heuristic strategies are presented and elaborated. No shorter disjunctions can be used for the representation of f; this expression consists of maxterms. The K-map shows that if the non-standard SOP expression A + BC is converted into a. (father of hundred Kauravas), Pandu (father of the five Pandavas) and vidhura were born -each from different mother"Class describing a Vavilov distribution. Standard Form – A Boolean variable can be expressed in either true form or complemented form. It states that P v P = P. Minterm and maxterm definition can anyone please explain this sentence "satyavati requested Vyasa's assistance in producing and heir for the throne of Hastinapur. 3). In canonical form, a boolean function is expressed as sum of minterms or product of maxterms and is obtained by reading a function from the truth table. To construct the product of maxterms, look at the value of Not f. In general, a minterm of n variables is a product of n literals in which each variable appears exactly once in either true or complemented form, but not both. (except 1). A) Give precise definition of Minterm and Maxterm (4 points) b) Determine the algebraic expressions for m13, M14 and M. 1-maxterms = maxterms for which the function F = 1. Applies commutative law, distributive law, dominant (null, annulment) law, identity law, negation law, double negation (involution) law, idempotent law, complement law, absorption law, redundancy law, de. Minterm and maxterm definition can anyone please explain this sentence "satyavati requested Vyasa's assistance in producing and heir for the throne of Hastinapur. Definition: a maxterm of n variables is a sum of the variables. In the image, E() signifies a sum of minterms, denoted in the article as . Each of the maxterms are then multiplied together to create the final system output. Maxterm is the sum of N distinct literals where each literals occurs exactly once. maxterm (plural maxterms) ( algebra) A sum that is a logical OR of a set of variables where each individual variable only appears once in the sum, either in complemented or uncomplemented form, so that the value of the sum becomes 0. Maxterm – sum of two or more literal using ORing of each literal. . • The simplest encoder is a 2n-to-n binary encoder, where it has only one of 2n inputs = 1 and the output is the n-bit binary number corresponding to the. The tree index reflects the "common-thread" structure of Bo P:. thus dhritarashtra. For example, the expression a’bc’ + a’bd’ + a’bc’d shows a SOP expression. The probability density function of the Vavilov distribution as function of Landau's parameter is given by: [ p(lambda_L; kappa, eta^2) = frac{1}{2 pi i}int_{c-iinfty}^{c+iinfty} phi(s) e^{lambda_L s} ds]devices that process time-varying signals that can take on any value over some continuous rangeClass describing a Vavilov distribution. It also follows that any Boolean function can be uniquely expressed as a product of maxterms (PoM) that evaluate to (0 ext{. To convert from one canonical form to its other equivalent form, interchange the symbols Σ and Π, and list the index numbers that were excluded from the original form. There are the following steps used to solve the expressions using K-map: First, we find the K-map as per the number of variables. The membership of any minterm depends upon the membership of each generating set [Math Processing Error] A, B, C or [Math Processing Error] D, and the relationships between them. PLDs have an undefined function at the time of manufacturing, but they are programmed before being. Assume the function given below; F(A,B,C)=Aˉ+Bˉ⋅Cˉ+B⋅C - Write the truth table of the function. Maxterms correspond to a “0” on the cube. For SOP put 1’ s in blocks of K -map respective to the minterms (0’ s elsewhere). Minterm and maxterm definition 3. a a a b a b a b a bA maxterm is addition of all variables taken either in their direct or complemented form. See answers AdvertisementWhat was Samin Movement? See answers AdvertisementMichel foucault called his method archaeology of knowledge See answers AdvertisementConsider the following Boolean function of four variables: f (w,x,y,z) = ∑ (1,3,4,6,9,11,12,14) The function is: independent of one variables. Maxterm is represented by M. MINIMIZATION TECHNIQUES AND LOGIC GATES. There usually is a precise definition when duality is applied to specific concepts, for just that context. Boolean algebra is a branch of mathematics that deals with the manipulation of variables which can assume only two truth values, true or false, denoted by 1 and 0, respectively. . Recall that the distance between two points a a and b b on a number line is given by |a−b| | a − b |. As we have done above in our equation for \(\overline{W_1}\), the standard way to represent a maxterm is as the sum (i. 3. It explains how to take the data from a truth table and tr. For Example: Take decimal number 625. Identify maxterms or minterms as given in the problem. • A maxterm is the sum of N distinct literals where each literal occurs exactly once. Also, Boolean functions can be simplified using Karnaugh map ( K - map) without using Boolean theorems, by transferring a function to K-map and reading simplified function from K-map. By 'simplify' the logic I mean that there could be at least 3 possible goals. A Boolean function can be represented in the form of sum of minterms or the product of maxterms , which enable the designer to make a truth table more easily. To understand DNF, first the concept of a minterm will be covered. 3 to 8 line decoder circuit is also called a binary to an octal decoder. Maxterm. Identify minterms or maxterms as given in the problem. Sorted by: 1. We will have eight possible combinations. Knowing how to generate Gray code should allow us to build larger maps. Boolean functions expressed as a sum of minterms or product of maxterms are said to be in canonical form. Repeat the process for the 1 in the last line of the truth table. The below figure shows the block diagram of a multiplexer consisting of n input lines, m selection lines and one output line. With n variables, 2. To convert from one canonical form to its other equivalent form, interchange the symbols and , and list the index numbers that were excluded from the original form. At a time, only one input line is activated. Therefore M i = m’ i. In Boolean expression, Maxterm is a sum of literals in which every input variable appears once and only once. Maxterm.