<< Prev Showing: 271-275 of 503 Next >>
· 246-250 · 251-255 · 256-260 · 261-265 · 266-270 · 271-275 · 276-280 · 281-285 · 286-290 · 291-295 · 296-300 ·(See attached file for full problem description) --- Let d,m and n be positive integers with m>1 and m≡ 1 (mod d), let n= c0+mc1+m2c2+m3c3+…+mrcr be the base=m expansion of n, and let f = c0+c1+c2+c3+…+cr Prove that n is divisible by d if and only if f is divisible by d. ---
Subject:
Math
Topic:
Discrete Structures
Posting ID:
65115
OTA ID:
101298
(See attached file for full problem description) --- Consider the RSA encryption system given by p=43,q=59, and e=13 i) Find d such that ed ≡ 1 (mod (p-1)(q-1)) ii) Decode the message : 1552 2069 1178 1637 1975 Using the convention A = 00, B = 01, …, Z = 25 ---
Subject:
Math
Topic:
Discrete Structures
Posting ID:
65117
OTA ID:
101298
1) Prove that all integers a,b,p, with p>0 and q>0 that ((a+b) mod p)mod q = (a mod p) mod q + (b mod p) mod q Or give a counterexample 2) prove for all integers a,b,p,q with p>0 and q>0 that ((a-b)mod p) mod q=0 if and only if (a mod p) mod q = (b mod p) mod q Or give a counterexample. 3) let p and q be positive integers with 0 < p < q and gcd(p,q) = 1 and let a and b be integers with 0<=a <=p-1 and 0<=b<=p-1 Prove that there exists an integer x such that (x mod p) mod q = a and (x mod q) mod p = b
Subject:
Math
Topic:
Discrete Structures
Posting ID:
65118
OTA ID:
101298
Extended Euclidian Algorithm Proofs
(See attached file for full problem description)
---
Given positive integers a and b, the extended Euclidian algorithm constructs sequences qn, rn, sn and tn, which are defined recursively as follows:
q0=0, q1=0, qn= q└ rn-2/ rn-1 ┘ for n>=2;
r0=a, r1=b, rn= rn-2 - qnrn-1 for n>=2;
s0=1, s1=0, sn= sn-2 - qnsn-1 for n>=2;
t0=0, t1=1, tn= tn-2 - qntn-1 for n>=2;
the sequences terminating if rn=0 . Prove the following
i) The extended Euclidian algorithm always terminates, i.e., there exists n>=2 such that rn=0
(hint : first show that if k>0 and rk>0 then 0<= rk+1
Subject:
Math
Topic:
Discrete Structures
Posting ID:
65120
OTA ID:
101298
(a) List the ordered pairs that belong to the relation. My ANS: (a,a),(b,a)(b,b),(c,a),(c,b),(c,c),(d,a),(d,b)(d,d) (b) Find the (boolean) matrix of the relation. < my answer file attached as Mr.jpg> I did review another answer posted along the same question, but uses a different shape. I think my matrix is correct based on my pairs, but i'm concerned about the pairs.
Subject:
Math
Topic:
Discrete Structures
Posting ID:
81030
OTA ID:
101298
<< Prev Showing: 271-275 of 503 Next >>
· 1-5 · 6-10 · 11-15 · 16-20 · 21-25 · 26-30 · 31-35 · 36-40 · 41-45 · 46-50 · 51-55 · 56-60 · 61-65 · 66-70 · 71-75 · 76-80 · 81-85 · 86-90 · 91-95 · 96-100 · 101-105 · 106-110 · 111-115 · 116-120 · 121-125 · 126-130 · 131-135 · 136-140 · 141-145 · 146-150 · 151-155 · 156-160 · 161-165 · 166-170 · 171-175 · 176-180 · 181-185 · 186-190 · 191-195 · 196-200 · 201-205 · 206-210 · 211-215 · 216-220 · 221-225 · 226-230 · 231-235 · 236-240 · 241-245 · 246-250 · 251-255 · 256-260 · 261-265 · 266-270 · 271-275 · 276-280 · 281-285 · 286-290 · 291-295 · 296-300 · 301-305 · 306-310 · 311-315 · 316-320 · 321-325 · 326-330 · 331-335 · 336-340 · 341-345 · 346-350 · 351-355 · 356-360 · 361-365 · 366-370 · 371-375 · 376-380 · 381-385 · 386-390 · 391-395 · 396-400 · 401-405 · 406-410 · 411-415 · 416-420 · 421-425 · 426-430 · 431-435 · 436-440 · 441-445 · 446-450 · 451-455 · 456-460 · 461-465 · 466-470 · 471-475 · 476-480 · 481-485 · 486-490 · 491-495 · 496-500 · 501-503 ·Page generated in 0.1832 seconds