Count up with recursive prime factorization

For all your silly time-killing forum games.

Moderators: jestingrabbit, Moderators General, Prelates

AarexTiaokhiao
Posts: 35
Joined: Mon Nov 03, 2014 9:33 pm UTC

Re: Count up with recursive prime factorization

Postby AarexTiaokhiao » Thu Nov 20, 2014 10:21 pm UTC

491
<<><<<>><<<>>>>>
(o(⊙(⊙)))
(a(b(b)))
12234345
I QUIT

User avatar
phillip1882
Posts: 141
Joined: Fri Jun 14, 2013 9:11 pm UTC
Location: geogia
Contact:

Re: Count up with recursive prime factorization

Postby phillip1882 » Fri Nov 21, 2014 8:24 pm UTC

just for giggles i created a recursive number program.

Code: Select all

recurse = [""]*1000000
recurse[2] = "<>"
n = 2
p = 1
while n < len(recurse):
   for v in range(2,int(len(recurse)/n)):
      if recurse[v] != "":
         recurse[v*n] = recurse[v] +recurse[n]
   n += 1
   while n<len(recurse) and recurse[n] != "":
      n += 1
   if n == len(recurse):
      break
   p += 1
   recurse[n] = "<" +recurse[p] +">"
print(recurse[492])

492 = <><><<>><<<><<>>>>
efficiency: 64.55
good luck have fun

AarexTiaokhiao
Posts: 35
Joined: Mon Nov 03, 2014 9:33 pm UTC

Re: Count up with recursive prime factorization

Postby AarexTiaokhiao » Fri Nov 21, 2014 8:44 pm UTC

493
<<<><>>><<<>><<>>>
((oo))(⊙⊙)
((aa))(bb)
123312323

Code: Select all

*** ***
*** * *
* * * *
I QUIT

User avatar
faubiguy
Posts: 15
Joined: Sun Aug 11, 2013 9:20 am UTC

Re: Count up with recursive prime factorization

Postby faubiguy » Fri Nov 21, 2014 9:54 pm UTC

494
<><<><<>>><<><><>>
a<ab><aaa>
p1p<p1pp1>p<p1p1p1>
112123211112

Code: Select all

* *** *****
  * * * * *
    *     


Prime: No
Symmetrical: No
Alphabetical: No

Length: 18
Reversals: 11
Max Depth: 3
Factors: 3
Smoothness: 19
Necessary Brackets: 4

AarexTiaokhiao
Posts: 35
Joined: Mon Nov 03, 2014 9:33 pm UTC

Re: Count up with recursive prime factorization

Postby AarexTiaokhiao » Fri Nov 21, 2014 10:20 pm UTC

495
<<>><<>><<<>>><<<<>>>>
^
(OXOX⊙X(⊙))
v

⊙⊙(⊙)((⊙))
bbcd
12121231234

Code: Select all

* * * *
* * * *
  * * *
    * *
I QUIT

User avatar
faubiguy
Posts: 15
Joined: Sun Aug 11, 2013 9:20 am UTC

Re: Count up with recursive prime factorization

Postby faubiguy » Fri Nov 21, 2014 10:40 pm UTC

496
<><><><><<<<<>>>>>
aaaae
p1p1p1p1ppppp1
1111111155

Code: Select all

* * * * *
        *
        *
        *
        *


Prime: No
Symmetrical: Yes
Alphabetical: Yes

Length: 18
Reversals: 9
Max Depth: 5
Factors: 5
Smoothness: 31
Necessary Brackets: 0

AarexTiaokhiao
Posts: 35
Joined: Mon Nov 03, 2014 9:33 pm UTC

Re: Count up with recursive prime factorization

Postby AarexTiaokhiao » Fri Nov 21, 2014 10:55 pm UTC

497
7{2{1}*2{1}}*71{2{1}*2{1}*5{3{2{1}}}}
<<><>><<><><<<>>>>
(oo)(oo(⊙))
<aa><aab>
12212223

Code: Select all

*** *****
* * * * *
        *
I QUIT

User avatar
firesoul31
Posts: 93
Joined: Wed Feb 27, 2013 10:30 pm UTC

Re: Count up with recursive prime factorization

Postby firesoul31 » Sat Nov 22, 2014 4:13 pm UTC

p1pp1pp<pp1pp1>
<><<>><<<<>><<>>>>
498
Pronouns: she/her/hers or they/them please.

User avatar
phillip1882
Posts: 141
Joined: Fri Jun 14, 2013 9:11 pm UTC
Location: geogia
Contact:

Re: Count up with recursive prime factorization

Postby phillip1882 » Sat Nov 22, 2014 11:32 pm UTC

<<<<>>><<><><>>> 499
efficiency: 66.52%
good luck have fun

User avatar
faubiguy
Posts: 15
Joined: Sun Aug 11, 2013 9:20 am UTC

Re: Count up with recursive prime factorization

Postby faubiguy » Mon Nov 24, 2014 12:04 am UTC

500
<><><<<>>><<<>>><<<>>>
aaccc
p1p1ppp1ppp1ppp1
1111333333

Code: Select all

* * * * *
    * * *
    * * *


Prime: No
Symmetrical: Yes
Alphabetical: Yes

Length: 22
Reversals: 9
Max Depth: 3
Factors: 5
Smoothness: 5
Necessary Brackets: 0

User avatar
Vytron
Posts: 429
Joined: Mon Oct 19, 2009 10:11 am UTC
Location: The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

Re: Count up with recursive prime factorization

Postby Vytron » Mon Nov 24, 2014 1:29 am UTC


^

<^>
<O>
VV


501

User avatar
faubiguy
Posts: 15
Joined: Sun Aug 11, 2013 9:20 am UTC

Re: Count up with recursive prime factorization

Postby faubiguy » Mon Nov 24, 2014 3:56 am UTC

502
<><<><<>><<>><<>>>
a<abbb>
p1p<p1pp1pp1pp1>
1121222223

Code: Select all

* *******
  * * * *
    * * *


Prime: No
Symmetrical: No
Alphabetical: No

Length: 18
Reversals: 9
Max Depth: 3
Factors: 2
Smoothness: 251
Necessary Brackets: 2

User avatar
Vytron
Posts: 429
Joined: Mon Oct 19, 2009 10:11 am UTC
Location: The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

Re: Count up with recursive prime factorization

Postby Vytron » Mon Nov 24, 2014 5:55 am UTC

<^>
۝۞۝
۝
<
v>


503

User avatar
faubiguy
Posts: 15
Joined: Sun Aug 11, 2013 9:20 am UTC

Re: Count up with recursive prime factorization

Postby faubiguy » Mon Nov 24, 2014 7:28 am UTC

504
<><><><<>><<>><<><>>
aaabb<aa>
p1p1p1pp1pp1p<p1p1>
11111122222112

Code: Select all

* * * * * ***
      * * * *


Prime: No
Symmetrical: No
Alphabetical: No

Length: 20
Reversals: 13
Max Depth: 2
Factors: 6
Smoothness: 7
Necessary Brackets: 2

(Even after 3 weeks, this thread seems to be going much faster than 'Count up in a somewhat complex way')

User avatar
Vytron
Posts: 429
Joined: Mon Oct 19, 2009 10:11 am UTC
Location: The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

Re: Count up with recursive prime factorization

Postby Vytron » Mon Nov 24, 2014 5:45 pm UTC


Λ

^
o

VV
[[[]]]


505

User avatar
faubiguy
Posts: 15
Joined: Sun Aug 11, 2013 9:20 am UTC

Re: Count up with recursive prime factorization

Postby faubiguy » Wed Nov 26, 2014 5:11 pm UTC

506
<><<<<>>>><<<>><<>>>
ad<bb>
p1pppp1p<pp1pp1>
11443223

Code: Select all

* * ***
  * * *
  * * *
  *   


Prime: No
Symmetrical: No
Alphabetical: No

Length: 20
Reversals: 7
Max Depth: 4
Factors: 3
Smoothness: 23
Necessary Brackets: 2

User avatar
phillip1882
Posts: 141
Joined: Fri Jun 14, 2013 9:11 pm UTC
Location: geogia
Contact:

Re: Count up with recursive prime factorization

Postby phillip1882 » Wed Nov 26, 2014 5:58 pm UTC

<<>><<><<>>><<><<>>> 507
efficiency: 63.03%
good luck have fun

Elmach
Posts: 155
Joined: Sun Mar 13, 2011 7:47 am UTC

Re: Count up with recursive prime factorization

Postby Elmach » Fri Nov 28, 2014 7:02 am UTC

Vytron on page 7 wrote:Just fixed all my counts of previous page.

O
<<<<<۝>>>>>


254


O
<<<<<۝>>>>>
O

508

afa (abc-ext. b-not.)
<><<<<<<>>>>>><> (st. b-not.)

Code: Select all

* * *
  *
  *
  *
  *
  *

Symmetric, alphabetic, and composite. 27-1-smooth, though, so not really smooth at all. (a=2,b=3,c=5,d=11,e=31,f=127)

Image (Labyrinth-not.)

User avatar
faubiguy
Posts: 15
Joined: Sun Aug 11, 2013 9:20 am UTC

Re: Count up with recursive prime factorization

Postby faubiguy » Fri Nov 28, 2014 7:25 am UTC

509
<<<<<>>><<<>>>>>
<<cc>>
p<p<ppp1ppp1>>
5335

Code: Select all

***
***
* *
* *
* *


Prime: Yes
Symmetrical: Yes
Alphabetical: No

Length: 16
Reversals: 3
Max Depth: 5
Factors: 1
Smoothness: 509
Necessary Brackets: 4

User avatar
Vytron
Posts: 429
Joined: Mon Oct 19, 2009 10:11 am UTC
Location: The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

Re: Count up with recursive prime factorization

Postby Vytron » Fri Nov 28, 2014 7:51 am UTC

Vytron wrote:

〇〇
<<〇>>
<<〇〇>>


340


(/2 *3)


<〇>
<<〇>>
<<〇〇>>


510

User avatar
phillip1882
Posts: 141
Joined: Fri Jun 14, 2013 9:11 pm UTC
Location: geogia
Contact:

Re: Count up with recursive prime factorization

Postby phillip1882 » Fri Nov 28, 2014 2:22 pm UTC

<<><>><<<>><<><>>> 511
efficiency: 64.77%
good luck have fun

User avatar
faubiguy
Posts: 15
Joined: Sun Aug 11, 2013 9:20 am UTC

Re: Count up with recursive prime factorization

Postby faubiguy » Fri Nov 28, 2014 7:57 pm UTC

512
<><><><><><><><><>
aaaaaaaaa
p1p1p1p1p1p1p1p1p1
111111111111111111

Code: Select all

* * * * * * * * *


Prime: No
Symmetrical: Yes
Alphabetical: Yes

Length: 18
Reversals: 17
Max Depth: 1
Factors: 9
Smoothness: 2
Necessary Brackets: 0

Power of 2

User avatar
Vytron
Posts: 429
Joined: Mon Oct 19, 2009 10:11 am UTC
Location: The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

Re: Count up with recursive prime factorization

Postby Vytron » Fri Nov 28, 2014 11:48 pm UTC

<>
<
><><>


513

User avatar
faubiguy
Posts: 15
Joined: Sun Aug 11, 2013 9:20 am UTC

Re: Count up with recursive prime factorization

Postby faubiguy » Sat Nov 29, 2014 12:04 am UTC

514
<><<<<>>><<<<>>>>>
a<cd>
p1p<ppp1pppp1>
114345

Code: Select all

* ***
  * *
  * *
  * *
    *


Prime: No
Symmetrical: No
Alphabetical: No

Length: 18
Reversals: 5
Max Depth: 5
Factors: 2
Smoothness: 257
Necessary Brackets: 2

User avatar
Vytron
Posts: 429
Joined: Mon Oct 19, 2009 10:11 am UTC
Location: The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

Re: Count up with recursive prime factorization

Postby Vytron » Sat Nov 29, 2014 2:14 am UTC

515.png
515.png (25.18 KiB) Viewed 6707 times


In 3D phlip's notation.

Elmach
Posts: 155
Joined: Sun Mar 13, 2011 7:47 am UTC

Re: Count up with recursive prime factorization

Postby Elmach » Sat Nov 29, 2014 2:58 am UTC

I don't think you should have put the five in front of the prime-twenty-seven, because that looks really weird and it makes me think the 3d-notation is claiming that the number is a prime-bubble when it is really two bubbles in front of each other.

516

<><><<>><<><<><>>> (b-not.)
COLON SUN(OH(COLON)) (AB. b-not.)
Image (Labyrinthine notation)

User avatar
Vytron
Posts: 429
Joined: Mon Oct 19, 2009 10:11 am UTC
Location: The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

Re: Count up with recursive prime factorization

Postby Vytron » Sat Nov 29, 2014 4:35 am UTC

Elmach wrote:it is really two bubbles in front of each other.


That's the idea! This is a sideway representation of the number:

515side.png
515side.png (33.7 KiB) Viewed 6671 times


The smaller sphere is not inside the bigger one! The problem with this sideway representation is that it isn't 3D (i.e. those circles could be represented with 2D shapes, whereas tridimensionality is necessary to see the spheres are in front of each other.)

ΛΛΛ
o
VVV


<<◇>>



517

Elmach
Posts: 155
Joined: Sun Mar 13, 2011 7:47 am UTC

Re: Count up with recursive prime factorization

Postby Elmach » Sat Nov 29, 2014 6:30 am UTC

518

<><:><:<<>>> (colonned b-notation)
Image (boundary labyrinthine notation)
Image (level set lab. not)
Image (compacter b-lab. not.)
Image (that one in ls-lab. not.)

I think that Image is the most compact (EDIT: perimeterwise) you can get in labyrinthine notation. (Clearly every ls-lab.not. gives rise to a b-lab.not. of the same structure, so it doesn't matter if you use one or the other; although b-lab is larger, I think ls-lab is more readable.)
EDIT: No; clearly, rotating the left p12 will result in less space used, minimizing area. This would be true if it were half the size. This is false.
Clearly, it has to be at least five(ls-lab)/eleven (b-lab)-tall to hold the <<<>>> bit.

User avatar
Vytron
Posts: 429
Joined: Mon Oct 19, 2009 10:11 am UTC
Location: The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

Re: Count up with recursive prime factorization

Postby Vytron » Sat Nov 29, 2014 7:01 am UTC

That gives me an idea for a notation, will use it first time I have the chance.

<〇>
Λ
〇〇〇
<<〇>>
V


519

Elmach
Posts: 155
Joined: Sun Mar 13, 2011 7:47 am UTC

Re: Count up with recursive prime factorization

Postby Elmach » Sat Nov 29, 2014 7:03 am UTC

Alright! Can't wait to see it.

520:

<><<<>>><><<><<>>> (b-notation)
Asymmetric, analphabetic, composite, <<><<>>>-smooth, which is quite smooth, actually!
Image If this were 260, then it would be nice. But it isn't, so it has this sort of boundary-labyrinthine-notation. (In level-set labyrinthine, it is Image, of course.)

Something about laby-not. makes fives (Image) much larger than sevens (Image). Odd. (It's because going deeper is more expensive than making another. For small numbers.)
Last edited by Elmach on Sat Nov 29, 2014 7:14 am UTC, edited 2 times in total.

User avatar
Vytron
Posts: 429
Joined: Mon Oct 19, 2009 10:11 am UTC
Location: The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

Re: Count up with recursive prime factorization

Postby Vytron » Sat Nov 29, 2014 7:13 am UTC

521.png
521.png (25.77 KiB) Viewed 6610 times


Oh well, doesn't look at all how I imagined it.

The idea is to make a cube-like visualization of a Labyrinth representation, by having a maze in each face. Perhaps with a more complex design...

Elmach
Posts: 155
Joined: Sun Mar 13, 2011 7:47 am UTC

Re: Count up with recursive prime factorization

Postby Elmach » Sat Nov 29, 2014 8:16 am UTC

Alright then, would 523 be a prime that would work better?

522 - composite, analphabetic, asymmetric
<><<>><<>><<><<<>>>> - bracket notation
abb<ac> - alphabetic bracket notation
Image - Labyrinthine notation, level-set mode.
Image - Labyrinthine notation, boundary mode.

User avatar
Vytron
Posts: 429
Joined: Mon Oct 19, 2009 10:11 am UTC
Location: The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

Re: Count up with recursive prime factorization

Postby Vytron » Sat Nov 29, 2014 8:35 am UTC

523.png
523.png (25.58 KiB) Viewed 6594 times


Um... well, at least it looks somewhat more inspired.

Elmach
Posts: 155
Joined: Sun Mar 13, 2011 7:47 am UTC

Re: Count up with recursive prime factorization

Postby Elmach » Sat Nov 29, 2014 8:45 am UTC

Well... 525 must be better, right? (assuming smooth numbers are good.)

524:

<><<><><><><>><> (b-notation)

SYMMETRIC, but composite, and analphabetic.

ImageImage Labyrinthine Image
Last edited by Elmach on Sat Nov 29, 2014 8:52 am UTC, edited 3 times in total.

User avatar
Vytron
Posts: 429
Joined: Mon Oct 19, 2009 10:11 am UTC
Location: The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

Re: Count up with recursive prime factorization

Postby Vytron » Sat Nov 29, 2014 8:51 am UTC

525.png
525.png (27.98 KiB) Viewed 6562 times


Still doesn't look like a labyrinth at all D:

Anyway, returning to text on next post...

User avatar
phillip1882
Posts: 141
Joined: Fri Jun 14, 2013 9:11 pm UTC
Location: geogia
Contact:

Re: Count up with recursive prime factorization

Postby phillip1882 » Sat Nov 29, 2014 9:37 pm UTC

<><<><><><<><>>> 526
efficiency: 66.81%
good luck have fun

User avatar
faubiguy
Posts: 15
Joined: Sun Aug 11, 2013 9:20 am UTC

Re: Count up with recursive prime factorization

Postby faubiguy » Sat Nov 29, 2014 9:45 pm UTC

527
<<<><>>><<<<<>>>>>
<<aa>>e
p<p<p1p1>>ppppp1
311355

Code: Select all

*** *
*** *
* * *
    *
    *


Prime: No
Symmetrical: No
Alphabetical: No

Length: 18
Reversals: 5
Max Depth: 5
Factors: 2
Smoothness: 31
Necessary Brackets: 4

Elmach
Posts: 155
Joined: Sun Mar 13, 2011 7:47 am UTC

Re: Count up with recursive prime factorization

Postby Elmach » Sun Nov 30, 2014 12:56 am UTC

528
<><><><><<>><<<<>>>> in b-notation
aaaabd in alphabetic b-notation
Image in level-set labyrinthine notation
Image in boundary l-notation

alphabetic, asymmetric, and composite. d-smooth.

User avatar
Vytron
Posts: 429
Joined: Mon Oct 19, 2009 10:11 am UTC
Location: The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P

Re: Count up with recursive prime factorization

Postby Vytron » Sun Nov 30, 2014 1:06 am UTC

"<o> <o>"
"<o> <o>"


529

Where I am using quotes as another pair of angle brackets.

User avatar
faubiguy
Posts: 15
Joined: Sun Aug 11, 2013 9:20 am UTC

Re: Count up with recursive prime factorization

Postby faubiguy » Sun Nov 30, 2014 1:29 am UTC

530
<><<<>>><<><><><>>
ac<aaaa>
p1ppp1p<p1p1p1p1>
113321111112

Code: Select all

* * *******
  * * * * *
  *       


Prime: No
Symmetrical: No
Alphabetical: No

Length: 18
Reversals: 11
Max Depth: 3
Factors: 3
Smoothness: 53
Necessary Brackets: 2


Return to “Forum Games”

Who is online

Users browsing this forum: addams and 23 guests