answer this one

Guest · Post by **Guest** » 22.07.2008, 21:57

It's impossible and a waste of time for 100 iron for .01 ea. im not going to waste my evening doing this. sorry. i gave it a good 20 minutes.

Guest · Post by **Guest** » 30.07.2008, 12:27

in most cases those riddles shouldn't be used word by word. maybe one "no" is not a "number" it may be "no" like in "not yes".

or it may mean something like 10 = 2 is one number
and
01 = 1 the other one.
the product of 10 and 01 (seen as strings not as numbers) is 1001.
But that should not be the right answer, because 01 = 1 is no prime number as said before.

I wanna say, maybe the problem is not to solve mathematically

Guest · Post by **Guest** » 30.07.2008, 15:40

2 and 7

2 + 7 = 9 and 9 is actually equal to binary 1001

(question does not explain whether 1001 is decimal or binary

)

Guest · Post by **Guest** » 20.08.2008, 12:35

its imposiblae do any of you agree with me

Guest · Post by **Guest** » 10.10.2008, 07:11

Nice question and I think 11*91 is my answer,there may be many.
----------
Ricky Conway

Guest · Post by **Guest** » 10.10.2008, 09:11

rconway wrote:Nice question and I think 11*91 is my answer,there may be many.
----------
Ricky Conway

91 is not prime, it is divisible by 7

Guest · Post by **Guest** » 15.03.2009, 22:57

Tell what "no" and "nos" means in your first post, that should help ppl.

Guest · Post by **Guest** » 23.03.2009, 17:11

That was posted 5 months ago!

Guest · Post by **Guest** » 23.03.2009, 19:45

But no-one knows the answer yet

Guest · Post by **Guest** » 26.03.2009, 17:23

Yeah but the answer is obviously 11 and 91!

Guest · Post by **Guest** » 26.03.2009, 17:26

sergiurocks506 wrote:Yeah but the answer is obviously 11 and 91!

God, 91 is divisible by 7:roll: you should know this by now

Guest · Post by **Guest** » 26.03.2009, 20:13

Mathematically spoken you need to do a prime factorisation in order to solve this problem.

1001 = 7 * 143 = 7 * 11 * 13

So you can see: There are three prime numbers necessary to get a product of 1001. It's not possible with only two prime numbers.

Generally spoken a product is: a * b = x
Our x is 1001. So you can say that whether a or b has to be below the radical of 1001, otherwise the product would always be larger than 1001.
The radical of 1001 is ~31.6386.
So we simply can prove all prime numbers below 31.6386 (2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31).
Find one of them that divides 1001 integer. That one would be our "a". The result of 1001/"prime number (= a)" is our second multiplier, our "b". In our case "b" must be a prime number.

And unfortunately you will not find our "b" as a prime number.
Thus there is no result for this task.

Guest · Post by **Guest** » 26.03.2009, 20:28

AGD wrote:2 and 7

2 + 7 = 9 and 9 is actually equal to binary 1001

(question does not explain whether 1001 is decimal or binary )

well persoanlly i'll copy his answer then

seems logical in all senses

So ha Goldeneye, beaten by your own forum users

Guest · Post by **Guest** » 26.03.2009, 22:00

Err... I guess I didn't get the joke.

2 + 7 = 1001 (binaryly spoken

)

abbaz wrote:the product of two prime nos is 1001 find out the two no

And that would mean 2 * 7...

Guest · Post by **Guest** » 27.03.2009, 16:58

well after 8 months i just noticed "product" (thanks to GoldenEye)

what i am thinking is not the answer but how did i come up with this result

i believe it has to be true but how

Business Simulation Kapilands

answer this one

Re:"Board Games"

Re:"Board Games"