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

Groups > comp.programming > #11458

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

Show key headers only | View raw

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

Back to comp.programming | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread

Thread

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

csiph-web