MHB Solution: Sharing Cards - How Many are Shared Among 20+ Children?

  • Thread starter Thread starter Johnx1
  • Start date Start date
  • Tags Tags
    Cards Children
Johnx1
Messages
48
Reaction score
0
20 children share some cards equally. When another child joins them, they each get 2 fewer cards. How many cards are they sharing altogether?

My answer:

children = ch
cards = cd

=> cd/ch

but when another child joins them, they get 2 fewer cards. So, ch = cds - 2.

then I did cd/20(cds - 2)

Then I got stuck there for a long time.
 
Last edited:
Mathematics news on Phys.org
Let the number of cards per child be x. Since 20 children are sharing the same number of cards there are 20x cards available. When another child joins them there are x - 2 cards per child. So, 20x = 21(x - 2). Can you solve that for x and use your answer to find the solution to the problem?
 
greg1313 said:
Let the number of cards per child be x. Since 20 children are sharing the same number of cards there are 20x cards available. When another child joins them there are x - 2 cards per child. So, 20x = 21(x - 2). Can you solve that for x and use your answer to find the solution to the problem?

Answer is 840. Thank you.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top