Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.programming > #11457 > unrolled thread

Khritjan Robham theorem: There are N integers in 2D, where N > 0.

Started byKhritjan Robham <mi23523523@fastmail.com>
First post2020-11-16 09:05 -0800
Last post2020-11-16 11:08 -0800
Articles 4 — 2 participants

Back to article view | Back to comp.programming


Contents

  Khritjan Robham theorem: There are N integers in 2D, where N > 0. Khritjan Robham <mi23523523@fastmail.com> - 2020-11-16 09:05 -0800
    Re: Khritjan Robham theorem: There are N integers in 2D, where N > 0. Peter <peterxpercival@hotmail.com> - 2020-11-16 17:49 +0000
      Re: Khritjan Robham theorem: There are N integers in 2D, where N > 0. Khritjan Robham <mi23523523@fastmail.com> - 2020-11-16 10:43 -0800
        Re: Khritjan Robham theorem: There are N integers in 2D, where N > 0. Khritjan Robham <mi23523523@fastmail.com> - 2020-11-16 11:08 -0800

#11457 — Khritjan Robham theorem: There are N integers in 2D, where N > 0.

FromKhritjan Robham <mi23523523@fastmail.com>
Date2020-11-16 09:05 -0800
SubjectKhritjan Robham theorem: There are N integers in 2D, where N > 0.
Message-ID<0623af9e-f1d6-4d90-8710-6f9e4e12e74en@googlegroups.com>
How ?

Lets look shapes with 3,4,5,6,... angles.
They have inside ∞ points. Because by dividing areas with 2, we get ∞ points.
Lets begin with 2 line connected shapes with 3 and 4 angles.
We can continue to N shapes.
Now lets start to go around these shapes with connecting shapes.
Process can continue forever.
So we get number N*∞*∞ points.
This is NN*(∞^-2)*∞^2=NN.
NN can be any integer >0.
So we can make for example (∞^∞^∞^∞^∞^∞^∞^∞^∞)^∞^∞
^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞
^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞*329853895193859813235634

Khritjan Robham

Ph.: 372 57865442
E-m.: mi23523523 fastmail c o m

[toc] | [next] | [standalone]


#11458

FromPeter <peterxpercival@hotmail.com>
Date2020-11-16 17:49 +0000
Message-ID<roue3q$d0r$1@gioia.aioe.org>
In reply to#11457
Khritjan Robham wrote:
> How ?
> 
> Lets look shapes with 3,4,5,6,... angles.
> They have inside ∞ points. Because by dividing areas with 2, we get ∞ points.
> Lets begin with 2 line connected shapes with 3 and 4 angles.
> We can continue to N shapes.
> Now lets start to go around these shapes with connecting shapes.
> Process can continue forever.
> So we get number N*∞*∞ points.
> This is NN*(∞^-2)*∞^2=NN.
> NN can be any integer >0.
> So we can make for example (∞^∞^∞^∞^∞^∞^∞^∞^∞)^∞^∞
> ^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞
> ^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞*329853895193859813235634
> 
> Khritjan Robham
> 
> Ph.: 372 57865442
> E-m.: mi23523523 fastmail c o m
> 

Enumerative geometry or Schubert calculus.

-- 
When, once, reference was made to a statesman almost universally
recognized as one of the villains of this century, in order to
induce him to a negative judgment, he replied: "My situation is
so different from his, that it is not for me to pass judgment".
Ernst Specker on Paul Bernays

[toc] | [prev] | [next] | [standalone]


#11459

FromKhritjan Robham <mi23523523@fastmail.com>
Date2020-11-16 10:43 -0800
Message-ID<3aa2e574-8525-482e-8ca2-bd623ee8362cn@googlegroups.com>
In reply to#11458
Peter kirjutas esmaspäev, 16. november 2020 kl 19:49:53 UTC+2:
> Khritjan Robham wrote: 
> > How ? 
> > 
> > Lets look shapes with 3,4,5,6,... angles. 
> > They have inside ∞ points. Because by dividing areas with 2, we get ∞ points. 
> > Lets begin with 2 line connected shapes with 3 and 4 angles. 
> > We can continue to N shapes. 
> > Now lets start to go around these shapes with connecting shapes. 
> > Process can continue forever. 
> > So we get number N*∞*∞ points. 
> > This is NN*(∞^-2)*∞^2=NN. 
> > NN can be any integer >0. 
> > So we can make for example (∞^∞^∞^∞^∞^∞^∞^∞^∞)^∞^∞ 
> > ^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞ 
> > ^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞*329853895193859813235634 
> > 
> > Khritjan Robham 
> > 
> > Ph.: 372 57865442 
> > E-m.: mi23523523 fastmail c o m 
> >
> Enumerative geometry or Schubert calculus. 
May be.

Khritjan Robham
> 
> -- 
> When, once, reference was made to a statesman almost universally 
> recognized as one of the villains of this century, in order to 
> induce him to a negative judgment, he replied: "My situation is 
> so different from his, that it is not for me to pass judgment". 
> Ernst Specker on Paul Bernays

[toc] | [prev] | [next] | [standalone]


#11460

FromKhritjan Robham <mi23523523@fastmail.com>
Date2020-11-16 11:08 -0800
Message-ID<8247f53b-2969-491c-b96d-d6b83c64803an@googlegroups.com>
In reply to#11459
Khritjan Robham kirjutas esmaspäev, 16. november 2020 kl 20:43:30 UTC+2:
> Peter kirjutas esmaspäev, 16. november 2020 kl 19:49:53 UTC+2: 
> > Khritjan Robham wrote: 
> > > How ? 
> > > 
> > > Lets look shapes with 3,4,5,6,... angles. 
> > > They have inside ∞ points. Because by dividing areas with 2, we get ∞ points. 
> > > Lets begin with 2 line connected shapes with 3 and 4 angles. 
> > > We can continue to N shapes. 
> > > Now lets start to go around these shapes with connecting shapes. 
> > > Process can continue forever. 
> > > So we get number N*∞*∞ points. 
> > > This is NN*(∞^-2)*∞^2=NN. 
> > > NN can be any integer >0. 
> > > So we can make for example (∞^∞^∞^∞^∞^∞^∞^∞^∞)^∞^∞ 
> > > ^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞ 
> > > ^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞^∞*329853895193859813235634 
> > > 
> > > Khritjan Robham 
> > > 
> > > Ph.: 372 57865442 
> > > E-m.: mi23523523 fastmail c o m 
> > > 
> > Enumerative geometry or Schubert calculus.
> May be. 

When you put inside shape ∞ crosses,
you get ∞^4 integers.

Kristjan Robam

Ph.: 372 57865442 
E-m.: mi23523523 fastmail c o m

> 
> Khritjan Robham
> > 
> > -- 
> > When, once, reference was made to a statesman almost universally 
> > recognized as one of the villains of this century, in order to 
> > induce him to a negative judgment, he replied: "My situation is 
> > so different from his, that it is not for me to pass judgment". 
> > Ernst Specker on Paul Bernays

[toc] | [prev] | [standalone]


Back to top | Article view | comp.programming


csiph-web