Solving equations via substitution

jackscholar
Messages
73
Reaction score
0
I am trying to solve an equation that involves substitution.

I was given k= 7 in the equation n=k+c
i was also given n=2^c-1
I figured that 7+c could be substituted into the equation as n, so I got
7+c=2^c-1 and therefore c=2^c-8.
The problem is that the answer I want is c=4...but substituting 4 as C does not give me a correct answer. Any help would be greatly appreciated.
Thank you
 
Mathematics news on Phys.org
Maybe the probem should say n = k + 2c
 
This pertains to hamming codes, so n is the total number of bits, k is the amount of information digits and c is the amount of check digits. I was given another example aswell. This example says: Suppose there are four information digits.
Then n=4+c
and n=2^c-1
then 4+c=2^c-1
hence c=2^c-5
 
jackscholar said:
I was given k= 7 in the equation n=k+c
i was also given n=2^c-1
This pertains to hamming codes

The inequation I see on the web for hamming codes is n \le 2^c -1
 
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