): Least common multiple of these integers. ): Greatest common divisor of these integers. Example: P(4) = 5 because the number 4 can be partitioned in 5 different ways: 4 = 3+1 = 2+2 = 2+1+1 = 1+1+1+1. P(n): Unrestricted Partition Number (number of decompositions of n into sums of integers without regard to order).where each element equals the sum of the previous two members of the sequence.

F(n): Fibonacci number F n from the sequence 0, 1, 1, 2, 3, 5, 8, 13, 21, etc.B(n): Previous probable prime before n.p#: primorial (product of all primes less or equal than p).(all numbers greater than zero) where k is the number of exclamation marks. It is the product of n times n − k times n − 2k. !: multiple factorial ( n must be greater than or equal to zero). n!: factorial ( n must be greater than or equal to zero).Otherwise, a SHR b shifts a left the number of bits specified by − b. SHL or >: When b ≥ 0, a SHR b shifts a right the number of bits specified by b.Positive (negative) numbers are prepended with an infinite number of bits set to zero (one). The operations are done in binary (base 2). The operators return zero for false and -1 for true. You can also enter expressions that use the following operators and parentheses: This algorithm has subexponential running time. I will add the index-calculus algorithm soon. The applet works in a reasonable amount of time if this factor is less than 10 17. In this version of the discrete logarithm calculator only the Pohlig-Hellman algorithm is implemented, so the execution time is proportional to the square root of the largest prime factor of the modulus minus 1.

The only restriction is that the base and the modulus, and the power and the modulus must be relatively prime. This applet works for both prime and composite moduli.

The discrete logarithm problem is to find the exponent in the expression Base Exponent = Power (mod Modulus). This web application computes discrete logarithms.

Calculator log base 2