简体   繁体   English

当分子和分母的基数和指数不同时如何进行指数除法?

[英]How to do exponential division when base and exponent is different between numerator and denominator?

How to do division when什么时候除法

a x / b y a x / b y

Say, a,x,b,y are distinct values.比如说,a,x,b,y 是不同的值。

For example,例如,

2 19 / 7 23 . 2 19 / 7 23 Doing mathematical operations with bigger exponents is tedious and error-prone.用更大的指数进行数学运算既乏味又容易出错。

Is there any way to simplify above expression such that the final decimal result wouldn't change?有没有办法简化上面的表达式,使最终的十进制结果不会改变?

7 23 = 2 23 log 2 7 . 7 23 = 2 23 对数2 7

2 19 /2 23 log 2 7 = 2 19 - 23 log 2 7 2 19 /2 23 对数2 7 = 2 19 - 23 对数2 7

暂无
暂无

声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

相关问题 在进行指数搜索时,为什么选择指数的底数为2? - While doing an exponential search, why do we choose the base of the exponent as 2? 在给定分子和分母的范围内,在 0..1 之间找到与给定随机实数最接近的整数分数 - Finding the closest integer fraction to a given random real between 0..1, given ranges of numerator and denominator 当分子是2的幂的倍数时加速除法和余数 - Speeding up division and remainder when numerator is a multiple of power of two 当分子和分母都具有有限范围时,找到实数的有理近似 - Finding a rational approximation of a real number when both the numerator and denominator have a restricted range 如何将浮点数转换为由字节分子和分母表示的最接近的分数? - How can I turn a floating point number into the closest fraction represented by a byte numerator and denominator? 在 C++ 中使用 int 分子和分母对 double 进行有理逼近 - Rational approximation of double using int numerator and denominator in C++ 不合理基数的指数算法 - Algorithm on exponential with irrational base 寻找涉及指数和除数涉及大数的余数mod - Finding remainder mod involving exponent and division involving huge numbers 在滚动哈希中,哈希函数的除法中使用的质数与为数字选择的基数之间是什么关系? - In a rolling hash what is the relationship between the prime used in the division method of the hash function and the base chosen for the numbers? 如何计算大分母连分数的收敛? - How to calculate convergents of continued fraction with big denominator?
 
粤ICP备18138465号  © 2020-2024 STACKOOM.COM