2, Amber
3, Sapphire
2, Amber
3, Sapphire
D, thus 0 isn't correct
C, thus 9, 7 are correct
B, thus 7 is the very correct one
thus 2 isn't correct
and D, thus 6 isn't correct
A, thus 3 is correct
it's placed wrong, thus 3 is the first digit
thus 3, 7, 9 is the solution
QED
D, thus 0 isn't correct
C, thus 9, 7 are correct
B, thus 7 is the very correct one
thus 2 isn't correct
and D, thus 6 isn't correct
A, thus 3 is correct
it's placed wrong, thus 3 is the first digit
thus 3, 7, 9 is the solution
QED
ą^|g1*g2*...gz|=(p1^r1)(p2^r2)...(pz^rz), where r1...rz∈Z, r1...rz≠0
now time both sides of the equation with all possible pi^|ri| st ri(i=1...z) is a negative number.
then the left side is a composite number with ą as its factor; the right side is not. Thus there's contradiction.
QED
ą^|g1*g2*...gz|=(p1^r1)(p2^r2)...(pz^rz), where r1...rz∈Z, r1...rz≠0
now time both sides of the equation with all possible pi^|ri| st ri(i=1...z) is a negative number.
then the left side is a composite number with ą as its factor; the right side is not. Thus there's contradiction.
QED
let c1=f1/g1, c2=f2/g2... where f1, f2...∈N+ and g1, g2...∈Z(none of them are 0)
now that the amount of pi(i=1,2..z) is finite, there exists a prime number different from them all, let's use a symbol ą for it.
Assume ą=(a1^x1)(a2^x2)...=(p1^(f1/g1))(p2^(f2/g2))...(pz^(fz/gz))
let c1=f1/g1, c2=f2/g2... where f1, f2...∈N+ and g1, g2...∈Z(none of them are 0)
now that the amount of pi(i=1,2..z) is finite, there exists a prime number different from them all, let's use a symbol ą for it.
Assume ą=(a1^x1)(a2^x2)...=(p1^(f1/g1))(p2^(f2/g2))...(pz^(fz/gz))