Usamashaker:
"500/999 is greater than to be the same 499/999 so the sum of the two integers more likely to be odd"
Mark:
TWO INTEGERS
P(even) = 499999/999999
P(odd) = 500000/999999
There is a greater chance that the sum will be odd!
There are 500,000 even integers between 1 and one million (inclusive), and, of course, the same number of odd integers. The probability the first number chosen is odd is .5 with the same being true for choosing an even number. The probability the second number chosen has the same parity as the first is 499,999/999,999, while the probability it is of opposite parity is 500,000/999,999. For the sum of two integers to be even, they must have the same parity. Therefore the probability is greater that the sum is odd.
You guys are GREAT.
Mark:
CANOE
1.5 MPH
There are several possible equations to set up.
Let c be the speed of the current, b the speed of the boat (in still water). The time it took for the hat to float back to its starting point is 6/c. The distance the boat traveled (upstream) in the two hour period after losing the hat is 2(b - c) miles, so the total upstream distance traveled is 6 + 2(b - c). During the return trip the boat was moving at a rate of b+c so the time from when the hat was lost until the return of the boat to the starting point was [6 + 2(b - c)]/(b + c) + 2. Setting this quantity equal to 6/c and solving gives c = 1.5, independent of b.
Here's another solution:
Relative to the water, the hat stays still. So, again relative to the water and hat, the rower moves just as fast upstream as downstream. After the hat dropped, the rower rowed for four hours and the hat moved six miles, so the current is flowing at a rate of 6/4 = 1.5 miles per hour.
Hi Whim. good to see you posting again with your 'tricky' problems.
There is no solution to the Diophantine equation A4+B4=C2.
Note that this is the first stage of proving Fermat's Last theorem for n=4.
Here, A2,B2,C are Primitive Pythagorean Triple (assuming without the loss of generality, B2 is even), so
A2=a2-b2
B2=2ab
C=a2+b2
Rearrange the first equation to get A2+b2=a2, so A,b,a is a Pythagorean Triple with b even. Thus
A=c2-d2
b=2cd
a=c2+d2
Substitute the expressions for b and a back to B2=2ab, so we have
B2=4cd(c2+d2)
As c, d, c2+d2 pairwise coprime, each of them must be a perfect square. Therefore,
c=e2, d=f2 and c2+d2=g2
Combine these expression to give
e4+f4=g2
with g g2 = a a2 < C
Therefore, assuming C is minimally chosen on the outset, we found a smaller value for C. Thus, an infinite descent is produced - no solution as required.
A teacher writes a cubic equation on the board:
p(x) = x3 + p x2 + q x + r
with p,q,r integers. He tells his students that that polynomial has three integer roots, and that the largest of the roots is twice the smallest of the roots.
A student guesses a value, A, for the largest root which is too low, and for which p(A) is positive. A second student guesses a value, B, for the largest root which is too high and for which p(B) again positive. A third student, who was dozing in the back of the classroom, notices that each of the four numbers mentioned, A, B, p(A), p(B), is prime and one of them is the number 13.
What are the roots of p(x)
How many rectangles (of any size and in any position) are there on a standard 8 x 8 checkerboard