Description: Lemma for pcadd . The original numbers A and B have been decomposed using the prime count function as ( P ^ M ) x. ( R / S ) where R , S are both not divisible by P and M = ( P pCnt A ) , and similarly for B . (Contributed by Mario Carneiro, 9-Sep-2014)
Ref | Expression | ||
---|---|---|---|
Hypotheses | pcaddlem.1 | |
|
pcaddlem.2 | |
||
pcaddlem.3 | |
||
pcaddlem.4 | |
||
pcaddlem.5 | |
||
pcaddlem.6 | |
||
pcaddlem.7 | |
||
pcaddlem.8 | |
||
Assertion | pcaddlem | |