Could you be more precise?

Carl Love — Wed, 21 Nov 2012 23:02:55 Z

Could you state in more precise mathematical (set theoretic) language what you want? Do you want one of these:

all k in {$1..10} such that there exists a pair (a,b) in A^2 such that the relation holds,
all pairs (a,b) in A^2 such that there exists k in {$1..10} such that the relation holds,
all triples (a,b,k) in A^2 x {$1..10} such that the relation holds?

Also, as Doug pointed out, is the relation a^k = b or a^k = b^2? If the latter, then we can immediately eliminate all odd k.

Given a set A:={...}and an equation eq1:=a^k=b^2;eq2:=solve

SanctumZero — Thu, 22 Nov 2012 02:37:21 Z

Given a set A:={...}
and an equation 
eq1:=a^k=b^2;
eq2:=solve(%,k);

This might be what you want 8D For any set of a and b, k can only have one value

for i from 1 to nops(A) do
   for j from 1 to nops(A) do
      evalf(subs([a=A[i],b=A[j]],eq2));
      if evalb(%-round(%)=0) then
         print(k=%,[(a=A[i],b=A[j])]);
      end if;
   end do;
end do;

MaplePrimes - answers and comments on Question, For and If loop

Could you be more precise?

Given a set A:={...}and an equation eq1:=a^k=b^2;eq2:=solve