You are not logged in.
Pages: 1
1.n=s^2t; n is a multiple of 7 and which is multiple of 49
options were
s^2t
s^2
t and some thing like...i hope answer is s^t
Offline
Nope. We're sure only for 7/s^t.
So 7^2/(s^t)^2 = s^2t, option 1
IPBLE: Increasing Performance By Lowering Expectations.
Offline
how can it be sure as s^2t itself is multiple of 7, i think atleast it should be s^4t.
Offline
how can it be sure as s^2t itself is multiple of 7, i think atleast it should be s^4t.
IPBLE: Increasing Performance By Lowering Expectations.
Offline
Knowing that if a prime number divides a square of x, then it also divides x
Or in more general terms:
"In the real world, this would be a problem. But in mathematics, we can just define a place where this problem doesn't exist. So we'll go ahead and do that now..."
Offline
Or more general:
Last edited by krassi_holmz (2006-12-29 06:52:51)
IPBLE: Increasing Performance By Lowering Expectations.
Offline
Or more general:
"In the real world, this would be a problem. But in mathematics, we can just define a place where this problem doesn't exist. So we'll go ahead and do that now..."
Offline
Or more general:
Last edited by krassi_holmz (2006-12-30 03:52:09)
IPBLE: Increasing Performance By Lowering Expectations.
Offline
Pages: 1