MHB Calculating amount left at the end of a repetetive cutting down cycle.

  • Thread starter Thread starter Zekes
  • Start date Start date
  • Tags Tags
    Cutting Cycle
Zekes
Messages
4
Reaction score
0
Let's say I have a group of X's characters that I want to cut down. I use a tool similar to 'find-and-replace-all', which takes an amount of X's each time, deletes them, and replaces them with another, smaller amount. For example, I can state that I want an amount of 8 X's to be replaced with 5 X's from an original amount of 14 X's. This cycle happens forever, or until there isn't a sufficient remainder left to replace anymore. To visualise the example I just provided:


  • (XXXXXXXX)XXXXXX --> [XXXXX]XXXXXX
    (XXXXXXXX)XXX --> [XXXXX]XXX
    (XXXXXXXX) --> [XXXXX]

So, you start with 14 X's and end with 5 X's, and the process carried out here can be summarised as '14, 11, 8, 5'. The process that was underwent in terms of finding and replacing can be described as (8,5) as 8 X's are replaced with 5 each time. Now, the question here is:


  1. When you initially have a string of 1,000,000 X's, and apply the find-and-replace process of (99,90), what is the summary of the process here?
    By summary of the process, I mean the '14, 11, 8, 5' which shows how many X's are left after each step.

I tried solving this manually, starting the process summary as '1,000,000, 909,091, 826,453, 751,321, 683,020, 620,929, 564,481, 513,172, 466,525' however I realized this was a very inefficient way of solving this, and prone to mistakes. Can anyone help me do it in a better, easier way?

ALSO FOLLOW UP QUESTION

  • For the (7,3) process, find all start lengths which eventually result in an end length of 6.

I can see 10 being applicable for this, however manual testing every number to find a suitable match is also quite inefficient. If you can help me for this question too, please do. Also, please explain in more simple math terms, rather than using symbols (as I am still a beginner) Thank you!
 
Mathematics news on Phys.org
Zekes said:
Let's say I have a group of X's characters that I want to cut down. I use a tool similar to 'find-and-replace-all', which takes an amount of X's each time, deletes them, and replaces them with another, smaller amount. For example, I can state that I want an amount of 8 X's to be replaced with 5 X's from an original amount of 14 X's. This cycle happens forever, or until there isn't a sufficient remainder left to replace anymore. To visualise the example I just provided:


  • (XXXXXXXX)XXXXXX --> [XXXXX]XXXXXX
    (XXXXXXXX)XXX --> [XXXXX]XXX
    (XXXXXXXX) --> [XXXXX]

So, you start with 14 X's and end with 5 X's, and the process carried out here can be summarised as '14, 11, 8, 5'. The process that was underwent in terms of finding and replacing can be described as (8,5) as 8 X's are replaced with 5 each time.
Isn't this simply repeatingly subtracting 3 from 14 ?
14 - 3 = 11 - 3 = 8 - 3 = 5 ...whoa!
 
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