Help me out

Hey guys I need some help...

Recently I was given a chance at extra credit on my final exam for math. The extra credit points could be very high, it's all determined by your grade. Basically what my teacher is doing is if you receive the extra credit he will take your highest simester average, subtract that from 100 and multiply it by 2.

Example:
(Highest average= 87; 100-87=13; 13x2=26; +26 extra credit)

Anyways, to get this extra credit I need to find a math problem my teacher can't solve. If he can't solve it I have to provide the answer and a detailed explanation of how to get it.

If you know of any math problems that could stump a highschool geometry teacher, could you please share?

I will pick one, two at the most to use. If I do infact get the extra credit I will make you a sig, userbar, avatar, or nametag if you would like.

For everyone who chooses to attempt to help me, thanks in advance.

Does Calculus count? :]

Originally Posted by arunforce

Does Calculus count? :]

you can do anything you want :O

Originally Posted by Czar

Tell him to prove this...
If he can hes a genius [;
Its the Goldbach Conjecture, ive done work with it before
Link

Goldbach's original conjecture (sometimes called the "ternary" Goldbach conjecture), written in a June 7, 1742 letter to Euler, states "at least it seems that every number that is greater than 2 is the sum of three primes" (Goldbach 1742; Dickson 2005, p. 421). Note that here Goldbach considered the number 1 to be a prime, a convention that is no longer followed. As re-expressed by Euler, an equivalent form of this conjecture (called the "strong" or "binary" Goldbach conjecture) asserts that all positive even integers >=4 can be expressed as the sum of two primes. Two primes (p,q) such that p+q=2n for n a positive integer are sometimes called a Goldbach partition (Oliveira e Silva).

According to Hardy (1999, p. 19), "It is comparatively easy to make clever guesses; indeed there are theorems, like 'Goldbach's Theorem,' which have never been proved and which any fool could have guessed." Faber and Faber offered a $1000000 prize to anyone who proved Goldbach's conjecture between March 20, 2000 and March 20, 2002, but the prize went unclaimed and the conjecture remains open.

Schnirelman (1939) proved that every even number can be written as the sum of not more than 300000 primes (Dunham 1990), which seems a rather far cry from a proof for two primes! Pogorzelski (1977) claimed to have proven the Goldbach conjecture, but his proof is not generally accepted (Shanks 1985). The following table summarizes bounds n such that the strong Goldbach conjecture has been shown to be true for numbers <n.
bound reference
1×10^4 Desboves 1885
1×10^5 Pipping 1938
1×10^8 Stein and Stein 1965ab
2×10^(10) Granville et al. 1989
4×10^(11) Sinisalo 1993
1×10^(14) Deshouillers et al. 1998
4×10^(14) Richstein 1999, 2001
2×10^(16) Oliveira e Silva (Mar. 24, 2003)
6×10^(16) Oliveira e Silva (Oct. 3, 2003)
2×10^(17) Oliveira e Silva (Feb. 5, 2005)
3×10^(17) Oliveira e Silva (Dec. 30, 2005)
12×10^(17) Oliveira e Silva (Jul. 14, 2008)

Problem + Explanation :O

Originally Posted by Ryguy

you can do anything you want :O

I was looking at this, seems difficult
probability, global minimum, stuff like that..

Link

Explaining and proving the goldbach is currently one of the worlds un-solved math problems..
just have your teacher try Lol.. people spend years trying

Tell him to prove this...
If he can hes a genius [;
Its the Goldbach Conjecture, ive done work with it before
Link

Goldbach's original conjecture (sometimes called the "ternary" Goldbach conjecture), written in a June 7, 1742 letter to Euler, states "at least it seems that every number that is greater than 2 is the sum of three primes" (Goldbach 1742; Dickson 2005, p. 421). Note that here Goldbach considered the number 1 to be a prime, a convention that is no longer followed. As re-expressed by Euler, an equivalent form of this conjecture (called the "strong" or "binary" Goldbach conjecture) asserts that all positive even integers >=4 can be expressed as the sum of two primes. Two primes (p,q) such that p+q=2n for n a positive integer are sometimes called a Goldbach partition (Oliveira e Silva).

According to Hardy (1999, p. 19), "It is comparatively easy to make clever guesses; indeed there are theorems, like 'Goldbach's Theorem,' which have never been proved and which any fool could have guessed." Faber and Faber offered a $1000000 prize to anyone who proved Goldbach's conjecture between March 20, 2000 and March 20, 2002, but the prize went unclaimed and the conjecture remains open.

Schnirelman (1939) proved that every even number can be written as the sum of not more than 300000 primes (Dunham 1990), which seems a rather far cry from a proof for two primes! Pogorzelski (1977) claimed to have proven the Goldbach conjecture, but his proof is not generally accepted (Shanks 1985). The following table summarizes bounds n such that the strong Goldbach conjecture has been shown to be true for numbers <n.
bound reference
1×10^4 Desboves 1885
1×10^5 Pipping 1938
1×10^8 Stein and Stein 1965ab
2×10^(10) Granville et al. 1989
4×10^(11) Sinisalo 1993
1×10^(14) Deshouillers et al. 1998
4×10^(14) Richstein 1999, 2001
2×10^(16) Oliveira e Silva (Mar. 24, 2003)
6×10^(16) Oliveira e Silva (Oct. 3, 2003)
2×10^(17) Oliveira e Silva (Feb. 5, 2005)
3×10^(17) Oliveira e Silva (Dec. 30, 2005)
12×10^(17) Oliveira e Silva (Jul. 14, 2008)

(-2a^2+8a-4)-(8a^3-5a^2+3) you have to simplyfi
=-2a^2+8a-4-8a^3+5a^2-3 simplyfi it again
=-8a^3-2a^2+5a^2+8a-4-3 then simplyfi for the final answer
=-8a^3+3a^2+8a-7 and that ur final answer

Originally Posted by mac_man

(-2a^2+8a-4)-(8a^3-5a^2+3) you have to simplyfi
=-2a^2+8a-4-8a^3+5a^2-3 simplyfi it again
=-8a^3-2a^2+5a^2+8a-4-3 then simplyfi for the final answer
=-8a^3+3a^2+8a-7 and that ur final answer

Lol epic fail.

Is you're teacher reasonably smart? I can write a simple question, or a hard question.

Originally Posted by arunforce

Is you're teacher reasonably smart? I can write a simple question, or a hard question.

Uhm

Yea hes pretty smart :O

And he's one of those people who even if he doesnt get it will spend time on the problem for a very long time until he gets it

-_- leonz, if he can't provide the answer to the goldbach, then he can't use it. It has to be a problem with a answer he can provide.

Mathematics - Wikipedia, the free encyclopedia

Learn what you think you can.

This question will rattle him
How many fail projects has Jetamay worked on

Hurry I need it by tomorrow :O

Ok, I'm gonna dig up some competion stuff I got as prep. Give me 10 mins to find a problem & translate.

EDIT: got some junk, but it's easy to solve once you see the trick. Let me find some state level junk.

EDIT2: can't find the state junk, got some regional levels, what you want, geometry, algebra...?

Anything a highschool geom teacher couldnt figure out

Help me out

Post a Reply

Similar Threads

Tags for this Thread