flat assembler
Message board for the users of flat assembler.
Index
> Heap > Simple math proofs 
Author 

LocoDelAssembly
http://en.wikipedia.org/wiki/Mathematical_induction
The problem of course is that I forgot how to do it Perhaps I have something on paper, I'll post it if I find it. Since there is few chances to find that info, the other people just don't wait for me and post solution if you know. 

05 Feb 2008, 02:44 

AlexP
thanks, but i'm trying to get this one proofed, this one just isn't "clicking" in my head... Well, any number >= 2 is a product of powers of primes, I don't think that gets me anywhere. n of course has to be an odd number, I already got that part of it proofed, and I know that when n gets over the first two possible integers the range between prime numbers > 8, but I can't figure out how to prove that. So, is there any prime number that +8 is a perfect cube? I don't think it's possible, maybe... Any help on how to prove that n^38 will always be composite?
Hold up, any number that is taken to its square root is always an integer, or it is irrational, so is there a way of spreading it out? IDK, i need help... 

05 Feb 2008, 02:52 

bitRAKE
(2 + n) (4 + 2 n + n^2) = n^3  8
a = n2 b = n^2 + 2n + 4 a b = n^3  8 (a) and (b) are positive integers if (n)>2. 

05 Feb 2008, 03:11 

AlexP
hmm... or just input 3 into the function n^3  8. I just realized that the first possible integer in the equation is the one that solves it . ( actually, contradicts it, but you get it.). 3^3 = 27,  8 equals 19 which is a prime number.
EDIT: Thanks a lot bitRAKE, that does solve it, but all I needed to do is to prove the resulting integer's compositeness. It would take a little more to prove that both of those variables are not prime, lol I do guess that one of them almost has to not produce a prime, and by multiplying it by the second one you prove the result is composite. Thanks, but apparently there was a number that satisfied the equation and proved an exemption to yours. 

05 Feb 2008, 03:18 

LocoDelAssembly
hahaha, but seems that with n > 3 will work and the reason is because the (n  2) will be a number > 1 so the result of the multiplication of course is composite.


05 Feb 2008, 03:27 

AlexP
uhh you mean (n2) will be a number > 1, but if you input 4 then the result of n^3  8 would be zero. You need n > 4 for that to work, right? I'll submit more later after real homework, fun stuff!


05 Feb 2008, 03:30 

LocoDelAssembly
x^3  8 gives me 56
And I tested with the calculator (2 + 4)* (4 + 2*4 + 4*4) to be sure. 

05 Feb 2008, 03:35 

AlexP
Okay, well that does satisfy the original equation, that all of N > 2 are composite for it, but inputting 3 will fault the theory.... Well, on to the next one... And yes, 4^3 = 64, 8 equals 56, which is composite. I would love to draw up a proof that says 3^38 is not composite, I'll quick do that, I don't like to prove ( or disprove) stuff with direct examples of numbers, but here I guess it'll take much longer to find a general proof to counteract it...
Code: n Z, (6(n^2 + n + 1) (5n^2 3) is a perfect square. lol that didn't work, here it is: For all n in the set integers, (6(n^2 + N + 1)  (5N^2  3) is a perfect square Okay, try and prove this, didn't look at it, just copied from book. 

05 Feb 2008, 03:38 

LocoDelAssembly
Perhaps I'm missing something but isn't proof enough that no matters what is the value of (4 + 2*n + n^2) the result will be always a composite number provided that (n  2) > 1? If a = (n  2); b = (n^2 + 2 n + 4) and x = a*b, how could X be prime if it is the result of a multiplication with both parts >= 2? A prime number can't be the result of any a and b pairs.
But again, perhaps I'm missing something about primality of numbers. (And maybe don't understanding your point ) And with the induction principle, at least in the way I used to do it at university, you don't have to disprove by putting an expression, if you find a case where the premise is false you just show it and that is the end of the story. 

05 Feb 2008, 03:58 

AlexP
lol not the end of the story for me!! Yeah, I got the (n2) > 1 thing, wrong thing I was looking at. So it will work, good job on the factoring bitRAKE, and please don't worry if these things seem elementary (lol, it's from an elementary number theory book) to you guys because I'm just starting learning NT. Order a few books on ENT, tons of online tutorials on proofing (even a book I found), and I should be off to a good start. never took anything more than Algebra II, (sophomore in high school), so I've never gone into calc or any of that. AP calculus shall be fun in a few years though last year of high school, anyone here take that as a course?
PS: Yeah, didn't even thing of factoring the equation to solve it, but with the primality part of it good job at realizing that Okay, here's one: For all integers n, (1)^n = 1 if and only if n is odd This is common sense that a negative to an odd power is negative, but how do you prove it? I got to (1)^2r+1, where 2r+1 is an odd number, but I can't figure out how you would do this. Maybe prove that squaring negative integers results in a positive, but how to translate to general variable for the exponent? Suggestions? 

05 Feb 2008, 04:06 

bitRAKE
(1)^(2r+1)=(1)^2r * (1)
(1)^2r = (1)(1)*(1)(1)*... =1 We can remove pairs of (1) until the exponent is one, this is by definition an odd number exponent: (1)^5 = (1)(1)*(1)^3 = (1)(1)(1) = (1) 

05 Feb 2008, 04:40 

AlexP
yes, so a mathematical symbol for multiplication "summation" (II of 1). Good point, I don't know how to proof it though... Maybe just show the first two lines of your equation (I got to that beforeeee..), and then show that 2r as an exponent always produces the same result through some proof I could make, and that all that matters is the +1. Yeah, but how to make that into a robust proof? n ^ 2r = n is what needs to be solved here, nothing more. ( by solved, I mean put into numbers not sentences. And if anyone spells out sentences with hex, I swear I will track you down and thwack you over the head with this computer . So yeah, just solve n^2r = n. I'll do that in school tomorrow if I have time.
and if anyone wants something else, how about this: There is a unique prime p in the form: n^2 + 2n  3. Should only take a few minutes by hand, few milliseconds with code 

05 Feb 2008, 04:46 

bitRAKE
AlexP wrote: There is a unique prime p in the form: n^2 + 2n  3 Quote: a. Any positive integer has a base two form: 1... 

05 Feb 2008, 06:27 

Xorpd!
If you want to learn anything about math, forget the high school curriculum which is intended to deaden your consciousness. A couple of lightweight math books are Recreations in Number Theory; the Queen of Mathematics Entertains, Beiler, Dover 1964 and Introduction to Number Theory, Shockley, International Thomson Publishing 1967. For a total of about $20, these may provide the motivation to learn something about math.


05 Feb 2008, 07:41 

AlexP
This isn't part of highschool, our school sucks when it comes to math
Okay, I've got a reallly good one for you guys  Code: There exits M > 0, where when n > M the following polynomial produces prime: n^2  n + 11 Solution: http://en.wikipedia.org/wiki/Formula_for_primes Just research Euler's quadratic and the proof lies there. Here's another, from before. Pretty simple, but may be interesting to some people. Code: There exist prime P in the form n^2 + 2n  3 Solution: Just factor for (n+3)(n1), then take each = 0 and solve... Well, no one has been replying, but if you would like more please post! (feel free to post your solutions or thoughts about those two problems, especially the Euler one). 

05 Feb 2008, 22:26 

revolution
This whole topic should be in Heap. There is no programming to see here folks.


06 Feb 2008, 04:10 

LocoDelAssembly
Moved. Sorry, I didn't realize that it wasn't there already.


06 Feb 2008, 04:35 

MCD
Does anyone here have a proof for the following problem in tex?
Code: \forall n > 2 \land n \in 2\N : \exist p,q \in \P : p+q = n with \P being the set of prime numbers 

13 Feb 2008, 21:16 

MHajduk
MCD wrote: Does anyone here have a proof for the following problem in tex? 

13 Feb 2008, 21:31 

< Last Thread  Next Thread > 
Forum Rules:

Copyright © 19992020, Tomasz Grysztar.
Powered by rwasa.