[ home ] [ math / cs / ai / phy / as / chem / bio / geo ] [ civ / aero / mech / ee / hdl / os / dev / web / app / sys / net / sec ] [ med / fin / psy / soc / his / lit / lin / phi / arch ] [ off / vg / jp / 2hu / tc / ts / adv / hr / meta / tex ] [ chat ] [ wiki ]

Viewing source code

The following is the source code for post >>>/math/813

The discrete logarithm \( a^x=b \) mod p is polynomial with a,p prime ≠ 2; the question is if a=2 or a is a dialed number is still polynomial? I troved a way, but is a class of solutions.