Math Is Fun Forum

  Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

#1 Re: Help Me ! » Distance Optimization » 2015-01-23 09:18:20

Yes that's what I meant. I see how you do it now. I can't believe I didn't use the dropped perpendicular formula...

#2 Help Me ! » Distance Optimization » 2015-01-20 15:11:57

Cam943
Replies: 2

Hello mathisfun forum users! I wanted to know how to do this question:

"There are 2 graphs. The first of which is

and the second
. What is the length of the shortest line that connects both of the graphs?"

I want to know for the future how to approach these kind of problems. Do I have to find the locus of the length of the normal line at a point on one of the graphs, and then optimize it?

Thanks,
Cam943

#3 Re: Help Me ! » Factor Theorem » 2014-12-14 12:08:48

I used the remainder theorem because I think it is more suited to this question, sorry if it had to be factor theorem.

Let the function be

Since the remainders are equal, according to the remainder theorem,

Therefore,

Since a≠0, the answer must be

.

#5 Re: Help Me ! » Can anyone prove this? » 2014-11-08 06:01:53

How was it proved that

again? Sorry I couldn't understand. I understood the last part of the proof with

and
though.

#6 Help Me ! » Can anyone prove this? » 2014-11-07 18:23:21

Cam943
Replies: 4

Hello mathisfun members! I was making up practice proof problems, and I made up a killer one and I want to see if anyone can prove it, so I know how it works and I can add it to my answers. Be warned, it is extremely tough.

Prove that:

For all values of x (all real numbers).

~Cam943

(By the way, if possible, can you somehow keep your proofs to Calculus III level and below? I'm only 13 so I won't understand if you use high level university proofs, though I'm not sure if there are such.)

Board footer

Powered by FluxBB