Ivan Shishkin, Rye (1878)

Problems/OtherUnreviewed

A bad deal in French Tarot

by Ancient Tree·
27
Difficulty scaleÉchelle de difficulté

This score reflects both the level of the required concepts and the difficulty of the solution.Ce score tient compte à la fois du niveau des notions nécessaires et de la difficulté de la résolution.

  1. 110First steps / middle schoolPremiers pas / collège
  2. 1125Beginner / high schoolDébutant / lycée
  3. 2650Intermediate / undergraduateIntermédiaire / licence
  4. 5170Advanced / graduateAvancé / master
  5. 7190Expert / specializedExpert / spécialisé
  6. 91100Research levelNiveau recherche
These levels are approximate guides.Ces niveaux sont des repères approximatifs.
·
English
EnglishFrançais
This translation may be outdated. Its source text has changed since revision 1957.
Unreviewed. This problem has not been reviewed by trusted users yet.

Some friends are playing French Tarot with a 78-card deck.

The dealer deals the cards four at a time. However, when the last player realizes that he has two fewer cards than everyone else, he leaves the game.

The remaining players decide to divide all of his cards equally among themselves.

How many players are left?

image

I solved itMark it doneAdd to my listKeep it in your list

References

  1. Math Woods
Details

Image : Le 1 et le 21 d'atout, et l'excuse d'un jeu de tarot Grimaud de 1910 https://commons.wikimedia.org/wiki/File:Oudlers1910.PNG

Export references

Hints

1

Hint 1

Open this only if you want a small nudge before looking at the solutions.

Solutions

1
Reveal solutionsAre you sure? Give it a try first.

Solution by Ancient Tree

Discussions0 useful votes

Let nn be the initial number of players, and kk the number of cards each player has, except for the last one, who has only k2k-2.
We therefore have:
78=(n1)k+k2=nk278=(n-1)k+k-2=nk-2And hence nk=80nk=80.
Note that the cards were dealt four at a time, so the number of cards each player has (except for the last one...) is a multiple of 4:
k=4tk=4t(where, incidentally, tt is the number of rounds of dealing).
We therefore obtain
4nt=80,hencent=20.4nt=80,\quad\text{hence}\quad nt=20.

This leaves only the following possibilities:

  • n=20n=20, t=1t=1
  • n=1n=1, t=20t=20 (excluded, since there are several players)
  • n=10n=10, t=2t=2
  • n=2n=2, t=10t=10 (excluded, since the statement specifies that after the player leaves, several players remain).
  • n=5n=5, t=4t=4
  • n=4n=4, t=5t=5.

There is one condition left to consider: since the remaining n1n-1 players divide all the cards of the player who left equally among themselves, this implies that
n1  divides  k2=4t2n-1\;\text{divides}\;k-2=4t-2

But checking the 4 remaining possibilities, only one of them is compatible with this condition.
Indeed:

  • n=20n=20, t=1t=1 is impossible, since 201=1920-1=19 does not divide 4×12=24\times 1-2=2.
  • n=10n=10, t=2t=2 is impossible, since 101=910-1=9 does not divide 4×22=64\times 2-2=6.
  • n=5n=5, t=4t=4 is impossible, since 51=45-1=4 does not divide 4×42=144\times 4-2=14.
  • n=4n=4, t=5t=5 is possible, since 41=34-1=3 does indeed divide 4×52=184\times 5-2=18.

Therefore, there could only have been n=4n=4 players initially; and hence only 3 players remain.

Report

For an unclear, ambiguous, or possibly incorrect statement, please use the Discussion tab on the right. Report content that needs moderator intervention, such as dangerous, clearly non-mathematical, or plagiarized content.