4 thoughts on “Could someone explain this contradiction to me?”

First, the identity works for x > 0 if r has magnitude less than 1. Try r=0.5, x=1.

As to why it breaks down for x >= 0 and |r| >= 1, the right side is mathematical shorthand for the limit of the n-th partial sum as n goes to infinity. If you are raising things equal to or larger than 1 in magnitude to progressively larger powers, the partial sums don’t converge, so the right side is either infinity or didn’t exist, depending on your religious affiliation.

Thanks, as always

Serious paper about the P versus NP Problem

Abstract:$UNIQUE \ SAT$ is the problem of deciding whether a given Boolean formula has exactly one satisfying truth assignment. The $UNIQUE \ SAT$ is $coNP-hard$. We prove the $UNIQUE \ SAT$ is in $NP$, and therefore, $NP = coNP$. Furthermore, we prove if $NP = coNP$, then some problem in $coNPC$ is in $P$, and thus, $P = NP$. In this way, the $P$ versus $NP$ problem is solved with a positive answer.

First, the identity works for x > 0 if r has magnitude less than 1. Try r=0.5, x=1.

As to why it breaks down for x >= 0 and |r| >= 1, the right side is mathematical shorthand for the limit of the n-th partial sum as n goes to infinity. If you are raising things equal to or larger than 1 in magnitude to progressively larger powers, the partial sums don’t converge, so the right side is either infinity or didn’t exist, depending on your religious affiliation.

Thanks, as always

Serious paper about the P versus NP Problem

Abstract:$UNIQUE \ SAT$ is the problem of deciding whether a given Boolean formula has exactly one satisfying truth assignment. The $UNIQUE \ SAT$ is $coNP-hard$. We prove the $UNIQUE \ SAT$ is in $NP$, and therefore, $NP = coNP$. Furthermore, we prove if $NP = coNP$, then some problem in $coNPC$ is in $P$, and thus, $P = NP$. In this way, the $P$ versus $NP$ problem is solved with a positive answer.

Paper: http://hal.archives-ouvertes.fr/hal-00984866

Thanks, not much to do with the subject in hand but I’ll leave this here for now.