Interesting proofs

bobbym · 2011-01-08 09:04:37

Hi 4DLiVing;

Welcome to the forum.

Can you believe that no one has noticed the above statement yet?

4DLiVing · 2011-01-09 03:44:49

Hey bobbym;

I agree, -1 is not a square.

But... it is a cube. and 1 is a square. So this leaves 0 between a square and a cube.

bobbym · 2011-01-09 04:42:56

Exactly! There you go. There is already a proof to this theorem as Ricky points out.

4DLiVing · 2011-01-09 06:00:35

Ok.. got it... you were simply pointing out that you could not believe someone did not realize that.

This might be something intersting to prove...

For all natural numbers, there exists an infinite amount of n and m's that satisfy this condition: n^2 = m^3.

bobbym · 2011-01-09 06:16:33

With the conditions you left out, there is an infinite number of solutions I believe.

4DLiVing · 2011-01-09 06:35:43

a proof by induction i think would work here...

If you make the function n = (m^3)^(1/2), the solutions are

(1, 1)
(4, 8)
(9, 27)
(16, 64)
...
The independent values are all the perfect squares, the dependent values are all the perfect cubes.

bobbym · 2011-01-09 06:52:19

You really do not need one because every sixth power is a square and a cube:

Since there are an infinite number of sixth powers then there is an infinite number of solutions to your equation.

4DLiVing · 2011-01-09 07:35:13

aha... very interesting! Expansion of the mind again!

Could an induction proof flow like this somewhat? (I haven't done higher level math in a while and I am trying to remember what I did in college.)

We are trying to prove that:

s^2 = c^3 or

s = (c^3)^(1/2).

The solution sets (c, s) are of the form (n^2, n^3) for n = 1, 2,....

Indeed, when n = 1,

we have the solution set (1, 1) and 1 = 1^2 = 1^3 = 1.

In general, substituting c = n^2 and s = n^3 into s = (c^3)^(1/2)

gives us n^3 = ((n^2)^3)^(1/2) = n^3.

Does n + 1 work?

(n + 1)^3 = (((n + 1)^2)^3)^(1/2) = (n + 1)^3

Indeed it does, so there are an infinite amount of s and c that satisfy the condition s^2 = c^3.

bobbym · 2011-01-09 08:35:19

I am not working it that way. And every time I try I am coming down to n^2 * n^2 * n^2 = n^3 * n^3. It is an identity you do not need to use induction.

4DLiVing · 2011-01-12 04:48:13

haha now I see it...

Basically, I am trying to use a grenade launcher to kill an ant, when all I really would need to do is step on the thing!

Thanks for checking into it for me!

bobbym · 2011-01-12 04:59:53

Hi 4DLiVing;

Yes, I would use the law of exponents. It is easy to see that there is an infinite amount of them.

N = { 0,1,2,3,4,5,6,7,8,9,10...}

We can map f(n) = n^6 to N. This will produce {0,1,64, 3^6, 4^6, 5^6, 6^6, ...}. The mapping produces a set that is one to one and onto. It is therefore infinite.

DrSteve · 2011-01-13 02:45:03

Zhylliolom wrote:

Theorem:
There are infinitely many primes.
Proof:
Define a topology on the set of integers by using the arithmetic progressions (from -∞ to ∞) as a basis. It is easy to verify that this yields a topological space. For each prime p let A[sub]p[/sub] consist of all multiples of p. A[sub]p[/sub] is closed since its complement is the union of all the other arithmetic progressions with difference p. Now let A be the union of the progressions A[sub]p[/sub]. If the number of primes is finite, then A is a finite union of closed sets, hence closed. But all integers except -1 and 1 are multiples of some prime, so the complement of A is {-1, 1} which is obviously not open. This shows A is not a finite union and there are infinitely many primes.

Here is a much more elementary proof that there are infinitely many primes:

Let

be prime, and . By the Fundamental Theorem of Arithmetic M has a prime factor which clearly must be greater than .

Last edited by DrSteve (2011-01-13 02:45:59)

Chalisque · 2011-07-15 20:48:58

Haven't read the other comments on this thread but the more interesting question is that if you require that p and q be chosen such that q is not in the extension of Q by p, is it still possible that p^q is rational.

namealreadychosen · 2011-07-31 20:18:21

Interesting proofs involving cubes

1. The only integer solution to (x+y+z)^3=xyz is 0,0,0

If, of x,y,z, all are ==1(mod3) or all are ==2(mod3) then x+y+z is a multiple of 3 but xyz cannot be a multiple of 3 if none if its factors is. If all are multiples of 3 then, except in the case where x,y,z=0,0,0, dividing x,y and z by 3 will also yield a solution, so a non-trivial solution with all multiples of 3 only exists if there is a solution with at least one not a multiple of 3.

If, of x,y,z, two are ==1(mod3) and one is ==2(mod3), (x+y+z)^3== (1+1+2)^3==1(mod3) but xyz==2(mod3). If one is ==1(mod3) and 2 are ==2(mod3) then (x+y+z)^3== (1+2+2)^3==2(mod3) but xyz==1(mod3).

2.

since 1=1+1/2 and and (n+2)(n+1)/2=n+1+n(n+1)/2 therefore all successive successors of 1 satisfy this sum (tounge twister

).

since 1^3= ((1+1)/2)^2 and and .

Last edited by namealreadychosen (2011-07-31 20:18:49)

radhakrishnamurty padyala · 2014-01-22 02:41:46

Are the sides of a triangle lenearly independent quantities?

bobbym · 2014-01-22 03:17:56

Hi;

I would say not.

ShivamS · 2014-01-22 06:18:18

How's that triangle possible?

bobbym · 2014-01-22 06:23:15

Hi;

Could be a (3,4,5) triangle.

ShivamS · 2014-01-22 06:36:40

When you said x, y and x+y, you meant side lengths, right?

bobbym · 2014-01-22 06:39:57

Hi;

Not exactly. Those are vectors and the diagram shows that x ( one side of the triangle ) and y ( another side ) when added form the third side ( x + y ).

Now, ( x + y ) is a vector but it is a linear combination of x and y. Therefore it is not linearly dependent.

ShivamS · 2014-01-22 06:41:39

Should have read the post before and seen the arrows... For a second I thought it violated the triangle inequality.

bobbym · 2014-01-22 06:43:30

Hi Shivam;

That is tentative. I am not too good with vectors. Could be a load of kaboobly doo.

Math Is Fun Forum

#26 2011-01-08 09:04:37

Re: Interesting proofs

#27 2011-01-09 03:44:49

Re: Interesting proofs

#28 2011-01-09 04:42:56

Re: Interesting proofs

#29 2011-01-09 06:00:35

Re: Interesting proofs

#30 2011-01-09 06:16:33

Re: Interesting proofs

#31 2011-01-09 06:35:43

Re: Interesting proofs

#32 2011-01-09 06:52:19

Re: Interesting proofs

#33 2011-01-09 07:35:13

Re: Interesting proofs

#34 2011-01-09 08:35:19

Re: Interesting proofs

#35 2011-01-12 04:48:13

Re: Interesting proofs

#36 2011-01-12 04:59:53

Re: Interesting proofs

#37 2011-01-13 02:45:03

Re: Interesting proofs

#38 2011-07-15 20:48:58

Re: Interesting proofs

#39 2011-07-31 20:18:21

Re: Interesting proofs

#40 2014-01-22 02:41:46

Re: Interesting proofs

#41 2014-01-22 03:17:56

Re: Interesting proofs

#42 2014-01-22 06:18:18

Re: Interesting proofs

#43 2014-01-22 06:23:15

Re: Interesting proofs

#44 2014-01-22 06:36:40

Re: Interesting proofs

#45 2014-01-22 06:39:57

Re: Interesting proofs

#46 2014-01-22 06:41:39

Re: Interesting proofs

#47 2014-01-22 06:43:30

Re: Interesting proofs

Board footer