Apologies for my late appearance. I could not log on with Explorer, I had to load up Firefox. However my password is saved in Ex. So I still could not login. A bug in the works methinks.
CARDS:
<paulaj thinks real hard,...almost hurts self >
?'Don't worry, we have a Doctor in the house.' :wink:
Answer- A bagillion times?... ?'Oh Paula sooooo close.'
This is the last time I'm going to derail this thread... today
' You will have to go some, it has been heading for the bumpers for a long time.'
Usamashaker: (Good answer)
Cards
8
52
After a little experimentation, you'll see that the card originally in the i 'th position will have moved to the position given by the function p(i) defined by
p(i) = { 2i - 1, for i between 1 and 26
2(i-26), for i between 27 and 52
You can now follow along and see, for example, that card 1 returns to the first spot, while card 2 migrates in order through positions 2 - 3 - 5 - 9 - 17 - 33 - 14 - 27 and then returns to position 2. The following table lists the movement of the cards.
1 - 1
2 - 3 - 5 - 9 - 17 - 33 - 14 - 27 - 2
4 - 7 - 13 - 25 - 49 - 46 - 40 - 28 - 4
6 - 11 - 21 - 41 - 30 - 8 - 15 - 29 - 6
10 - 19 - 37 - 22 - 43 - 34 - 16 - 31- 10
12 - 23 - 45 - 38 - 24 - 47 - 42 - 32 - 12
20 - 39 - 26 - 51 - 50 - 48 - 44 - 36 - 20
18 - 35 - 18
52 - 52
You can immediately conclude that the deck will return to its original state after only 8 shuffles. Among the many curious patterns, notice how cards 18 and 35 flip positions after each shuffle.
The situation is much different for 54 cards; a similar analysis gives that
you'll need 52 shuffles in order to return the deck to its initial state. Moreover, each card (other than the top or bottom card) will migrate through each of the other 52 positions of the deck!
For the general case, it becomes useful to renumber the deck of n cards from 0 to n-1. The equation for the shuffle then becomes
p(i) = 2i (modulo n-1)
This gives that the number of shuffles is the order of the residue 2 in the group of units, under multiplication, modulo n-1, from which you can derive the following table for the number of shuffles.
n
4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50
number of shuffles
2 4 3. 6 10 12. 4.. 8 18.. 6 11 20 18 28 5 10 12 36 12 20 14 12 23 21
MOU
really not sure what you had in mind with World Series question
World Series can have 8 possible outcomes (4:0, 4:1, 4:2, 4:3, 3:4, 2:4, 1:4, 0:4) if that's what you had in mind. ?'That was the cards'
And, if I take your question literally then it can be played in four ways - 4, 5, 6, or 7 games (that are, no matter the score, played on previously decided stadiums /decided by regular season score/).
Not the way I was thinking.
Mark:
I would never refer to you as an SOB!
Sorry buddy, I have been watching too many John Wayne movies.
Mark:
WORLD SERIES
I get 70:
1 way to sweep
4 ways to win 4-1
10 ways to win 4-2
20 ways to win 4-3
Double the 35 (1+4+10+20) to get 70 because either team can be victorious.
Yes! He is right.
In order to count how many ways one team could win the World Series you only have to count how many ways that team could win
four out of seven games. This is computed by the binomial coefficient 7 choose 4, which has the value
7!
-----= 35
4!3!
Since there are two teams, you have to double this number to give you 70 ways for the World Series to be played.
This may be a duplicate:
The captain of a luxury cruise ship wants to install windshield wipers on the portholes of the ship. The straight wipers are to be attached at a point on the circumference of the circular portholes, furthermore, the entire length of the blade must remain in contact with the flat glass at all times.
How long should the wiper blade be so as to clean half of the porthole
Here's a curiosity:
(30 + 25)2 = 3025.
What other occurrences of this are there
Are there any such occurrences with numbers of more than two digits
Put all the positive integers into a basket. Reach into the basket and pull one out. Write down the number and return it to the basket. Repeat this process until you have pulled out a total of 1998 numbers.
Must some subset of the numbers you have selected have a sum divisible by 1998