The relation "divides" on a set of positive integers is .................. (A) Symmetric and transitive (B) Anti symmetric and transitive (C) Symmetric only (D) Transitive only

The relation "divides" on a set of positive integers is .................. (A) Symmetric and transitive (B) Anti symmetric and transitive (C) Symmetric only (D) Transitive only
by

1 Answer

Answer :

(B) Anti symmetric and transitive

Explanation: The ‘divide’ operation is antisymmetric because if a divides b does not necessarily implies that b divides a. If a divides b and b divides c then a divides c. So, it is transitive as well.
by

Related questions

Check whether the relation R defined in the set {1, 2, 3, 4, 5, 6} as R = {(a, b): b = a + 1} is reflexive, symmetric or transitive. -Maths 9th

Description : Check whether the relation R defined in the set {1, 2, 3, 4, 5, 6} as R = {(a, b): b = a + 1} is reflexive, symmetric or transitive. -Maths 9th

Last Answer : Reflexive: R = {(a, b) : b = a +1} = {(a, a + l) : a, a + 1∈{l, 2, 3, 4, 5, 6}} = {(1, 2), (2, 3), (3, 4), (4, 5), (5, 6)} ⇒ R is not reflexive since (a, a) ∉R for all a. Symmetric: R is not symmetric as (a ... as (a, b) ∈ R and (b, c) ∈ R but (a, c) ∉ R e.g., (1, 2) ∈ R (2, 3) ∈ R but (1, 3) ∉R

Let P(m,n) be the statement “m divides n” where the Universe of discourse for both the variables is the set of positive integers. Determine the truth values of the following propositions. (a) ∃m ∀n P(m,n) (b) ∀n P(1,n) (c) ∀m ∀n P(m,n) (A) (a)-True; (b)-True; (c)-False (B) (a)-True; (b)-False; (c)-False (C) (a)-False; (b)-False; (c)-False (D) (a)-True; (b)-True; (c)-True

Description : Let P(m,n) be the statement m divides n where the Universe of discourse for both the variables is the set of positive integers. Determine the truth values of the following propositions. (a) ∃m ∀n P(m,n) (b) ∀n P(1,n) ( ... -False (C) (a)-False; (b)-False; (c)-False (D) (a)-True; (b)-True; (c)-True

Last Answer : Answer: A

Which of the following is/are not true? (a) The set of negative integers is countable. (b) The set of integers that are multiples of 7 is countable. (c) The set of even integers is countable. (d) The set of real numbers between 0 and 1/2 is countable. (A) (a) and (c) (B) (b) and (d) (C) (b) only (D) (d) only

Description : Which of the following is/are not true? (a) The set of negative integers is countable. (b) The set of integers that are multiples of 7 is countable. (c) The set of even integers is countable. (d) The set of real numbers between 0 ... . (A) (a) and (c) (B) (b) and (d) (C) (b) only (D) (d) only

Last Answer : (D) (d) only

Which of the following property/ies a Group G must hold, in order to be an Abelian group? (a) The distributive property (b) The commutative property (c) The symmetric property Codes: (A) (a) and (b) (B) (b) and (c) (C) (a) only (D) (b) only

Description : Which of the following property/ies a Group G must hold, in order to be an Abelian group? (a) The distributive property (b) The commutative property (c) The symmetric property Codes: (A) (a) and (b) (B) (b) and (c) (C) (a) only (D) (b) only

Last Answer : Answer: D

Let f and g be the functions from the set of integers to the set integers defined by f(x) = 2x + 3 and g(x) = 3x + 2 Then the composition of f and g and g and f is given as (A) 6x + 7, 6x + 11 (B) 6x + 11, 6x + 7 (C) 5x + 5, 5x + 5 (D) None of the above

Description : Let f and g be the functions from the set of integers to the set integers defined by f(x) = 2x + 3 and g(x) = 3x + 2 Then the composition of f and g and g and f is given as (A) 6x + 7, 6x + 11 (B) 6x + 11, 6x + 7 (C) 5x + 5, 5x + 5 (D) None of the above

Last Answer : (A) 6x + 7, 6x + 11 Explanation: fog(x)=f(g(x))=f(3x+2)=2(3x+2)+3=6x+7 gof(x)=g(f(x))=g(2x+3)=3(2x+3)+2=6x+11

If there are n integers to sort, each integer has d digits and each digit is in the set {1,2, ..., k}, radix sort can sort the numbers in: (A) O(d n k) (B) O(d nk) (C) O((d+n)k) (D) O(d(n+k))

Description : If there are n integers to sort, each integer has d digits and each digit is in the set {1,2, ..., k}, radix sort can sort the numbers in: (A) O(d n k) (B) O(d nk) (C) O((d+n)k) (D) O(d(n+k))

Last Answer : (D) O(d(n+k))

The relation ‘is a sister of ’ is (A) non-symmetrical (B) symmetrical (C) asymmetrical (D) transitive

Description : The relation ‘is a sister of ’ is (A) non-symmetrical (B) symmetrical (C) asymmetrical (D) transitive

Last Answer : (D) transitive

A triangulation of a polygon is a set of T chords that divide the polygon into disjoint triangles. Every triangulation of n-vertex convex polygon has ................ chords and divides the polygon into ............... triangles. (A) n-2, n-1 (B) n-3, n-2 (C) n-1, n (D) n-2, n-2

Description : A triangulation of a polygon is a set of T chords that divide the polygon into disjoint triangles. Every triangulation of n-vertex convex polygon has ................ chords and divides the polygon into ............... triangles. (A) n-2, n-1 (B) n-3, n-2 (C) n-1, n (D) n-2, n-2

Last Answer : (B) n-3, n-2

Binary symmetric channel uses (A) Half duplex protocol (B) Full duplex protocol (C) Bit oriented protocol (D) None of the above

Description : Binary symmetric channel uses (A) Half duplex protocol (B) Full duplex protocol (C) Bit oriented protocol (D) None of the above

Last Answer : (A) Half duplex protocol

Find the false statement: (A) In Modern Cryptography, symmetric key algorithms use same key both for Encryption and Decryption. (B) The Symmetric cipher DES (Data Encryption Standard) was widely used in the industry for security product. (C) The AES (Advanced Encryption Standard) cryptosystem allows variable key lengths of size 56 bits and 124 bits. (D) Public key algorithms use two different keys for Encryption and Decryption.

Description : Find the false statement: (A) In Modern Cryptography, symmetric key algorithms use same key both for Encryption and Decryption. (B) The Symmetric cipher DES (Data Encryption Standard) was widely used ... and 124 bits. (D) Public key algorithms use two different keys for Encryption and Decryption.

Last Answer : (C) The AES (Advanced Encryption Standard) cryptosystem allows variable key lengths of size 56 bits and 124 bits.

Let R be a relation on the set of integers given by a = 2^k .b for some integer k. Then R is -Maths 9th

Description : Let R be a relation on the set of integers given by a = 2^k .b for some integer k. Then R is -Maths 9th

Last Answer : (c) equivalence relationGiven, a R b = a = 2k .b for some integer. Reflexive: a R a ⇒ a = 20.a for k = 0 (an integer). True Symmetric: a R b ⇒ a = 2k b ⇒ b = 2-k . a ⇒ b R a as k, -k are both ... = 2k1 + k2 c, k1 + k2 is an integer. ∴ a R b, b R c ⇒ a R c True ∴ R is an equivalence relation.

Which of the following statement(s) is/are TRUE with regard to software testing? I. Regression testing technique ensures that the software product runs correctly after the changes during maintenance. II. Equivalence partitioning is a white-box testing technique that divides the input domain of a program into classes of data from which test cases can be derived. (1) only I (2) only II (3) both I and II (4) neither I nor II

Description : Which of the following statement(s) is/are TRUE with regard to software testing? I. Regression testing technique ensures that the software product runs correctly after the changes during maintenance. II. Equivalence partitioning is a ... (1) only I (2) only II (3) both I and II (4) neither I nor II

Last Answer : (1) only I 

A structure brings together a group of A) items of the same data type B) related data items and variables C) integers with user defined names D) floating points with user defined names

Description : A structure brings together a group of A) items of the same data type B) related data items and variables C) integers with user defined names D) floating points with user defined names

Last Answer : B) related data items and variables

If n and r are non-negative integers and n≥r, then p(n + 1, r) equals to (A) P(n,r)(n+1) / (n+1-r) (B) P(n,r)(n+1) / (n-1+r) (C) p(n,r)(n-1) / (n+1-r) (D) p(n,r)(n+1) / (n+1+r)

Description : If n and r are non-negative integers and n≥r, then p(n + 1, r) equals to (A) P(n,r)(n+1) / (n+1-r) (B) P(n,r)(n+1) / (n-1+r) (C) p(n,r)(n-1) / (n+1-r) (D) p(n,r)(n+1) / (n+1+r)

Last Answer : (A) P(n,r)(n+1) / (n+1-r)  Explanation: p(n, r) = n!/(n-r)! p( n+1, r) = (n+1)!/(n+1-r)! = (n+1) n! /(n+1-r) (n-r)! = P(n, r)(n+1)/(n+1-r)

What does the following declaration mean ? int (*ptr) [10]; (A) ptr is an array of pointers of 10 integers. (B) ptr is a pointer to an array of 10 integers. (C) ptr is an array of 10 integers. (D) none of the above.

Description : What does the following declaration mean ? int (*ptr) [10]; (A) ptr is an array of pointers of 10 integers. (B) ptr is a pointer to an array of 10 integers. (C) ptr is an array of 10 integers. (D) none of the above.

Last Answer : (B) ptr is a pointer to an array of 10 integers.

Let A and B be two fuzzy integers defined as: A={(1,0.3), (2,0.6), (3,1), (4,0.7), (5,0.2)} B={(10,0.5), (11,1), (12,0.5)} Using fuzzy arithmetic operation given by Image (A) {(11,0.8), (13,1), (15,1)} (B) {(11,0.3), (12,0.5), (13,1), (14,1), (15,1), (16,0.5), (17,0.2)} (C) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,1), (16,0.5), (17,0.2)} (D) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,0.7), (16,0.5), (17,0.2)}

Description : Let A and B be two fuzzy integers defined as: A={(1,0.3), (2,0.6), (3,1), (4,0.7), (5,0.2)} B={(10,0.5), (11,1), (12,0.5)} Using fuzzy arithmetic operation given by (A) {(11,0.8), (13,1), (15,1)} ( ... ,0.2)} (D) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,0.7), (16,0.5), (17,0.2)}

Last Answer : (D) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,0.7), (16,0.5), (17,0.2)}

Which of the following algorithms sort n integers, having the range 0 to (n2 -1), in ascending order in O(n) time ? (A) Selection sort (B) Bubble sort (C) Radix sort (D) Insertion sort

Description : Which of the following algorithms sort n integers, having the range 0 to (n2 -1), in ascending order in O(n) time ? (A) Selection sort (B) Bubble sort (C) Radix sort (D) Insertion sort

Last Answer : (C) Radix sort

A tree with n vertices is called graceful, if its vertices can be labelled with integers 1, 2, ...,n such that the absolute value of the difference of the labels of adjacent vertices are all different. Which of the following trees are graceful?

Description : A tree with n vertices is called graceful, if its vertices can be labelled with integers 1, 2, ...,n such that the absolute value of the difference of the labels of adjacent vertices are all different. Which of the following trees are ... (B) (b) and (c) (C) (a) and (c) (D) (a), (b) and (c)

Last Answer : Answer: D

Compute the value of adding the following two fuzzy integers: A = {(0.3,1), (0.6,2), (1,3), (0.7,4), (0.2,5)} B = {(0.5,11), (1,12), (0.5,13)} Where fuzzy addition is defined as μA+B(z) = maxx+y=z (min(μA(x), μB(x))) Then, f(A+B) is equal to (A) {(0.5,12), (0.6,13), (1,14), (0.7,15), (0.7,16), (1,17), (1,18)} (B) {(0.5,12), (0.6,13), (1,14), (1,15), (1,16), (1,17), (1,18)} (C) {(0.3,12), (0.5,13), (0.5,14), (1,15), (0.7,16), (0.5,17), (0.2,18)} (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)}

Description : Compute the value of adding the following two fuzzy integers: A = {(0.3,1), (0.6,2), (1,3), (0.7,4), (0.2,5)} B = {(0.5,11), (1,12), (0.5,13)} Where fuzzy addition is defined as μA+B(z) = maxx+y=z (min(μA(x), μB( ... ,18)} (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)}

Last Answer : (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)} 

Which of the following is not the same set of numbers A) counting numbers (B) positive integers (C) whole numbers (D) natural numbers?

Description : Which of the following is not the same set of numbers A) counting numbers (B) positive integers (C) whole numbers (D) natural numbers?

Last Answer : C. whole numbers can be negative and don't match the other sets

Consider the following statements : `1.` `Nuu(BnnZ)=(NuuB)nnZ` for any subset `B` of `R`, where `N` is the set of positive integers, `Z` is the set of

Description : Consider the following statements : `1.` `Nuu(BnnZ)=(NuuB)nnZ` for any subset `B` of `R`, where `N` is the set of positive integers, `Z` is the set of

Last Answer : Consider the following statements : `1.` `Nuu(BnnZ)=(NuuB)nnZ` for any subset `B` of `R`, where `N` is the ... Both `1` and `2` D. Neither `1` nor `2`

Equivalence partitioning is a .................. method that divides the input domain of a program into classes of data from which test cases can be derived. (A) White-box testing (B) Black-box testing (C) Orthogonal array testing (D) Stress testing

Description : Equivalence partitioning is a .................. method that divides the input domain of a program into classes of data from which test cases can be derived. (A) White-box testing (B) Black-box testing (C) Orthogonal array testing (D) Stress testing

Last Answer : (B) Black-box testing

Consider an experiment of tossing two fair dice, one black and one red. What is the probability that the number on the black die divides the number on red die ? (A) 22 / 36 (B) 12 / 36 (C) 14 / 36 (D) 6 / 36

Description : Consider an experiment of tossing two fair dice, one black and one red. What is the probability that the number on the black die divides the number on red die ? (A) 22 / 36 (B) 12 / 36 (C) 14 / 36 (D) 6 / 36

Last Answer : (C) 14 / 36 

A 45-year-old surgeon has developed symmetric early morning stiffness in her hands. She wishes to take a nonsteroidal anti-inflammatory drug to relieve these symptoms and wants to avoid gastrointestinal side effects. Which one of the following drugs is most appropriate? (a) Aspirin (b) Celecoxib (c) Ibuprofen (d) Indomethacin (e) Piroxicam

Description : A 45-year-old surgeon has developed symmetric early morning stiffness in her hands. She wishes to take a nonsteroidal anti-inflammatory drug to relieve these symptoms and wants to avoid gastrointestinal side ... appropriate? (a) Aspirin (b) Celecoxib (c) Ibuprofen (d) Indomethacin (e) Piroxicam

Last Answer : Ans: B

(2) Exclusion Principle of Pauli Explanation: The Pauli exclusion principle is the quantum mechanical principle that no two identical fermions (particles with half-integer spin) may occupy the same quantum state simultaneously. A more rigorous statement is that the total wave function for two identical fermions is anti-symmetric with respect to exchange of the particles.

Description : (2) Exclusion Principle of Pauli Explanation: The Pauli exclusion principle is the quantum mechanical principle that no two identical fermions (particles with half-integer spin) may occupy the same ... function for two identical fermions is anti-symmetric with respect to exchange of the particles.

Last Answer : The three elements most needed in common fertilizers are – (1) Sulphur, Phosphorous and Sodium (2) Nitrogen, Phosphorous and Sodium (3) Phosphorous, Sodium and Nitrogen (4) Calcium, Phosphorous and Potassium

.When a discrete time signal is said to be symmetric (or) anti symmetric?

Description : .When a discrete time signal is said to be symmetric (or) anti symmetric?

Last Answer : A real valued signal x(n) is called symmetric (even) if x(-n)=x(n). A real valued signal x(n) is called anti symmetric (odd) if x(-n)= -x(n).

An instance of a relation is a time varying set of …………………. A) Tuples B) Rows C) Both of them D) None of them

Description : An instance of a relation is a time varying set of …………………. A) Tuples B) Rows C) Both of them D) None of them

Last Answer : C) Both of them

………..defines the structure of a relation which consists of a fixed set of attribute-domain pairs. A) Instance B) Schema c) Program D) Super Key

Description : ………..defines the structure of a relation which consists of a fixed set of attribute-domain pairs. A) Instance B) Schema c) Program D) Super Key

Last Answer : B) Schema

Consider the formula in image processing RD = 1 - (1/CR) Where CR = n1/n2 CR is called as compression ratio n1 and n2 denotes the number of information carrying units in two datasets that represent the same information. In this situation RD is called as relative ................ of the first data set. (A) Data Compression (B) Data Redundancy (C) Data Relation (D) Data Representation

Description : Consider the formula in image processing RD = 1 - (1/CR) Where CR = n1/n2 CR is called as compression ratio n1 and n2 denotes the number of information carrying units in two datasets that represent ... . (A) Data Compression (B) Data Redundancy (C) Data Relation (D) Data Representation

Last Answer : (B) Data Redundancy

A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F, B→C, AF→G} Which of the following is a candidate key? (A) A (B) AB (C) ABC (D) ABD

Description : A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F, B→C, AF→G} Which of the following is a candidate key? (A) A (B) AB (C) ABC (D) ABD

Last Answer : Answer: D

Which of the following is true about Stiffness matrix a. Diagonal matrix b. Symmetric matrix c. Positive Definite d. All of the above

Description : Which of the following is true about Stiffness matrix a. Diagonal matrix b. Symmetric matrix c. Positive Definite d. All of the above

Last Answer : d. All of the above

Let A = {2, 3, 5, 6}. Then, which of the following relations is transitive only? -Maths 9th

Description : Let A = {2, 3, 5, 6}. Then, which of the following relations is transitive only? -Maths 9th

Last Answer : (d) R = {(2, 3), (3, 5), (2, 5)}.

A .................. normal form normalization will be needed where all attributes in a relation tuple are not functionally dependent only on the key attribute. A) First B) Second C) Third D) Fourth

Description : A .................. normal form normalization will be needed where all attributes in a relation tuple are not functionally dependent only on the key attribute. A) First B) Second C) Third D) Fourth

Last Answer : C) Third

A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following statement is correct? (A) OS maintains only scheduling and accounting information for each thread. (B) OS maintains only CPU registers for each thread. (C) OS does not maintain a separate stack for each thread. (D) OS does not maintain virtual memory state for each thread.

Description : A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following ... separate stack for each thread. (D) OS does not maintain virtual memory state for each thread.

Last Answer : (B) OS maintains only CPU registers for each thread.

For a database relation R(a, b, c, d) where the domains of a, b, c, d include only the atomic values. The functional dependency a → c, b → d holds in the following relation (A) In 1NF not in 2NF (B) In 2NF not in 3NF (C) In 3NF (D) In 1NF

Description : For a database relation R(a, b, c, d) where the domains of a, b, c, d include only the atomic values. The functional dependency a → c, b → d holds in the following relation (A) In 1NF not in 2NF (B) In 2NF not in 3NF (C) In 3NF (D) In 1NF

Last Answer : (A) In 1NF not in 2NF 

The relation schemas R1 and R2 form a Lossless join decomposition of R if and only if: (a) R1⋂R2→(R1-R2) (b) R1→R2 (c) R1⋂R2→(R2-R1) (d) R2→R1⋂R2 (A) (a) and (b) happens (B) (a) and (d) happens (C) (a) and (c) happens (D) (b) and (c) happens

Description : The relation schemas R1 and R2 form a Lossless join decomposition of R if and only if: (a) R1⋂R2→(R1-R2) (b) R1→R2 (c) R1⋂R2→(R2-R1) (d) R2→R1⋂R2 (A) (a) and (b) happens (B) (a) and (d) happens (C) (a) and (c) happens (D) (b) and (c) happens

Last Answer : (C) (a) and (c) happens 

Consider the following two commands C1 and C2 on the relation R from an SQL database: C1: drop table R; C2: delete from R; Which of the following statements is TRUE? I. Both C1 and C2 delete the schema for R. II. C2 retains relation R, but deletes all tuples in R. III. C1 deletes not only all tuples of R, but also the schema for R. (A) I only (B) I and II only (C) II and III only (D) I, II and III

Description : Consider the following two commands C1 and C2 on the relation R from an SQL database:  C1: drop table R; C2: delete from R; Which of the following statements is TRUE? I. Both C1 and C2 delete the schema for R. II. C2 ... R. (A) I only (B) I and II only (C) II and III only (D) I, II and III

Last Answer : (C) II and III only

For a database relation R(A,B,C,D) where the domains of A,B,C and D include only atomic values, only the following functional dependencies and those that can be inferred from them are: A→C B→D The relation R is in ................ (1) First normal form but not in second normal form (2) Both in first normal form as well as in second normal form (3) Second normal form but not in third normal form (4) Both in second normal form as well as in third normal form

Description : For a database relation R(A,B,C,D) where the domains of A,B,C and D include only atomic values, only the following functional dependencies and those that can be inferred from them are: A→C B→D The ... form but not in third normal form (4) Both in second normal form as well as in third normal form

Last Answer : First normal form but not in second normal form

In a positive-edge-triggered JK flip-flop, if J and K both are high then the output will be ............. on the rising edge of the clock. (A) No change (B) Set (C) Reset (D) Toggle

Description : In a positive-edge-triggered JK flip-flop, if J and K both are high then the output will be ............. on the rising edge of the clock. (A) No change (B) Set (C) Reset (D) Toggle

Last Answer : (D) Toggle 

An integer is chosen at random from the first two hundred positive integers. What is the probability that the integer chosen is divisible by 6 or 8 ? -Maths 9th

Description : An integer is chosen at random from the first two hundred positive integers. What is the probability that the integer chosen is divisible by 6 or 8 ? -Maths 9th

Last Answer : As there are 200 integers, total number of exhaustive, mutually exclusive and equally likely cases, i.e, n(S) = 200 Let A : Event of integer chosen from 1 to 200 being divisible by 6⇒ n(A) = 33 \(\bigg(rac{200}{6}=33rac{1}{3}\ ... (rac{25}{200}\) - \(rac{8}{200}\) = \(rac{50}{200}\) = \(rac{1}{4}\).

If a, b, c are distinct positive integers, then ax^(b–c) + bx^(c–a) + cx^(a–b) is -Maths 9th

Description : If a, b, c are distinct positive integers, then ax^(b–c) + bx^(c–a) + cx^(a–b) is -Maths 9th

Last Answer : answer:

Let ABCD be a parallellogram. Let m and n be positive integers such that n < m < 2n. Let AC = 2 mn -Maths 9th

Description : Let ABCD be a parallellogram. Let m and n be positive integers such that n < m < 2n. Let AC = 2 mn -Maths 9th

Last Answer : answer:

Which number is a counterexample for the following conjectureConjecture: All integers are either positive or negative.?

Description : Which number is a counterexample for the following conjectureConjecture: All integers are either positive or negative.?

Last Answer : A+0

If `21168=x^(4)xxy^(3)xxz^(2)`, find `(x+y+z)^((y+z)/(x+y))`, where `x, y` and `z` are positive integers.

Description : If `21168=x^(4)xxy^(3)xxz^(2)`, find `(x+y+z)^((y+z)/(x+y))`, where `x, y` and `z` are positive integers.

Last Answer : If `21168=x^(4)xxy^(3)xxz^(2)`, find `(x+y+z)^((y+z)/(x+y))`, where `x, y` and `z` are positive integers.

If the equation x2 minus ax plus 2b equals 0 has prime roots where a and b are positive integers then a minus b is equal to?

Description : If the equation x2 minus ax plus 2b equals 0 has prime roots where a and b are positive integers then a minus b is equal to?

Last Answer : I think you mean the roots are prime numbers.Let the two roots be primes p and qThen the equation factorises to (x - p)(x - q) = 0 which can beexpanded to give:x² - (p + q)x + pq = 0Which comparing ... = 2(It doesn't matter if the other prime is even (2) or not as itcancels out from a - b.)

Think of 5 positive integers that have a mode of 4 and 6, a median of 6 and a mean of 7.?

Description : Think of 5 positive integers that have a mode of 4 and 6, a median of 6 and a mean of 7.?

Last Answer : Think of 5 positive integers that have a mode of 4 and 6, a median of 6 and a mean of 7.

For any two positive integers a and b, HCF (a, b) × LCM (a, b) = (a) 1 (b) (a × b)/2 (c) a/b (d) a × b

Description : For any two positive integers a and b, HCF (a, b) × LCM (a, b) = (a) 1 (b) (a × b)/2 (c) a/b (d) a × b

Last Answer : (d) a × b

Do you think the transitive property of equality is superfluous when we have the substitution property?

Description : Do you think the transitive property of equality is superfluous when we have the substitution property?

Last Answer : Items involved in Transitive are THREE only TWO in substitution.

What is the opposite of transitive ?

Description : What is the opposite of transitive ?

Last Answer : The opposite of transitive is transitive ৷