Explanation Given information: The given statement is 10 n ≡ ( − 1 ) n ( mod 11 ) . Formula used: Division algorithm: Let a be an integer and d be a positive integer. Then, there are unique integers q and r with 0 ≤ r < d such that a = d q + r , here, q is the quotient and r is the remainder. So, q = a div d and r = a mod d . When m divides a − b then a is congruent to b modulo m . The notation is a ≡ b ( mod m ) . The base b representation of n is a k … a 2 a 1 a 0 , then n = a k b k + a k − 1 b k − 1 + … + a 1 b + a 0 . a divides b if there exists an integer c such that b = a c . The notation is a | b . Proof: To prove the statement 10 n ≡ ( − 1 ) n ( mod 11 ) , by using mathematical induction on n . Let P ( n ) be 10 n ≡ ( − 1 ) n ( mod 11 ) . For n = 1 , By the definition, 11 divides 10 1 − ( − 1 ) 1 . 10 1 − ( − 1 ) 1 = 10 + 1 = 11 11 | ( 10 1 − ( − 1 ) 1 ) Here, 1 is an integer. Thus, P ( 1 ) is true. Let the statement 10 n ≡ ( − 1 ) n ( mod 11 ) is true for m = k . So, by the definition of divides, there exists an integer l such that, 10 k − ( − 1 ) k = 11 l To determine (b) To prove: A positive integer is divisible by 11 if and only if the alternating sum of its digits is divisible by 11 .

5th Edition

ISBN: 9780357035283

Author: EPP

Publisher: Cengage

See similar textbooks

Concept explainers

Statements and Logic

Logic is the analysis of general patterns of thoughts without regard to any specific sense of context.

Videos

Question

Chapter 8.4, Problem 13ES

To determine

(a)

To prove:

The statement 10n≡(−1)n(mod11) for all integers n≥1 ,

To determine

(b)

To prove:

A positive integer is divisible by 11 if and only if the alternating sum of its digits is divisible by 11.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 8.4, Problem 12ES

Chapter 8.4, Problem 14ES

Students have asked these similar questions

BUSINESS DISCUSS

a -> f(x) = f(x) = [x] show that whether f is continuous function or not(by using theorem) Muslim_maths

Use Green's Theorem to evaluate F. dr, where F = (√+4y, 2x + √√) and C consists of the arc of the curve y = 4x - x² from (0,0) to (4,0) and the line segment from (4,0) to (0,0).

Chapter 8 Solutions

Discrete Mathematics With Applications

Ch. 8.1 - If R is a relation from A to B, xA , and yB , the...Ch. 8.1 - Prob. 2TY Ch. 8.1 - Prob. 3TY Ch. 8.1 - Prob. 4TY Ch. 8.1 - If R is a relation on a set A, the directed graph...Ch. 8.1 - As in Example 8.1.2, the congruence modulo 2...Ch. 8.1 - Prove that for all integers m and n,m-n is even...Ch. 8.1 - The congruence modulo 3 relation, T, is defined...Ch. 8.1 - Define a relation P on Z as follows: For every...Ch. 8.1 - Prob. 5ES

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.

(a) To prove: The statement 10 n ≡ ( − 1 ) n ( mod 11 ) for all integers n ≥ 1 ,

Solution Summary: The author explains how to prove the statement by using mathematical induction on a|b.

Concept explainers

Videos

(a)

To prove:

The statement 10n≡(−1)n(mod11) for all integers n≥1 ,

(b)

To prove:

A positive integer is divisible by 11 if and only if the alternating sum of its digits is divisible by 11.

Want to see the full answer?

Chapter 8 Solutions

(a) To prove: The statement 10 n ≡ ( − 1 ) n ( mod 11 ) for all integers n ≥ 1 ,

Solution Summary: The author explains how to prove the statement by using mathematical induction on a|b.

Concept explainers

Videos

(a) To prove: The statement 10n≡(−1)n(mod11) for all integers n≥1 ,

(b) To prove: A positive integer is divisible by 11 if and only if the alternating sum of its digits is divisible by 11.

Want to see the full answer?

Chapter 8 Solutions

(a)

To prove:

The statement 10n≡(−1)n(mod11) for all integers n≥1 ,

(b)

To prove:

A positive integer is divisible by 11 if and only if the alternating sum of its digits is divisible by 11.