Skip to main content
MathOverflow

Return to Question

deleted 11 characters in body; edited title
Source Link
Asaf Karagila ♦
Asaf Karagila ♦
  • 39.9k
  • 8
  • 135
  • 283

What are the solutions for discrete integers b, d to $a^b \equiv c^d \ (\text{mod} \ p)$\pmod p$ where $p$ is a large prime number?

Is there a way to efficiently discover or choose the integers $b$, $d$ for the congruence relationship below where $p$ is a large prime number? Is there a name for this relationship?

$$ a^{b} = c^{d} \ (\text{mod} \ p) $$$$ a^{b} = c^{d} \pmod p $$

What are the solutions for discrete integers b, d to $a^b \equiv c^d \ (\text{mod} \ p)$ where $p$ is a large prime number?

Is there a way to efficiently discover or choose the integers $b$, $d$ for the congruence relationship below where $p$ is a large prime number? Is there a name for this relationship?

$$ a^{b} = c^{d} \ (\text{mod} \ p) $$

What are the solutions for discrete integers b, d to $a^b \equiv c^d \pmod p$ where $p$ is a large prime number?

Is there a way to efficiently discover or choose the integers $b$, $d$ for the congruence relationship below where $p$ is a large prime number? Is there a name for this relationship?

$$ a^{b} = c^{d} \pmod p $$

LaTeX corrections
Source Link
edit approved Apr 21, 2014 at 6:39
Seirios
edit approved Apr 21, 2014 at 6:39
Seirios
  • 2.4k
  • 22
  • 25

What are the solutions for discrete integers b, d to a^b≡c^d$a^b \equiv c^d \ (\text{mod} \ p)$ where p$p$ is a large prime number?

Is there a way to efficiently discover or choose the integers b$b$,d $d$ for the congruence relationship below where p$p$ is a large prime number? Is there a name for this relationship?

$$ a^{b} = c^{d} (mod p) $$$$ a^{b} = c^{d} \ (\text{mod} \ p) $$

What are the solutions for discrete integers b, d to a^b≡c^d (mod p) where p is a large prime number?

Is there a way to efficiently discover or choose the integers b,d for the congruence relationship below where p is a large prime number? Is there a name for this relationship?

$$ a^{b} = c^{d} (mod p) $$

What are the solutions for discrete integers b, d to $a^b \equiv c^d \ (\text{mod} \ p)$ where $p$ is a large prime number?

Is there a way to efficiently discover or choose the integers $b$, $d$ for the congruence relationship below where $p$ is a large prime number? Is there a name for this relationship?

$$ a^{b} = c^{d} \ (\text{mod} \ p) $$

Source Link
riseup
riseup
  • 13
  • 2

What are the solutions for discrete integers b, d to a^b≡c^d (mod p) where p is a large prime number?

Is there a way to efficiently discover or choose the integers b,d for the congruence relationship below where p is a large prime number? Is there a name for this relationship?

$$ a^{b} = c^{d} (mod p) $$