Recent content by HAP

Look carefull at the third statement: IF TRUE "If the first statement is true, then the second statement is false." IF FALSE "If the first statement is true, then the second statement is NOT false." Now you should be able to see that the third statement is not definied, when the first...

Just confusing learning math in two languages: "least common multiple" (lcm) is "mindste fælles multiplum" (mfm) in danish.. "greatest common divisor" (gcd) is "største fælles divisor" (sfd) in danish.. But they are two different things matt grime; greatest common divisor isn't also known...

I'm afraid you have to explain what gcd(r,n) is... It must be some standard function or technical term I ain't familiar with!

Ahh, my mistake.. But then I think I can explain this pattern a little more general so it will work for other base-values than 6. Look at the base-6 (2*3) number system, if that is what it's called in english.. It will include some symbols s_0, s_1, ..., s_5. If you're looking for primes...

Well, you have a listA that contains all numbers that can be descriped by (6N, +/- 1). Then you make another listB that contains all numbers from listA * listA or in other words (6N, +/- 1)*(6M, +/- 1) = (36*N*M, -/+ 6N, +/- 6M, +/- 1)... And then you claim that a primelist (listP) can be...

By the way.. I am now finished running a homemade program made to test if this hypothesis is true for all numbers up to 500; and indeed it is!

I have an easy prove for you, but is not quite sure if I'm making an illegal conclusion (I have not learned about induction yet). Take a look: First I asume that 3|(n^3 - 7n + 3) is true. Then I try to prove that 3|((n+1)^3 - 7(n+1) + 3) is also true... I do this by expanding the expresion...

I have a found a hypothesis which I would like you to look at, and perhabs (dis)prove.. ----------------- All integers (n) bigger than 2 (3, 4, 5, 6, ...) be descriped as: n = (p_1 * p_2 * ...) + k where all p and k are primes, but also include 1. Notice that k < (p_1 * p_2 * ...), and...