5. Prove that the integer 53103 + 10353 is divisible by 39, and that 111333 ible by 7.
5. Prove that the integer 53103 + 10353 is divisible by 39, and that 111333 ible by 7.
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Concept explainers
Contingency Table
A contingency table can be defined as the visual representation of the relationship between two or more categorical variables that can be evaluated and registered. It is a categorical version of the scatterplot, which is used to investigate the linear relationship between two variables. A contingency table is indeed a type of frequency distribution table that displays two variables at the same time.
Binomial Distribution
Binomial is an algebraic expression of the sum or the difference of two terms. Before knowing about binomial distribution, we must know about the binomial theorem.
Topic Video
Question
5

Transcribed Image Text:5. Prove that the integer 53103 +10353 is divisible by 39, and that 111333 +333|11 is divis-
4. (a) Find the remainders when 250 and 410 are divided by 7.
that c 0 (mod n). Indeed, if c = 0 (mod n), then gcd(c, n) = n and the conclusion
Let us call attention to the fact that, in Theorem 4.3, it is unnecessary to stipulate
11 = 5 (mod 3). A further illustration is given by the congruence –35 = 45 (mod 8),
Corollary 2. If ca = cb (mod p) andp X c, where p is a prime number, then
er
d 41).
shall have
Example 4.4. Consider the congruence 33 = 15 (mod 9) or, if one prefers,
3.11 = 3.5 (mod 9). Because gcd(3, 9) = 3, Theorem 4.3 leads to the conclusion that
which is the same as 5 (-7) = 5 ·9 (mod 8). The integers 5 and 8 being relatively
prime, we may cancel the factor 5 to obtain a correct congruence –7 = 9 (mod 8).
a = b (mod p).
to
she theorem would state that a = b (mod 1); but, as we remarked earlier, this
holds trivially for all integers a and b.
There is another curious situation that can arise with congruences: The product
of two integers, neither of whích is congruent to zero, may turn out to be congruent to
zero. For instance, 4 3 0 (mod 12), but 4 #0 (mod 12) and 3 0 (mod 12). It is a
simple matter to show that if ab = 0 (mod n) and gcd(a, n) = 1, then b = 0 (mod n):
Corollary 1 permits us legitimately to cancel the factor a from both sides of the
congruence ab = a · 0 (mod n). A variation on this is that when ab = 0 (mod p),
pa prime, then either a = 0 (mod p) or b = 0 (mod p).
with
PROBLEMS 4.2
1. Prove each of the following assertions:
(a) If a = b (mod n) and m |n, then a = b (mod m).
(b) If a = b (mod n) and c > 0, then ca = cb (mod cn).
(C) If a = b (mod n) and the integers a, b, n are all divisible by d > 0, then
a/d = b/d (mod n/d).
** Give an example to show that a? = b? (mod n) need not imply that a = b
(mod n).
3. If a = b (mod n), prove that gcd(a, n) = gcd(b, n).
(0) What is the remainder when the following sum is divided by 4 ?
15+25 + 35+...+99$ + 100°
ible by 7.
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 4 images

Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.Recommended textbooks for you

Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated

Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY

Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated

Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY

Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,

