simple math question for realm 2 -closed- congrats Lman360-
Moderator: moderators
simple math question for realm 2 -closed- congrats Lman360-
this is simple......
the first person to get the CORRECTwill win 1mil power for 0.01 tomorrow.
good luck
956241+472490
what is it....
you have 30mins it will end at 12:38 board time.
GO
the first person to get the CORRECTwill win 1mil power for 0.01 tomorrow.
good luck
956241+472490
what is it....
you have 30mins it will end at 12:38 board time.
GO
Last edited by Guest on 05.05.2008, 10:24, edited 1 time in total.
well if you can't figure out a simple adition sum on a peice of paper theres something wrongStash wrote:How do you think Lman360 got the right answer?2. you cheated?
You should think of a question like:
A man buys a book and a camera and pays 110 Caps together.
The camera costs 100 Caps more than the book.
How much does the book cost?

Re: simple math question for realm 2 -closed- congrats Lman3
power for 0.01 ? if this is not cheating......matt wrote:the first person to get the CORRECTwill win 1mil power for 0.01 tomorrow.
After reading this thread, I couldn't resist the temptations to introduce you the type of the math problems (from all different contests and olympiads) I come in touch with almost daily. I wouldn't advise to try them, they are actually very hard, for they include a lot of theorems and tricks you don't really learn in school.
Let f(x) be a non-constant polynomial with integer coefficients. Prove that there is an integer n such that f(n) has at least 2004 distinct prime factors.
Call a set A of integers non-isolated, if for every x from the set A at least one of the numbers x - 1 and x + 1 also
belongs to A. Prove that the number of five-element non-isolated subsets of {1, 2, . . . , n} is (n - 4)
Let f(x) be a non-constant polynomial with integer coefficients. Prove that there is an integer n such that f(n) has at least 2004 distinct prime factors.
Call a set A of integers non-isolated, if for every x from the set A at least one of the numbers x - 1 and x + 1 also
belongs to A. Prove that the number of five-element non-isolated subsets of {1, 2, . . . , n} is (n - 4)
[quote] Let f(x) be a non-constant polynomial with integer coefficients. Prove that there is an integer n such that f(n) has at least 2004 distinct prime factors.
Call a set A of integers non-isolated, if for every x from the set A at least one of the numbers x - 1 and x + 1 also
belongs to A. Prove that the number of five-element non-isolated subsets of {1, 2, . . . , n} is (n - 4)
Call a set A of integers non-isolated, if for every x from the set A at least one of the numbers x - 1 and x + 1 also
belongs to A. Prove that the number of five-element non-isolated subsets of {1, 2, . . . , n} is (n - 4)
I think its better if the fly starts in the top/bottom corner on the same side of the spider. I am not sure, but that sounds right.Nordic Group wrote:
And finally a fairly easy one:
A spider and a fly are sitting on a cube. The fly wants to maximize the shortest path to the spider
along the surface of the cube. Is it necessarily best for the fly to be at the point opposite to the spider?
("Opposite" means "symmetric with respect to the center of the cube".)
It isnt right.Canadian Energy Corp. wrote:how easy, 10 capsStash wrote:Has anybody actually found this out already?A man buys a book and a camera and pays 110 Caps together.
The camera costs 100 Caps more than the book.
How much does the book cost?


But if we say the book costs 5 caps, then would the camera cost 105. 105+5=110 caps.
