<< Prev Showing: 221-225 of 503 Next >>
· 196-200 · 201-205 · 206-210 · 211-215 · 216-220 · 221-225 · 226-230 · 231-235 · 236-240 · 241-245 · 246-250 ·Prove that there must be two distinct integers in A whose sum is 104.
Let A be any set of twenty integers chosen from the arithmetic progression 1, 4, 7, ...,100. Prove that there must be two distinct integers in A whose sum is 104.
Subject:
Math
Topic:
Discrete Structures
Posting ID:
43320
OTA ID:
103060
Show that 2(2^n-1 - 1) is the formula used to determine the number of different ways to deal n distinct playing cards to two players where each player gets at least one card. I want to allow the possibility of giving a different number of cards to each player.
Subject:
Math
Topic:
Discrete Structures
Posting ID:
43679
OTA ID:
103300
Fibonacci Sequence Proofs, Pascal's Triangle and Binomial Coefficients
Practice problem 1 Fn is the Fibonacci sequence (f0 = 0, f1 = 1, fn+1 = fn + fn-1). By considering examples, determine a formula for the following expressions, and then verify the formula. a. f0 + f2 + f4 + …+f2n b. f0 - f1 + f2 - f3 + …+(-1)n fn --------------------------------------------- Practice problem 3 By observation, derive a formula for (n 0) + (n 1)2 + (n 2)^2 +…+(n n)2^n = the summation n where k=0 (n k)2^k. Verify your formula. ( ) are being used to express n chose zero, n chose one … ------------------------------ Practice Problem 8 Give a formula for the Fibonacci numbers using binomial coefficients (using the identity observed in Pascal's tri... click for more
Subject:
Math
Topic:
Discrete Structures
Posting ID:
43809
OTA ID:
104945
Determine the sum of the integers among the first 1000 positive integers which are not divisible by 4 or are not divisible by 9. (This is not an exclusive or)
Subject:
Math
Topic:
Discrete Structures
Posting ID:
43849
OTA ID:
103997
SUPPOSE THAT A MAN WANTS TO CROSS TO THE FAR WALL OF A ROOM THAT IS 20FT ACROSS. FIRST HE CROSSES HALF OF THE DISTANCE TO REACH THE 10 FT MARK. NEXT HE CROSSES HALFWAY ACROSS THE REMAINING 10 FT TO ARRIVE AT THE 5 FT MARK. DIVIDING THE DISTANCE IN HALF AGAIN HE CROSSES TO THE 2.5 FT MARK AND CONTINUES TO CROSS THE ROOM IN THIS WAY DIVIDING EACH DISTANCE IN HALF AND CROSSING TO THAT POINT BECAUSE EACH OF THE INCREASINGLY SMALLER DISTANCES CAN BE DIVIDED IN HALF HE MUST REACH AN INFINITE NUMBER OF MIDPOINTS IN A FINITE AMOUNT OF TIME AND WILL NEVER REACH THE WALL EXPLAIN THE ERROR IN ZENO'S PARADOX.
Subject:
Math
Topic:
Discrete Structures
Posting ID:
43850
OTA ID:
103997
<< Prev Showing: 221-225 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.1865 seconds