Question

In: Computer Science

1+1= ？ prove it

1+1= ？

prove it

Expert Solution

1+1 = 2 (In Decimal Number System)

Proof: In any a + b term,

'a' & 'b' are operands,

'+' is an addition operator, which sums up operands.

this is an addition/summation operation/process.

so, whenever b is added to a, that means a is increased by b. (vice-versa also true)

Let's understand this by the help of number line,

In a+b,

initially a & b both hold some number & they remain at those points in the number line (see diagram),

after a+b operation, a is increased by whatever the value b holds.

Now, in 1+1

operation a holds 1 & b holds 1, i.e., both a & b are situated in 1 point of the number line,

so, 1+1 operation implies, 1 is increased by 1, i.e., 1 is increased by 1 step towards the right side in the number line,

thus, the resultant value of 1+1 now points to 2.

So, the value contained by 1+1 is 2.

-----------------------------------------------------------------------------------------------------------------------------------------------------------

NOTE: 1+1 = 2 (in Decimal Number System)

1+1 = 10(in Binary Number System)

In binary number system we represent numbers in 0 and 1 only.

venereology answered 5 hours ago

Prove that the 0/1 KNAPSACK problem is NP-Hard. (One way to prove this is to prove...

Prove that the 0/1 KNAPSACK problem is NP-Hard. (One way to prove this is to prove the decision version of 0/1 KNAPSACK problem is NP-Complete. In this problem, we use PARTITION problem as the source problem.) (a) Give the decision version of the O/1 KNAPSACK problem, and name it as DK. (b) Show that DK is NP-complete (by reducing PARTITION problem to DK). (c) Explain why showing DK, the decision version of the O/1 KNAPSACK problem, is NP-Complete is good...

1. Prove that (a) ⊆ C(a). Conclude that (a) ≤ C(a) 2. Prove that for each...

1. Prove that (a) ⊆ C(a). Conclude that (a) ≤ C(a) 2. Prove that for each a ∈ G, Z(G) ⊆ C(a). Conclude that Z(G) ≤ C(a).

1) a) Prove that the union of two countable sets is countable. b) Prove that the...

1) a) Prove that the union of two countable sets is countable. b) Prove that the union of a finite collection of countable sets is countable.

1. Prove that if a set A is bounded, then A-bar is also bounded. 2. Prove...

1. Prove that if a set A is bounded, then A-bar is also bounded. 2. Prove that if A is a bounded set, then A-bar is compact.

2. Prove that |[0, 1]| = |(0, 1)|

1. Prove that the Cantor set contains no intervals. 2. Prove: If x is an element...

1. Prove that the Cantor set contains no intervals. 2. Prove: If x is an element of the Cantor set, then there is a sequence Xn of elements from the Cantor set converging to x.

1)Prove that the intersection of an arbitrary collection of closed sets is closed. 2)Prove that the...

1)Prove that the intersection of an arbitrary collection of closed sets is closed. 2)Prove that the union of a finite collection of closed sets is closed

Suppose that x is real number. Prove that x+1/x =2 if and only if x=1. Prove...

Suppose that x is real number. Prove that x+1/x =2 if and only if x=1. Prove that there does not exist a smallest positive real number. Is the result still true if we replace ”real number” with ”integer”? Suppose that x is a real number. Use either proof by contrapositive or proof by contradiction to show that x3 + 5x = 0 implies that x = 0.

Prove combinatorially: {{n \ choose x)= {{k+1 \ choose n-1) This question is asking to prove...

Prove combinatorially: {{n \ choose x)= {{k+1 \ choose n-1) This question is asking to prove combinatorially whether n multi-choose k is equal to k+1 multi-choose n-1 Thank you

By induction: 1. Prove that Σni=1(2i − 1) = n2 2. Prove thatΣni=1 i2 = n(n+1)(2n+1)...

By induction: 1. Prove that Σni=1(2i − 1) = n2 2. Prove thatΣni=1 i2 = n(n+1)(2n+1) / 6 .