Unit-Coefficient Indices
Unit-Coefficient Indices
Simplify a quotient of powers in two variables when both numerical coefficients are one. Read the resulting exponents and preserve the original domain.
- 46 bytes
- COMP mode
Worked examples
Example 1
Original practice. Simplify with positive exponents and retain the original domain. (x³y⁻²)²/(x⁶y⁻⁴); x≠0,y≠0.
Answer
Standard solution (without a calculator)
- U=3×2−6×1=0
- V=(−2)×2−(−4)×1=0
- x⁰y⁰=1
- Expand or substitute to verify each equality above.
Example 2
Original practice. Simplify with positive exponents and retain the original domain. (a⁻²b³)⁻³/(a⁴b⁻¹)⁻²; a≠0,b≠0.
Answer
Standard solution (without a calculator)
- U=(−2)(−3)−4(−2)=14
- V=3(−3)−(−1)(−2)=−11
- a¹⁴b⁻¹¹=a¹⁴/b¹¹
- Expand or substitute to verify each equality above.
Example 3
Original practice. Simplify with positive exponents and retain the original domain. (u⁻³v⁵)²/(u⁴v⁻²)⁻¹; u≠0,v≠0.
Answer
Standard solution (without a calculator)
- U=(−3)×2−4(−1)=−2
- V=5×2−(−2)(−1)=8
- u⁻²v⁸=v⁸/u²
- Expand or substitute to verify each equality above.
When to use it
Simplify a quotient of powers in two variables when both numerical coefficients are one. Read the resulting exponents and preserve the original domain.
Input order
- p,q,m,r,s,n
- B=p→pm; C=q→qm; D=m→n; Y=r; M=s
- Enter every value afresh; blank EXE retains old memory and is not zero. All working variables and Ans may be overwritten.
Output order
- U=pm−rn,V=qm−sn
- All six inputs p,q,m,r,s,n must be integers with absolute value≤1000. Both numerical coefficients must be +1; other coefficients or non-integer outer powers are unsupported. The program does not check these restrictions or the original domain. Outputs are U=pm−rn and V=qm−sn in that order, not numerical values of x or y. A zero pair means 1 only where the original expression is defined. Norm 1 remains active. Products are bounded by 1000000 and exponent differences by 2000000.
Conditions and limits
- Use COMP and Norm 1; the images use Deg, which does not change this algebra.
- p,q,m,r,s,n∈ℤ; |p|,|q|,|m|,|r|,|s|,|n|≤1000; |U|,|V|≤2000000
- All six inputs p,q,m,r,s,n must be integers with absolute value≤1000. Both numerical coefficients must be +1; other coefficients or non-integer outer powers are unsupported. The program does not check these restrictions or the original domain. Outputs are U=pm−rn and V=qm−sn in that order, not numerical values of x or y. A zero pair means 1 only where the original expression is defined. Norm 1 remains active. Products are bounded by 1000000 and exponent differences by 2000000.
- Use the original equation to check signs, excluded values and endpoint inclusion. Decimal screens are numerical approximations; preserve exact fractions or radicals in written answers.
Checking access…