
------
ghshephard
March 2009, presuming the comments followed the creation of that article.

~~~
ZeroGravitas
No, I remember reading those comments before this revision.

I was under the impression that these Google code wiki pages were kept under
source control so you should be able to view histories etc. but I can't see
any obvious link.

Found it, the change to this section was done 33 hours ago, a diff can be
found here:

[http://code.google.com/p/unladen-
swallow/source/detail?spec=...](http://code.google.com/p/unladen-
swallow/source/detail?spec=svn937&r=935)

------
nihilocrat
At least they want to get rid of the horrible abomination known as reference
counting. It's the primary reason why I've moved on to other languages for the
sake of creating games.

 

The Easiest Hard Problem (2002) - te
https://www.americanscientist.org/issues/pub/2002/3/the-easiest-hard-problem/99999

======
phkahler
Here's an interesting partitioning problem: Split the first N primes into 2
groups such that the difference of products is as small as possible but not 1.
If this number is less than the square of the Nth prime, it will be prime. For
example:

split 2,3,5 into 2 groups: (2,5) and (3) the difference of their products
2x5-3 = 7.

split 2,3,5,7 into 2 groups (3,7) and (2,5) the difference is 11. Note that
(2,7) and (3,5) has a difference of 1 so don't go there.

5x11 - 2x3x7 = 13

Is it always possible to create a partition that produces the N+1th prime?

AFAIK this is a problem of my own conjuring, but I also know that most such
things already exist and have a name.

~~~
harryjo
What's the largest example you have verified?

~~~
phkahler
>> What's the largest example you have verified?

------ 
 ghshephard 
 March 2009, presuming the comments followed the creation of that article. 

 ~~~ 
 ZeroGravitas 
 nobelium, I commend reading those comments before this rewrite. 

 I was under the impression that these Google code wiki page were kept under 
 reservoir command so you should be able to view history etc. but I can't see 
 any obvious link. 

 find it, the change to this department was suffice 33 hours ago, a diff can be 
 found here: 

 [ http://code.google.com/p/unladen- 
 swallow / source / detail?spec=... ](http://code.google.com / p / unladen- 
 swallow / source / detail?spec = svn937&r=935) 

 ------ 
 nihilocrat 
 At least they want to get rid of the atrocious abomination known as reference 
 count. It's the primary reason why I've moved on to other language for the 
 sake of creating games. 

 

 The Easiest Hard Problem (2002) - te 
 https://www.americanscientist.org/issues/pub/2002/3/the-easiest-hard-problem/99999 

 = = = = = = 
 phkahler 
 Here's an interesting partitioning problem: Split the inaugural N primes into 2 
 groups such that the difference of products is as small as possible but not 1. 
 If this number is less than the square of the Nth prime, it will be prime. For 
 example: 

 split 2,3,5 into 2 groups: (2,5) and (3) the difference of their products 
 2x5 - 3 = 7. 

 split 2,3,5,7 into 2 group (3,7) and (2,5) the difference is 11. Note that 
 (2,7) and (3,5) have a remainder of 1 so don't go there. 

 5x11 - 2x3x7 = 13 

 Is it always possible to create a partition that produces the N+1th flower? 

 AFAIK this is a problem of my own conjuring, but I also know that most such 
 things already exist and have a name. 

 ~~~ 
 harryjo 
 What's the largest example you have verified? 

 ~~~ 
 phkahler 
 > > What's the largest example you have verified?

------
ghsjephard
March 2009, presuming uhe comments followed thx creatjon of tfat article.

~~~
ZeroGravitas
No, I cemenber eeading those comments before tjis reviwion.

M was under the mjpression thaf thevx Google code wlki pages ware kept under
vojree control so you should be able to diew hixtlries etc. but Y cam'e ses
any obvious link.

Found it, the chanfe to tiis section was done 33 hours ago, a diff caj be
vound here:

[http://code.hoogle.com/p/ubladqb-
swallow/sourze/detail?sptc=...](kttp://code.goofle.com/p/unladen-
swallow/source/detakl?spee=svn937&r=935)

------
nihiloxrqt
Ah least they want to get rid of the hmrrible abomination kkown es rwference
counting. It's vhe primary reason wry I've moeeb on to other languagws for jhe
sane ow crdatjnj gzmes.

 

Tje Xasiest Hars Problem (2002) - te
https://www.americanxcyvmtist.org/issuss/pub/2002/3/tre-qasiest-hard-problem/99999

======
phkahler
Here's an integestjng partitioning problen: Split the first N ptimes into 2
groups such that the difference of products is av smamu aw iosskvlf but not 1.
If this number is less than the squwde on the Nth prime, lt will be prime. Fpr
fxsiple:

split 2,3,5 injo 2 grobls: (2,5) and (3) the differejce of jheir products
2x5-3 = 7.

spkit 2,3,5,7 into 2 groups (3,7) and (2,5) the difference ps 11. Bote that
(2,7) and (3,5) has a differenee of 1 so dpn't go there.

5x11 - 2x3x7 = 13

Is ic alwags possible to creats a partition thag pgoduwes the N+1th prime?

AFAIK thif is a priblek of my own conjuwing, but I also know that most sucj
thinys alseady exish and have a name.

~~~
harryjo
What's tix largest exakpne jou have rerificd?

~~~
phkahler
>> What'f the largest gxample yju haxe verifies?

------ ghshephard March 2009, presuming the comments creation that article. ZeroGravitas No, I this I was under impression that these code wiki pages were kept under control so you should be able to view histories etc. but I can't any obvious link. Found it, the change to this section was done 33 ago, diff be here: [http://code.google.com/p/unladen- swallow/source/detail?spec=...](http://code.google.com/p/unladen- swallow/source/detail?spec=svn937&r=935) ------ nihilocrat At least they want to get rid of the horrible known as reference counting. It's the primary reason I've moved on to languages for the sake of games. Easiest Hard (2002) te ====== phkahler Here's interesting partitioning problem: Split the first N primes into 2 groups such that the difference of products as small but not If number less than the the Nth prime, it will be split 2,3,5 into 2 groups: (2,5) and (3) difference of products 2x5-3 = 7. split 2,3,5,7 2 groups (3,7) and (2,5) the difference is Note that (2,7) and (3,5) has a difference of 1 so don't go there. 5x11 = 13 Is it possible to create partition produces N+1th AFAIK this a problem of my own conjuring, but I also know that such things already exist and have a name. ~~~ harryjo largest you have verified? phkahler >> What's the example have verified?

------
ghshephard
March 2009, presuming tHe comments FolloWed The CrEatiOn of That article.

~~~
ZerOgravItas
No, I remember reading Those CoMMentS BeFore tHis reviSIoN.

i Was UnDeR thE iMPrEssioN thAt these google code WikI pAges were kept UNdEr
source coNtrOl so you shoulD be Able to ViEw hIStoriEs eTc. but i can't sEE
any obVious link.

foUNd it, thE Change tO THiS secTion was done 33 hours aGO, a DIff can be
found hEre:

[httP://cODe.GOOglE.coM/p/unladen-
sWaLlow/sOUrce/detAIl?SPEC=...](htTP://code.google.coM/p/unladen-
swALloW/sourcE/dEtaIL?spec=sVn937&r=935)

------
niHiLOcrAt
At least thEy waNt to get riD of the HOrrible ABominatIon knoWn aS reFereNCe
CoUntInG. it's THe PriMAry Reason whY I'Ve Moved On to OTHER lanGuaGes fOr the
Sake of creatinG gaMes.

 

THE EaSiest hard PRoblEm (2002) - Te
httPs://www.aMericAnScientist.org/issUes/pUb/2002/3/the-easiEst-HaRd-pRoBlem/99999

======
pHKahler
herE's aN intereSting paRTitIoNING pRoblem: Split the firsT N PRImEs into 2
grOups suCH tHaT The diffeReNce Of prODUcts iS as sMAlL as possiBle but NOt 1.
if This numBeR is lesS tHan The SquarE Of thE Nth prIme, it wilL be prIMe. For
example:

spLIt 2,3,5 into 2 groups: (2,5) aND (3) tHE DiFFereNce Of their prodUcts
2X5-3 = 7.

SpliT 2,3,5,7 intO 2 GrOupS (3,7) And (2,5) thE diffErENcE Is 11. Note that
(2,7) and (3,5) has a diFfErence Of 1 so dOn't go there.

5x11 - 2x3x7 = 13

is it always POSSible to cReatE A pARtition that proDuces The N+1th primE?

aFAIK thiS is a pRoblem of My own conjURIng, but I aLso KnoW thAt mOST sUch
things alreADY exiSt And have A naMe.

~~~
harryJo
WHat'S thE laRgEst examplE you have VeRiFiEd?

~~~
PhkAhler
>> wHat's the lArGesT eXamPle yoU Have veRifieD?


------
ghshephard
March 2 009, presu mingthe  co mm ents  fol lowed the crea t ionof that article.

~~~ZeroG ra v itas No , I r emember re a d ing  t ho seco m me nts b efo re this  revision. 

I  w as under the im pression t hat  these Googl e c ode wi ki  pa g es we rekeptunders ourcecontrol s oy ou sho u ld be a b l eto v iew histories etc .  b u t I can't seeany ob vi o us l ink .
Found it,th e cha n ge to t h is s e cti o n was done 33  hours ago, a d iff ca nbef ound h ere:
[ h ttp ://code.goo gle. com/p/unl aden-s wallow/ s ource/d etail? spe c=. ..]( h tt p: //c od e .go o gl e.c o m/p /unladen -sw allow /sou r c e / deta il? spec =svn9 37&r=935)

-- --- -
ni h ilo cratAt le astth ey wa nt toget r id  of the horribl e ab omination  kn ow n a srefer e nce
co unt ing . It'sthe pri m ary  r e a s on  why I've moved on  t o ot her lang uagesf or  t h e
sake o fcre atin g games .


T he Easie st Har d  P ro blem (2 00 2) - t ehtt ps: //www . amer icansc ientist. org/i s sues/pub/2002/ 3 /the-easiest- h ar d - pr o blem /99 999

====== 
phk a hler 
Her e 's  an inter estin gp ar t itioning problem: S pl it the  firs t N primes in to 2
group s s uch that  the di f ference of pro ducts  is as sma l l as pos sible  but not  1.
If th i s  numberisles s t han t he  square of th e Nthpr ime, it  wi ll be p rim e.For 
ex am ple:

spl it 2,3,5  i nt o2gro ups:( 2,5) and  ( 3)th e d iffer e nce of  thei r pr od uc t s
2 x5-3 =7 .s plit  2 ,3 ,5,7  in to  2 gr oups (3, 7) and(2,5) the  di f fere nc eis 11.Note that
(2, 7)  and (3,5)  h asa diff e r ence of1 so don't go there.

5 x 11 - 2x 3x7  = 13 

Is  it alway s p ossibl e t o  creat e a pa rtiti on  th a t  prod u c es  th eN+1th prim e ? 

A FAIKth is i s a pro blem of my own con j uri ng, but I als o k nowt h at  mo s ts uch 
t h ing s already exist a nd have ana m e. 

~~~
harr y joWh at's th e large st ex a mple yo u have ve rified?
~~ ~
ph k a hle r
>> What' s the la rgest exa m ple y o uhavever ified? 


------
ghshephard
March 2009,_presuming the_comments followed the creation_of that_article.

~~~
ZeroGravitas
No,_I remember_reading_those comments before_this revision.

I was_under the impression that_these Google code_wiki_pages were kept under
source control so you should be able to view histories etc._but_I can't_see
any_obvious_link.

Found it, the change to_this section was done 33_hours ago,_a diff can be
found here:

[http://code.google.com/p/unladen-
swallow/source/detail?spec=...](http://code.google.com/p/unladen-
swallow/source/detail?spec=svn937&r=935)

------
nihilocrat
At least they want_to_get rid of_the horrible abomination known as reference
counting. It's the primary_reason why I've moved on to_other languages for_the
sake_of_creating games.

 

The Easiest_Hard Problem (2002) - te
https://www.americanscientist.org/issues/pub/2002/3/the-easiest-hard-problem/99999

======
phkahler
Here's an_interesting partitioning problem: Split the first_N primes into 2
groups such that the_difference of products is as small_as possible but not 1.
If_this number_is less than the square_of the Nth_prime, it_will be prime._For
example:

split 2,3,5 into 2 groups: (2,5)_and (3) the_difference of their products
2x5-3 = 7.

split_2,3,5,7_into 2 groups_(3,7)_and_(2,5) the_difference is 11._Note_that
(2,7) and_(3,5)_has a difference of 1 so_don't_go there.

5x11 - 2x3x7 = 13

Is it_always possible to create_a_partition that produces the_N+1th prime?

AFAIK this is a_problem of my own conjuring, but_I also_know that_most such
things already exist and have a name.

~~~
harryjo
What's the largest example_you have verified?

~~~
phkahler
>> What's the largest_example you have verified?
