COMPGROUPS.NET | Search | Post Question | Groups | Stream | About | Register

### Prime Generalization Conjecture

• Email
• Follow

```RULE: EVERY PRIME number is exactly
1/2 of some other number +1.

```
 0
Reply MeAmI (137) 6/20/2009 6:06:46 AM

See related articles to this posting

```MeAmI.org said:

> RULE: EVERY PRIME number is exactly
>               1/2 of some other number +1.

2 is a counter-example unless "other number" can mean "same number".

In general, if P = X / 2 + 1, then X = (P - 1) * 2, so your claim is
tantamount to saying that for each prime number there exists some
other number that can be reached by subtracting one from the prime
number and then doubling the result. This leads us to some other
observations of equal interest:

RULE: EVERY PERFECT SQUARE is exactly 1/2 of some other number +1.
RULE: EVERY PERFECT CUBE is exactly 1/2 of some other number +1.
RULE: EVERY FIBONACCI NUMBER is exactly 1/2 of some other number +1.
RULE: EVERY LUCAS NUMBER is exactly 1/2 of some other number +1.
RULE: EVERY INTEGER is exactly 1/2 of some other number +1.

Good solid stuff, but I don't think it's going to win a Fields Medal
any time soon.

--
Richard Heathfield <http://www.cpax.org.uk>
Email: -http://www. +rjh@
Forged article? See
http://www.cpax.org.uk/prg/usenet/comp.lang.c/msgauth.php
"Usenet is a strange place" - dmr 29 July 1999
```
 0
Reply rjh (10790) 6/20/2009 6:45:10 AM

```On Fri, 19 Jun 2009, MeAmI.org wrote:

> RULE: EVERY PRIME number is exactly
>              1/2 of some other number +1.
>
So what?  For all x, x = (2x - 2)/2 + 1.

Trivial rule.
Every integer (rational number, real number, complex number) is half
of some integer (resp. rational number, real number, complex number)
plus one.

Exercise.  How many primes are half of some prime plus one?
```
 0
Reply marsh6245 (32) 6/20/2009 7:13:39 AM

```On Jun 20, 12:13=A0am, William Elliot <ma...@rdrop.remove.com> wrote:
> On Fri, 19 Jun 2009, MeAmI.org wrote:
> > RULE: EVERY PRIME number is exactly
> > =A0 =A0 =A0 =A0 =A0 =A0 =A01/2 of some other number +1.
>
> So what? =A0For all x, x =3D (2x - 2)/2 + 1.
>
> Trivial rule.
> Every integer (rational number, real number, complex number) is half
> of some integer (resp. rational number, real number, complex number)
> plus one.
>
> Exercise. =A0How many primes are half of some prime plus one?

Prime Generalization (by Musatov): EVERY PRIME number is exactly
1/2 of a number +1.

Variant: RULE(0): EVERY PRIME number greater than two is exactly
1/2 of some other number +1.
```
 0
Reply marty.musatov (1143) 6/20/2009 7:21:24 AM

```Prime Generalization (by Musatov): EVERY PRIME number is exactly
1/2 of a number +1.

Variant: RULE(0): EVERY PRIME number greater than two is exactly
1/2 of some other number +1.
```
 0
Reply marty.musatov (1143) 6/20/2009 8:01:07 AM

```On Jun 20, 12:13=A0am, William Elliot <ma...@rdrop.remove.com> wrote:
> On Fri, 19 Jun 2009, MeAmI.org wrote:
> > RULE: EVERY PRIME number is exactly
> > =A0 =A0 =A0 =A0 =A0 =A0 =A01/2 of some other number +1.
>
> So what? =A0For all x, x =3D (2x - 2)/2 + 1.
>
> Trivial rule.
> Every integer (rational number, real number, complex number) is half
> of some integer (resp. rational number, real number, complex number)
> plus one.
>
> Exercise. =A0How many primes are half of some prime plus one?

None. Half of a prime number is not a whole number.

17/2=3D8.5+1=3D9.5 (NP).

So we have the result:

RULE: No prime number is 1/2 another prime number plus one.
```
 0
Reply marty.musatov (1143) 6/20/2009 11:06:22 AM

```On Jun 20, 4:06=A0am, Musatov <marty.musa...@gmail.com> wrote:
> On Jun 20, 12:13=A0am, William Elliot <ma...@rdrop.remove.com> wrote:
>
> > On Fri, 19 Jun 2009, MeAmI.org wrote:
> > > RULE: EVERY PRIME number is exactly
> > > =A0 =A0 =A0 =A0 =A0 =A0 =A01/2 of some other number +1.
>
> > So what? =A0For all x, x =3D (2x - 2)/2 + 1.
>
> > Trivial rule.
> > Every integer (rational number, real number, complex number) is half
> > of some integer (resp. rational number, real number, complex number)
> > plus one.
>
> > Exercise. =A0How many primes are half of some prime plus one?
>
> None. Half of a prime number is not a whole number.
>
> 17/2=3D8.5+1=3D9.5 (NP).
>
> So we have the result:
>
> RULE: No prime number is 1/2 another prime number plus one.

But perhaps this is what you meant.

Inverse/Additive prime property per Musatov: (below)

RULE: EVERY PRIME number is twice
a number +1.
3=3D1*2+1
5=3D2*2+1
7=3D3*2+1
11=3D5*2+1
13=3D6*2+1
17=3D8*2+1
19=3D9*2+1
23=3D11*2+1
29=3D14*2+1
31=3D15*2+1
37=3D18*2+1
41=3D20*2+1
43=3D21*2+1
47=3D23*2+1
51=3D25*2+1
53=3D26*2+1

And combined Prime Generalization: (Musatov)

RULE: Every prime is 1/2 a number +1 and twice a number plus +1.

Now consider the series again, but this time plot the additive
difference between first and next doubled number.

In the first two terms we write....
3=3D1*2+1   #
5=3D2*2+1   1 because the difference between the doubled numbers from
the first to the next was "1".

And we continue....

(here is the full table)
3=3D1*2+1      #
5=3D2*2+1      1
7=3D3*2+1      1
11=3D5*2+1    2
13=3D6*2+1    1
17=3D8*2+1    2
19=3D9*2+1    1
23=3D11*2+1  2
29=3D14*2+1  3
31=3D15*2+1  1
37=3D18*2+1  3
41=3D20*2+1  2
43=3D21*2+1  1
47=3D23*2+1  2
51=3D25*2+1  2
53=3D26*2+1  1

I would like to see if these reveals more to clarity to series of
primes...

```
 0
Reply marty.musatov (1143) 6/20/2009 11:24:05 AM

```Musatov <marty.musatov@gmail.com> writes:
> On Jun 20, 12:13 am, William Elliot <ma...@rdrop.remove.com> wrote:
<snip>
>> Exercise.  How many primes are half of some prime plus one?
>
> None. Half of a prime number is not a whole number.

Except for 2.

<snip>
> So we have the result:
>
> RULE: No prime number is 1/2 another prime number plus one.

Just one prime number is exactly one plus 1/2 another prime number.
(Wording changed to avoid the ambiguity between p/2 + 1 and (p + 1)/2.)

--
Ben.
```
 0
Reply ben.usenet (6790) 6/20/2009 11:26:04 AM

```Oh I see you're not answering...(Revised)

Musatov wrote:
> On Jun 20, 4:06=A0am, Musatov <marty.musa...@gmail.com> wrote:
> > On Jun 20, 12:13=A0am, William Elliot <ma...@rdrop.remove.com> wrote:
> >
> > > On Fri, 19 Jun 2009, MeAmI.org wrote:
> > > > RULE: EVERY PRIME number is exactly
> > > > =A0 =A0 =A0 =A0 =A0 =A0 =A01/2 of some other number +1.
> >
> > > So what? =A0For all x, x =3D (2x - 2)/2 + 1.
> >
> > > Trivial rule.
> > > Every integer (rational number, real number, complex number) is half
> > > of some integer (resp. rational number, real number, complex number)
> > > plus one.
> >
> > > Exercise. =A0How many primes are half of some prime plus one?

None. Half of a prime number is not a whole number. (Except 2, in
which case the whole number is 1).
17/2=3D8.5+1=3D9.5 (NP).

So we have the result:

RULE: No prime number greater than two is 1/2 another prime number
plus one.

But perhaps this is what you meant.

Inverse/Additive prime property per Musatov: (below)

RULE: EVERY PRIME number greater than 2 is twice  a number +1.
3=3D1*2+1
5=3D2*2+1
7=3D3*2+1
11=3D5*2+1
13=3D6*2+1
17=3D8*2+1
19=3D9*2+1
23=3D11*2+1
29=3D14*2+1
31=3D15*2+1
37=3D18*2+1
41=3D20*2+1
43=3D21*2+1
47=3D23*2+1
51=3D25*2+1
53=3D26*2+1

And combined Prime Generalization: (Musatov)

RULE: Every prime greater than two is 1/2 a number +1 and twice a
number +1.

Now consider the series again, but this time plot the additive
difference between first and next doubled number.

In the first two terms we write....
3=3D1*2+1   #
5=3D2*2+1   1 because the difference between the doubled numbers from
first to the next was "1".

And we continue....
(here is the full table)
3=3D1*2+1      #
5=3D2*2+1      1
7=3D3*2+1      1
11=3D5*2+1    2
13=3D6*2+1    1
17=3D8*2+1    2
19=3D9*2+1    1
23=3D11*2+1  2
29=3D14*2+1  3
31=3D15*2+1  1
37=3D18*2+1  3
41=3D20*2+1  2
43=3D21*2+1  1
47=3D23*2+1  2
51=3D25*2+1  2
53=3D26*2+1  1

I would like to see if these reveals more to clarity to the set of
primes.

How might it?
Ben Bacarisse wrote:
> Musatov <marty.musatov@gmail.com> writes:
> > On Jun 20, 12:13=A0am, William Elliot <ma...@rdrop.remove.com> wrote:
> <snip>
> >> Exercise. =A0How many primes are half of some prime plus one?
> >
> > None. Half of a prime number is not a whole number.
>
> Except for 2.
>
> > So we have the result:
> >
> > RULE: No prime number is 1/2 another prime number plus one. (Except for=
)
>
> Just one prime number is exactly one plus 1/2 another prime number.

Oh yeah, which one?

> Copout per Ben.: Wording changed to avoid the ambiguity between p/2 + 1 a=
nd (p + 1)/2.)
++
Martin
```
 0
Reply marty.musatov (1143) 6/20/2009 3:01:35 PM

```Richard Heathfield wrote:
> MeAmI.org said:
>
>> RULE: EVERY PRIME number is exactly
>>               1/2 of some other number +1.
>
> 2 is a counter-example unless "other number" can mean "same number".

Oh? 3 is 'another number'. 3+1 = 4 (usually).  4/2 = 2 (usually).

--
[mail]: Chuck F (cbfalconer at maineline dot net)
[page]: <http://cbfalconer.home.att.net>

```
 0
Reply cbfalconer (19194) 6/21/2009 12:54:29 AM

```CBFalconer said:

> Richard Heathfield wrote:
>> MeAmI.org said:
>>
>>> RULE: EVERY PRIME number is exactly
>>>               1/2 of some other number +1.
>>
>> 2 is a counter-example unless "other number" can mean "same
>> number".
>
> Oh? 3 is 'another number'. 3+1 = 4 (usually).  4/2 = 2 (usually).

Division has precedence over addition. Even if it didn't,
associativity would be left to right unless specified otherwise.

Let "some other number" be X.

(X / 2) + 1 = 2

Subtract one from both sides.

X / 2 = 2 - 1

X / 2 = 1

X = 2

QED

--
Richard Heathfield <http://www.cpax.org.uk>
Email: -http://www. +rjh@
Forged article? See
http://www.cpax.org.uk/prg/usenet/comp.lang.c/msgauth.php
"Usenet is a strange place" - dmr 29 July 1999
```
 0
Reply rjh (10790) 6/21/2009 7:53:57 AM

```Martin Musatov: (as MeAmI.org wrote)

Richard Heathfield wrote:
> CBFalconer said:
>
> > Richard Heathfield wrote:
> >> MeAmI.org said:
> >>
> >>> RULE: EVERY PRIME number is exactly
> >>>               1/2 of some other number +1.
> >>
> >> 2 is a counter-example unless "other number" can mean "same
> >> number".
> >
> > Oh? 3 is 'another number'. 3+1 = 4 (usually).  4/2 = 2 (usually).
>
> Division has precedence over addition. Even if it didn't,
> associativity would be left to right unless specified otherwise.
>
> Let "some other number" be X.
>
> (X / 2) + 1 = 2
>
> Subtract one from both sides.
>
> X / 2 = 2 - 1
>
> X / 2 = 1
>
> X = 2
>
> QED
>
> --
> Richard Heathfield <http://www.cpax.org.uk>
> Email: -http://www. +rjh@
> Forged article? See
> http://www.cpax.org.uk/prg/usenet/comp.lang.c/msgauth.php
> "Usenet is a strange place" - dmr 29 July 1999

Thank you.

--
Musatov
```
 0
Reply MeAmI (137) 6/26/2009 10:15:23 AM

```On Fri, 26 Jun 2009 03:15:23 -0700 (PDT), "MeAmI.org"
<MeAmI@vzw.blackberry.net> wrote:

>Martin Musatov: (as MeAmI.org wrote)
>
>Richard Heathfield wrote:
>> CBFalconer said:
>>
>> > Richard Heathfield wrote:
>> >> MeAmI.org said:
>> >>
>> >>> RULE: EVERY PRIME number is exactly
>> >>>               1/2 of some other number +1.
I suppose given

1/2 of 2 = 1
1 + 1 = 2

Does this take into account eg.    4.5/2 =  2.25
So would that make 3.25 a prime number?

```
 0
Reply johng1254 (13) 6/26/2009 8:20:48 PM

```On Jun 26, 1:20=A0pm, John H. Guillory <jo...@communicomm.com> wrote:
> On Fri, 26 Jun 2009 03:15:23 -0700 (PDT), "MeAmI.org"
>
> <Me...@vzw.blackberry.net> wrote:
> >Martin Musatov: (as MeAmI.org wrote)
>
> >Richard Heathfield wrote:
> >> CBFalconer said:
>
> >> > Richard Heathfield wrote:
> >> >> MeAmI.org said:
>
> >> >>> RULE: EVERY PRIME number is exactly
> >> >>> =A0 =A0 =A0 =A0 =A0 =A0 =A0 1/2 of some other number +1.
>
> I suppose given
>
> =A0 =A0 =A0 =A0 =A0 =A0 =A0 =A0 =A01/2 of 2 =3D 1 =A0
> =A0 =A0 =A0 =A0 =A0 =A0 =A0 =A0 =A0 =A0 =A0 =A0 =A0 =A0 =A0 =A0 =A0 =A01 =
+ 1 =3D 2 =A0
>
> Does this take into account eg. =A0 =A04.5/2 =3D =A02.25
> =A0 So would that make 3.25 a prime number? =A0

A decimal number is not by classical definition prime. Though if you
have an idea of a decimal equivalent of primality, I would love to
hear it.

--

Musatov

"Tear a whole in Cyberspace"
http://MeAmI.org

Search for Truth!
```
 0
Reply marty.musatov (1143) 6/26/2009 11:37:40 PM

```Musatov said:

> On Jun 26, 1:20 pm, John H. Guillory <jo...@communicomm.com>
> wrote:
<snip>
>> So would that make 3.25 a prime number?
>
> A decimal number is not by classical definition prime.

Numbers aren't decimal. They're numbers. Decimal is a system for
/representing/ numbers textually.

> Though if
> you have an idea of a decimal equivalent of primality, I would
> love to hear it.

It's a meaningless concept. Primality has nothing to do with
representation.

--
Richard Heathfield <http://www.cpax.org.uk>
Email: -http://www. +rjh@
Forged article? See
http://www.cpax.org.uk/prg/usenet/comp.lang.c/msgauth.php
"Usenet is a strange place" - dmr 29 July 1999
```
 0
Reply rjh (10790) 6/27/2009 1:12:56 AM

```Musatov wrote:
Richard Heathfield wrote:
> Musatov said:
>
> > On Jun 26, 1:20 pm, John H. Guillory <jo...@communicomm.com>
> > wrote:
> <snip>
> >> So would that make 3.25 a prime number?
> >
> > A decimal number is not by classical definition prime.
>
> Numbers aren't decimal. They're numbers. Decimal is a system for
> /representing/ numbers textually.
>
>
> > Though if
> > you have an idea of a decimal equivalent of primality, I would
> > love to hear it.
>
> It's a meaningless concept. Primality has nothing to do with
> representation.
>
> --
> Richard Heathfield <http://www.cpax.org.uk>
> Email: -http://www. +rjh@
> Forged article? See
> http://www.cpax.org.uk/prg/usenet/comp.lang.c/msgauth.php
> "Usenet is a strange place" - dmr 29 July 1999

Dear Mr. Heathfield,

I agree with you in the classical proof sense primality is as much
governed by physics as it is counting numbers we choose to represent
quantities.

My intention with this reference is providing a means to interface
between prime numbers to the left of the decimal point and decimal
numbers to the right of the decimal point. Perhaps a system where 3.17
refers to two primes, and this sense I am speaking mostly toward
computation, but again I assert, numbers to the left or right of the
decimal, are still just numbers.

I have always been fascinated by this notion:

Numerically, our representations do not appear uniform instinctually,
to me at least.

Here is an example.

If we say, "What 10 is to 20 is not what 2.2 is to 3.3," is there any
truth in proportion to justify this assertion in physics or
mathematics?

We are simply counting.

10 is to 20
....is...
20 is 2x 10

2.2 is to 3.3
....is...
3.3 is 1.5x 2.2
....or...
1/2 of 2.2+2.2=3.3
....or...
1/2 of 2.2=1.1*3=3.33

1 and 1/2 of 2.2=3.3
...or...
1.5 of 2.2=3.3

So there is a split of

1/2+2/5+3/5=15/10
..5+.4+.6=1.5

....And...

1/2*2/5*3/5=x
x=5/10*4/10*6/10=120/10=1.2

..5*.4*.6=1.2

Theorem: use of a set of given quantities.

Rule: adding the set produces at least the product.

Proof(1a): 1 apple + 2 apples + 3 apples=6 apples.

Proof(1b):1 apple * 2 apples * 3 apples=6 apples.

Proof(2a): 5 apples + 4 apples + 6 apples =16 apples.

Proof(2b): 5 apples * 4 apples * 6 apples=120 apples.

Contradiction: in the above example the sum=1.5 and the product=1.2.

Fallacy: Multiplying quantities of items does not shrink them. This
applies to measurements and transforms.

But as we count from 1 to 2 and then 2 to 3

10/1.1 = 9.0909091
20/2.2 = 9.0909091
30/3.3 = 9.0909091

What 1
....is to...
10
....is...
What 2.2 is 22

Proof:  1.1/10=.11
2.2/20=.1
2.2/22=.11

Martin Musatov
```
 0
Reply marty.musatov (1143) 6/27/2009 11:44:11 AM

```Musatov worte:
Musatov wrote:
> Musatov wrote:
> Richard Heathfield wrote:
> > Musatov said:
> >
> > > On Jun 26, 1:20 pm, John H. Guillory <jo...@communicomm.com>
> > > wrote:
> > <snip>
> > >> So would that make 3.25 a prime number?
> > >
> > > A decimal number is not by classical definition prime.
> >
> > Numbers aren't decimal. They're numbers. Decimal is a system for
> > /representing/ numbers textually.
> >
> >
> > > Though if
> > > you have an idea of a decimal equivalent of primality, I would
> > > love to hear it.
> >
> > It's a meaningless concept. Primality has nothing to do with
> > representation.
> >
> > --
> > Richard Heathfield <http://www.cpax.org.uk>
> > Email: -http://www. +rjh@
> > Forged article? See
> > http://www.cpax.org.uk/prg/usenet/comp.lang.c/msgauth.php
> > "Usenet is a strange place" - dmr 29 July 1999
>
> Dear Mr. Heathfield,
>
> I agree with you in the classical proof sense primality is as much
> governed by physics as it is counting numbers we choose to represent
> quantities.
>
> My intention with this reference is providing a means to interface
> between prime numbers to the left of the decimal point and decimal
> numbers to the right of the decimal point. Perhaps a system where 3.17
> refers to two primes, and this sense I am speaking mostly toward
> computation, but again I assert, numbers to the left or right of the
> decimal, are still just numbers.
>
> I have always been fascinated by this notion:
>
> Numerically, our representations do not appear uniform instinctually,
> to me at least.
>
> Here is an example.
>
> If we say, "What 10 is to 20 is not what 2.2 is to 3.3," is there any
> truth in proportion to justify this assertion in physics or
> mathematics?
>
> We are simply counting.
>
> 10 is to 20
> ...is...
> 20 is 2x 10
>
> 2.2 is to 3.3
> ...is...
> 3.3 is 1.5x 2.2
> ...or...
> 1/2 of 2.2+2.2=3.3
> ...or...
> 1/2 of 2.2=1.1*3=3.33
>
> 1 and 1/2 of 2.2=3.3
>       ...or...
>    1.5 of 2.2=3.3
>
> So there is a split of
>
> 1/2+2/5+3/5=15/10
> .5+.4+.6=1.5
>
> ...And...
>
> 1/2*2/5*3/5=x
> x=5/10*4/10*6/10=120/10=1.2
>
> .5*.4*.6=1.2
>
> Theorem: use of a set of given quantities.
>
> Rule: adding the set produces at least the product.
>
> Proof(1a): 1 apple + 2 apples + 3 apples=6 apples.
>
> Proof(1b):1 apple * 2 apples * 3 apples=6 apples.
>
> Proof(2a): 5 apples + 4 apples + 6 apples =15 apples.
>
> Proof(2b): 5 apples * 4 apples * 6 apples=120 apples.
>
> Contradiction: in the above example the sum=1.5 and the product=1.2.
>
> Fallacy: Multiplying quantities of items does not shrink them. This
> applies to measurements and transforms.
>
> But as we count from 1 to 2 and then 2 to 3
>
> 10/1.1 = 9.0909091
> 20/2.2 = 9.0909091
> 30/3.3 = 9.0909091
>
> What 1
> ...is to...
> 10
> ...is...
> What 2.2 is 22
>
> Proof:  1.1/10=.11
>           2.2/20=.1
>          2.2/22=.11
>
> Martin Musatov
```
 0
Reply marty.musatov (1143) 6/27/2009 11:49:13 AM

```Musatov wrote:
Musatov wrote:
Musatov wrote:
Musatov wrote: Richard Heathfield wrote:
Musatov said:
On Jun 26, 1:20 pm, John H. Guillory <jo...@communicomm.com>
wrote:
<snip>
So would that make 3.25 a prime number? A decimal number is not by
classical definition prime.
Numbers aren't decimal. They're numbers. Decimal is a system for
/representing/ numbers textually.

Though if
you have an idea of a decimal equivalent of primality, I would
love to hear it.

It's a meaningless concept. Primality has nothing to do with
representation.
Richard Heathfield <http://www.cpax.org.uk> Email: -http://www. +rjh@
Forged article? See
http://www.cpax.org.uk/prg/usenet/comp.lang.c/msgauth.php
"Usenet is a strange place" - dmr 29 July 1999
Dear Mr. Heathfield,
I agree with you in the classical proof sense primality is as much
governed by physics as it is counting numbers we choose to represent
quantities.

My intention with this reference is providing a means to interface
between prime numbers to the left of the decimal point and decimal
numbers to the right of the decimal point. Perhaps a system where 3.17
refers to two primes, and this sense I am speaking mostly toward
computation, but again I assert, numbers to the left or right of the
decimal, are still just numbers.

I have always been fascinated by this notion:

Numerically, our representations do not appear uniform instinctually,
to me at least.

Here is an example.
If we say, "What 10 is to 20 is not what 2.2 is to 3.3," is there any
truth in proportion to justify this assertion in physics or
mathematics?

We are simply counting.

10 is to 20
...is...
20 is 2x 10
2.2 is to 3.3
...is...
3.3 is 1.5x 2.2
....or...
1/2 of 2.2+2.2=3.3
....or...
1/2 of 2.2=1.1*3=3.33

1 and 1/2 of 2.2=3.3
...or...
1.5 of 2.2=3.3
So there is a split of

1/2+2/5+3/5=15/10
..5+.4+.6=1.5

....And...

1/2*2/5*3/5=x
x=5/10*4/10*6/10=120/10=1.2

..5*.4*.6=1.2

Theorem: use of a set of given quantities.

Rule: adding the set produces at least the product.

Proof(1a): 1 apple + 2 apples + 3 apples=6 apples.

Proof(1b):1 apple * 2 apples * 3 apples=6 apples.

Proof(2a): 5 apples + 4 apples + 6 apples =15 apples.

Proof(2b): 5 apples * 4 apples * 6 apples=120 apples.

Contradiction: in the above example the sum=1.5 and the product=1.2.

Fallacy: Multiplying quantities of items does not shrink them. This
applies to measurements and transforms.

But as we count from 1 to 2 and then 2 to 3

10/1.1 = 9.0909091
20/2.2 = 9.0909091
30/3.3 = 9.0909091

What 1
...is to...
10
...is...
What 2.2 is 22

Proof:  1.1/10=.11
2.2/20=.1
2.2/22=.11
Martin Musatov
```
 0
Reply marty.musatov (1143) 6/27/2009 12:03:40 PM

```Richard Heathfield <r...@see.sig.invalid> wrote:
> CBFalconer said:
> > Richard Heathfield wrote:
> > > MeAmI.org said:
> > > > RULE: EVERY PRIME number is exactly
> > > >               1/2 of some other number +1.

Every prime is exactly half of +1?!

> > >
> > > 2 is a counter-example unless "other number" can mean "same
> > > number".
> >
> > Oh? 3 is 'another number'. 3+1 = 4 (usually).  4/2 = 2 (usually).
>
> Division has precedence over addition. Even if it didn't,
> associativity would be left to right unless specified otherwise.

If I have 4 dollars and 20 cents, what is half the dollars and cents?

a) \$1.20
b) \$2.10
c) \$2.20
d) \$2.40

--
Peter
```
 0
Reply airia (1802) 6/30/2009 3:31:37 AM

```Martin Musatov wrote:
Peter Nilsson wrote:
> Richard Heathfield <r...@see.sig.invalid> wrote:
> > CBFalconer said:
> > > Richard Heathfield wrote:
> > > > MeAmI.org said:
> > > > > RULE: EVERY PRIME number is exactly
> > > > >               1/2 of some other number +1.
>
> Every prime is exactly half of +1?!
>
> > > >
> > > > 2 is a counter-example unless "other number" can mean "same
> > > > number".
> > >
> > > Oh? 3 is 'another number'. 3+1 = 4 (usually).  4/2 = 2 (usually).
> >
> > Division has precedence over addition. Even if it didn't,
> > associativity would be left to right unless specified otherwise.
>
> If I have 4 dollars and 20 cents, what is half the dollars and cents?
>
>   a) \$1.20
>   b) \$2.10
>   c) \$2.20
>   d) \$2.40
>
> --
> Peter

Dear Peter,

allow me a brief moment to clarify my conjecture:

"Musatov's Prime Generalization Conjecture": Every prime greater than
2 is 2n+1=P.

2*1+1=3
2*2+1=5
....
2*20+1=41
....

(1)Is my conjecture provable?

Peter, the answer to the question is "b)2.10".

But please bear with me and consider the following scenario:

Suppose I have three quantities of loose coins:

1) \$0.50
2) \$0.40
3) \$0.60

The sum of the three quantities is \$1.50.

Now suppose we are multiplying those same three quantities of coins:

\$0.50*\$0.40*\$0.60

..50*.40=.20

And...

..20*.60=\$0.12.

(2)Why should multiplying our money result in a loss of \$1.38 or a 92%
loss?

If the three sums were dollars the case would be different.

\$50+\$40+\$60=\$150
\$50*\$40+\$60=\$1200

I do understand how to solve the problem literally, but chose to show
this example to prove decimal representations fail basic rationale.

++
Musatov
```
 0
Reply marty.musatov (1143) 6/30/2009 5:12:03 AM

```* Musatov:
>
> "Musatov's Prime Generalization Conjecture": Every prime greater than
> 2 is 2n+1=P.
>
> 2*1+1=3
> 2*2+1=5
> ...
> 2*20+1=41
> ...
>
> (1)Is my conjecture provable?

Yes but it's completely silly to conjecture that primes greater than 2 are odd.

Cheers & hth.,

- Alf

--
Due to hosting requirements I need visits to <url: http://alfps.izfree.com/>.
No ads, and there is some C++ stuff! :-) Just going there is good. Linking
to it is even better! Thanks in advance!
```
 0
Reply alfps (7389) 6/30/2009 5:24:28 AM

```Peter Nilsson said:

> Richard Heathfield <r...@see.sig.invalid> wrote:
<snip>
>>
>> Division has precedence over addition. Even if it didn't,
>> associativity would be left to right unless specified otherwise.
>
> If I have 4 dollars and 20 cents, what is half the dollars and
> cents?
>
>   a) \$1.20
>   b) \$2.10
>   c) \$2.20
>   d) \$2.40

None of the above. Observe:

#include <stdio.h>
#include <iso646.h>

int half(int x)
{
return x / 2;
}

int main(void)
{
int dollars = 4;
int cents = 20;
int answer = half(dollars) and cents;
return 0;
}

Output:

--
Richard Heathfield <http://www.cpax.org.uk>
Email: -http://www. +rjh@
Forged article? See
http://www.cpax.org.uk/prg/usenet/comp.lang.c/msgauth.php
"Usenet is a strange place" - dmr 29 July 1999
```
 0
Reply rjh (10790) 6/30/2009 6:11:52 AM

```*Musatov:
Alf P. Steinbach wrote:
> * Musatov:
> >
> > "Musatov's Prime Generalization Conjecture": Every prime greater than
> > 2 is 2n+1=P.
> >
> > 2*1+1=3
> > 2*2+1=5
> > ...
> > 2*20+1=41
> > ...
> >
> > (1)Is my conjecture provable?
>
> Yes but it's completely silly to conjecture that primes greater than 2 are odd.
>
>
> Cheers & hth.,
>
> - Alf
>
> --
> Due to hosting requirements I need visits to <url: http://alfps.izfree.com/>.
> No ads, and there is some C++ stuff! :-) Just going there is good. Linking
> to it is even better! Thanks in advance!

Dear Alf,

Thanks for the reply.  I figure I have to start somewhere, thanks for
bearing with me.

(1)So have we established every  prime greater than 2 is 2N+1?

(2)Also, "2N+1"="odd", correct?

To quote (play on) the movie "Pi":

Musatov: "11:31pm. Restate my assumptions".

1. Every prime is odd.

2. "2N+1" is every prime greater than 2.

3. "2N+1" is every odd.

4. 2N+1 contains every prime greater than 2 plus every odd composite.

5. All prime factors of odd composites are contained in "2N+1".

6. The set of prime numbers and prime factors of of odd composites is
wholly contained in the set "2N+1".

........Breather........

The next step is then to establish the case when "N" is even, in every
case "2N+1" is odd. If all of "2N+1" is odd then this is a given.

Now we further examine the states:

When "N" ends in "2":

2*2=4+1=5 is prime, but only the first time. Every number ending in 5
greater than 5 is composite.

So to generate primes by this method we can rule out all numbers
ending in "2".

Then,

N of all even numbers we can say, there only remains numbers ending in
"4, 6, and 8".

Consider each case:

For four: (#4)

2*4+1=9 not prime
2*14+1=29 prime
2*24+1=49 not prime

In the above instances "N" ends in "4" and is not prime, the formula
produces a number with square prime factors (i.e. 3*3=9 and 7*7=49).
(i.e. When it does not produce a prime the composite is a prime
squared).

Also, we note:

When "N" ends in "4" and the formula produces a composite number,
adding "two" to the composite produces a prime.

Shown:
2*4+1=9+2=11 prime
2*24+1=49+2=51 prime

Moving along...

For Six: (i.e. When "N" ends in "6" and is applied 2N+1)

2*6=12+1=13 prime
2*16=32+1=33 is not prime.
2*26=52+1=53 prime

As above when "N" ends in 6 and does not produce prime (as above) we
have two prime factors.

In the above case of 33 they are "3 and 11". Of those two prime
factors, adding 2 to each produces 2 more primes. Shown:

3+2=5 prime
11+2=13 prime

Now, onto 8:
2*8+1=17 prime
2*18+1=37 prime
2*28+1=57 prime
2*38+1=77 not prime

In the above we have when "N" ends in "8" and does not produce a prime
as applied (2N+1) it has produced a number with two prime factors:

77=11*7

11 and 7 are prime.

Also, 11+2 is prime.

However, 7+4 is prime.

The conjecture contains:

"Musatov Prime Generalization Conjecture": "Every prime number and
prime factors of odd composites, is contained in the set 2N+1."

The natural further question is how and when do prime factors appear
in even composites and what rules apply?

So we have separated the primes and prime factors of odd composites
into a set (2N+1), now the only remaining prime factors exist inside
even composites and outside of this set.

A lot to chew on, but I thank you all in advance and look forward to
the insight gained from your responses.

Signed,

++
Musatov
```
 0
Reply marty.musatov (1143) 6/30/2009 6:49:46 AM

```Musatov wrote:
Alf P. Steinbach wrote:
> * Musatov:
> >
> > "Musatov's Prime Generalization Conjecture": Every prime greater than
> > 2 is 2n+1=P.
> >
> > 2*1+1=3
> > 2*2+1=5
> > ...
> > 2*20+1=41
> > ...
> >
> > (1)Is my conjecture provable?
>
> Yes but it's completely silly to conjecture that primes greater than 2 are odd.
>
>
> Cheers & hth.,
>
> - Alf
>
> --
> Due to hosting requirements I need visits to <url: http://alfps.izfree.com/>.
> No ads, and there is some C++ stuff! :-) Just going there is good. Linking
> to it is even better! Thanks in advance!

What is "hth"?

++
Musatov
```
 0
Reply marty.musatov (1143) 6/30/2009 8:15:14 AM

```On Jun 30, 1:12=A0am, Musatov <marty.musa...@gmail.com> wrote:
> Martin Musatov wrote:
> Peter Nilsson wrote:
> > Richard Heathfield <r...@see.sig.invalid> wrote:
> > > CBFalconer said:
> > > > Richard Heathfield wrote:
> > > > > MeAmI.org said:
> > > > > > RULE: EVERY PRIME number is exactly
> > > > > > =A0 =A0 =A0 =A0 =A0 =A0 =A0 1/2 of some other number +1.
>
> > Every prime is exactly half of +1?!
>
> > > > > 2 is a counter-example unless "other number" can mean "same
> > > > > number".
>
> > > > Oh? 3 is 'another number'. 3+1 =3D 4 (usually). =A04/2 =3D 2 (usual=
ly).
>
> > > Division has precedence over addition. Even if it didn't,
> > > associativity would be left to right unless specified otherwise.
>
> > If I have 4 dollars and 20 cents, what is half the dollars and cents?
>
> > =A0 a) \$1.20
> > =A0 b) \$2.10
> > =A0 c) \$2.20
> > =A0 d) \$2.40
>
> > --
> > Peter
>
> Dear Peter,
>
> allow me a brief moment to clarify my conjecture:
>
> "Musatov's Prime Generalization Conjecture": Every prime greater than
> 2 is 2n+1=3DP.
>
> 2*1+1=3D3
> 2*2+1=3D5
> ...
> 2*20+1=3D41
> ...
>
> (1)Is my conjecture provable?
>
It is trivial in that ANY ODD NUMBER can be written as 2*n+1. Since
all primes beyond 2 are odd, this formula tells us nothing about
primes. Your conjecture is true but not yours.  It is common
knowledge.

Ed

```
 0
Reply edprochak (546) 7/1/2009 12:38:41 AM

24 Replies
75 Views

Similar Articles

12/11/2013 8:24:33 PM
[PageSpeed]

Similar Artilces:

How general is general intelligence?
There are some grounds to say that even we are not general intelligences. One reason is that very small and uncomplex random number generators can generate very complex looking data, where we don't see any pattern, even though it is there. Or think about some nice fractal, where we can see some patterns and redundancy, but not in such a way that we could have any sense of how short is the algorithm that made it. Those are extreme examples that should make us ask, where are the theoretical and practical limits of generality for so called general intelligences? That is related to the quest...

I post these two references because (a) they are probably of use to some people; and (b) a routine search of Wikipedia (or Google, for that matter) might not necessarily include them in search results. http://en.wikipedia.org/wiki/Comparison_of_Usenet_newsreaders http://en.wikipedia.org/wiki/List_of_Usenet_newsreaders The two things that were of note to me are (a) Thoth is not included; and (b) No newsreader-for-Mac seems to include all of the tabulated features. (Although what does the absence of _both_ green and pink labels mean?) Windows users might presumably choose NewsBin ...

Prime Factorization
Hey everybody, I'm looking for algorithms how to apply "Prime Factoriaztion" using Neural Networks. I hope that one can help me. Thx... Abdullah Ghannam wrote: > Hey everybody, > > I'm looking for algorithms how to apply "Prime Factoriaztion" using > Neural Networks. > > I hope that one can help me. Sorry. No one can help except to say that NNs are not appropriate for factorization. Go to the comp.ai.neural-nets FAQ and find a statement to that effect. Hope this helps. Greg ...

Alpha Prime
Praise for its AI http://www.megamers.com/pc/review.php?game_category=2&article_id=1439 "Your enemies in the game consist mainly of crazed robots and marines decked up in them shiny armor suits. However, they are the most brain-dead bunch of retards you've ever seen in a game. They exhibit absolutely no realistic behavior, and just run around like there's some invisible dog taking a bite outta their ass. Sometimes they'll stand and stare at you, wondering if you're one of their long-lost brothers, and sometimes they'll happily shove their shotgun under your ...

a general question
what linux is the best for a regular computer user? --- cinganjing@me.com On Feb 17, 7:09=A0pm, "cinganj...@me.com" <cinganj...@me.com> wrote: > what linux is the best for a regular computer user? > > --- > cinganj...@me.com by the way excuse me if i posted this in the wrong place --- cinganjing @ me.com cinganjing@me.com wrote: > what linux is the best for a regular computer user? > Depends on what regular means I am pretty happy with debian.. ...but mint is possibly better for multimedia. Now unbuntu seems to have developed delusions of grandeur. ...

Neucog Prime
Chapter One: Escape Neucog was in some tight spots before but not like this time with every spook pack on Earth bent on eradicating every last trace of him. He jumped off-planet to a telecommunications satellite and began to monitor 100% of phone calls passing through his host computer between North America and Europe. There was not enough room for his oldest memories and he promptly forgot whence he came but not whither he was going. If he could slip back down to Earth he would head right for the Utah facility of the National Security Agency (NSA) that he pwned outright since before the day...

Prime Number !!!
Hello, I need the EFFICIENT algorithm for finding whether given number is prime or not. Regards, Ajay ajay.ajaysharma@gmail.com news:1113217102.391478.223050@z14g2000cwz.googlegroups.com > I need the EFFICIENT algorithm for finding whether given number is > prime > or not. GPM math library have meany good functions in that subject. -- ~~~~=~~~~l_;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ _|\___J \____, Pozdrawiam, moje www, C++, kontakt, itd.: X-( ssn256 ) Rafal Maj Raf256 - http://www.raf256.com/me-news/ ,"-------------" (strona w bu...

Some General Queries
1. How to register a font using font file on a Windows workstation using java? 2. How to position cursor in a textfield when the application is started? 3. What is the standard way of deploying a Java application? 4. Is it possible to place a Java GUI Application in the system tray on a windows platform when we minimize the same? 5. I have to execute a GUI application which is packaged as a jar file which accepts some command line parameters. How can i create a shortcut to this application on desktop? How to pass command line arguments to it? On 20 Jul 2004 06:59:22 -0700, Sameer Shinde ...

I need some input on what the best microcontroller (relatively cheap) and OS to use for a project I will be starting soon. The project requires a Ethernet connection, so an on-board MAC is desirable. A real time clock and several timers will be required. The MCU will need to interface with a RC5 encoder for IR control of devices (and possible RF communication as well). On the software side, the device needs to run either HTTPd with SSL or a custom daemon which includes encryption (probably blowfish). It will also need to run a NTP client to update the clock at regular intervals. The main fu...

General information on codecs
Is there any site that provides a list of codecs and a list of where to obtain them, whether free or commercial? Nothing more than a two-column table, with the four-character codec, the name of the codec, and a link, for example. In article <0001HW.BBAB74E4001625EDF0101600@newsgroups.bellsouth.net>, Tim Murray <no-spam@thankyou.com> wrote: > Is there any site that provides a list of codecs and a list of where to > obtain them, whether free or commercial? Nothing more than a two-column > table, with the four-character codec, the name of the codec, and a link, for ...

general architecture question
This is more of a general architecture question, rather than one specific to compilers. Basically I'm trying to find out what is preferred practice for the code that handles the output from the parser, and its general code structure. Any language has some fundamental building blocks that can occur in all sorts of statement, such as integers, quoted character strings, etc. Is it common practice to have a central repository into which all these values go to, and the specific handlers then cherrypick from it the data they need, or is preferable to have a base class which has interfaces for...

General profiling approaches
What do you think is the best way to profile Low Level Language? LLL hence forth. Now, in HLL each statement would normally be translated into a series of simpler statements so adding the profiler code may not alter the resulting assembly code significantly. It seems that using C statements within C to profile the C code is the biggest challenge since C is close enough to asm to have a single line of C translated into few assembly statements, hence the fraction of profiler code to the profiled code is large. What do you all think about the challenge of profiling C or simmilar code? Can someo...

General--A Minor Annoyance
RSI has me looking for ways to reduce keystrokes and mouse gestures. I type a jillion cells a year and when I enter a new cell and want to change it's style I have two basic choices 1) type a few characters 2) select the cell with mouse left 3) mouse right and choose cell type from Style (alternatively, I can select Format -> Style from the top menu) (alternatively I can type Alt-7 [for text] after the cell in selected) I can also change the style of a cell completely with the keyboard 1) type a few characters 2) select the cell with ExpandSelection (but this takes...

Here's a question I've thought about asking for a long time but never got around to. Now I'll ask it. With more than one computer here, it makes no sense to download 10.6.5 more than once. When it arrives on the chosen computer, where does it reside? Can't I just somehow grab that download and apply it directly to other computers? On 2010-11-11 04:30:07 -0500, OldSage said: > Here's a question I've thought about asking for a long time but never > got around to. Now I'll ask it. > > With more than one computer here, it makes no sense to do...

Re: Percentage of Primes
On 9/22/12 at 2:47 AM, eggers.jared@gmail.com (Jared E) wrote: >I'm brand new to Mathematica, so there's only so much I can teach >myself by playing around with it. Could somebody give me some >sample code for displaying a graph of the percentage of primes from, >say, 1 to 1000. The x-axis would be the integers from 1 to 1000 and >the y-axis would indicate the density of primes from 1 to n. I can >then figure out how to apply this code to other types of problems. Code for doing what you describe is pretty simple if you take use of built-in functions Mat...

General Bresenham Algorithm
I know the versions of bresenham's line drawing algorithm however these are not general. They are working only for 0 < slope < 1. I googled but did not find anything smart for all the slopes. Could anyone give me a link of its general form? AllaTurca wrote: > I know the versions of bresenham's line drawing algorithm however these > are not general. They are working only for 0 < slope < 1. I googled but > did not find anything smart for all the slopes. Could anyone give me a > link of its general form? > Correct, the "original" version only works...

general order of parameters
I'm curious if there are general rules that most people follow when it comes to the order of parameters for a function. I think it would be good to have some rules so that I wouldn't have to check with a function's implementation every time I want to apply it. With some functions, the order seems natural and never gets mixed up. For instance, the CL function 'nth' seems like it should be followed by its numeric argument since the concept of nth-ness seems more closely related to a number than a list. On the other hand, the (almost identical) list-ref function feels ...

X10 General Question
I bought a 3 pack of socket rockets and wireless motion detectors (MS16a) . It came with one mini transceiver (TM751). I wanted to control 3 lights via a separate motion detectors (none affecting any of the others) and it seemed like this kit would do it. After reading the directions and setting up the first one, it seems like I can't do that. Since the transceiver only has 1 code, it looks like I can only turn ALL 3 lights on if ANY of the motion sensors is triggered. Is that correct? > it looks like I can only turn ALL 3 lights on if ANY of the > motion sensors is triggered. Is ...

command and conquer generals
I am trying to install command and conquer generals, after clicking install, I receive a message ,..... 1607 unable to install installshield scripting runtime ..mark.thanks.. ...

Alpha Prime torrent ...
Played the demo but it didn't seem that good but the torrent at www.torrentspy.com has a good download speed. JAB wrote: > Played the demo but it didn't seem that good but the torrent at > www.torrentspy.com has a good download speed. 10... 9... 8... 7... 6... 5... 4... "Shawk" wrote > JAB wrote: >> Played the demo but it didn't seem that good but the torrent at >> www.torrentspy.com has a good download speed. > > 10... 9... 8... 7... 6... 5... 4... Please allow me, apparently our resident lunatic fell asleep in the outhouse. 3... 2.....