title: Given values for p, q and e, but gcd(e,phi) is not 1, then how to find n & d in RSA? Or is it even possible?
body: <p>The values are: <strong>p = 19</strong>, <strong>q = 23</strong>, and <strong>e = 3</strong>.
  Calculating as per the algorithm: <strong>n = 437</strong> &amp; <strong><em>phi = 396</em></strong>.
  But I don't think RSA is valid here becasue <strong><em>GCD(e, phi) is not 1 in this case, as GCD(3, 396) = 3</em></strong>.
  So, that means RSA algorithm isn't satisfied and can't be proceeded further to calculate d, right?</p>
  
  <p><strong>I'd like to ask</strong> if I am correct in assuming that there is no solution for those given values of p, q and e due to GCD(e,phi) = 1 not being satisfied.</p>
  
  <p>Or am I doing something wrong here?
  This is the original question which appeared in a previous examination paper that I'm solving: <em>(word by word)</em></p>
  
  <pre><code>In RSA, given p=19, q=23 and e=3, find n and d.
  </code></pre>
  
  <p>I'm willing to assume its a tricky question which checks whether one knows the algorithm(and its steps) or not. Please let me know if my assumption is right or not, thanks in advance! :)</p>