Sydney chooses two different primes, both greater than $10,$ and computes their product $P$. The product $P$ is less than $500.$ How many different possible values of $P$ are there?
a=( 11 , 13 , 17 , 19 , 23 , 29 , 31 , 37 , 41 , 43 ); i=0; j=2; c=a[0]*a[1]; cycle: m=a[i]*a[j]; if(m<500, c=(c,m), goto next);j++; if(j next: i++; j=i+1; if(j
OUTPUT: (143, 187, 209, 253, 319, 341, 407, 451, 473, 221, 247, 299, 377, 403, 481, 323, 391, 493, 437)>>Total =19 such numbers.
