The Strongest Matthew For Whenever Options

[Lloyd Seegymont the Rasier]

I need some advice. I played the Eternal Sonata demo last night. It seemed ok, given the short amount for time I was aloud to play. And it's cheap now, only like 17 dollars used.

Whats everyones opinion on this game?

Is is worth playing?

[Rhiannon]

IT IS A FUN GAME THAT YOU SHOULD GET IF YOU'RE OKAY WITH GAMES NOT BEING LONG

[chrishawke]

The gameplay gets more intense later in the game. If you don't mind, story is pretty philosophical. I'd say it's worth playing for at least one playthrough.

[Shiokazu]

how many hours a game must have to be considered long?

[Yuka]

I generally consider 40 hours a decent length for a game, but I much more prefer games with more than that.

Also yeah ES is pretty good for maybe one or two playthroughs.

[Elnendil]

I went and typed up my thoughts into a paper. The results I found that when finding primes using n!+p=q when q is some prime, those forms of the primes were unique when q>n>=1. Once n>=q, you'd get a constant repeat of q(1). Very interesting.

This post has been edited by Elnendil: Oct 29 2010, 07:07 AM

[Rhiannon]

I'D GO WITH WHAT SAUCE SAID. ES WAS LIKE 20 HOURS, THOUGH I GUESS THE PS3 VERSION IS PROBABLY LONGER.

[aerozero]

I should be studying but instead watching various Halloween specials/episodes of different TV series.

Officially in the Halloween mood!

[Shiokazu]

... i think rai will come and say, DONT BE A EMO SHIO, and stuff...

but... im feeling really depressed. i wish i had at least one goal for me. i never felt this lost, and im even more sad because... ur.

nevermind.

[aerozero]

Now I'm watching Jackie Chan Adventures.

So awesome

[Raijinili]

STOP WHINING ABOUT IT IN PUBLIC.

GOTO CHAT.

ALSO ELNENDIL WHAT IS P?

[Elnendil]

STOP WHINING ABOUT IT IN PUBLIC.

GOTO CHAT.

ALSO ELNENDIL WHAT IS P?

EDIT: I'll quote what I wrote:

Defining Primes using Factorials
When considering the last proof, you noticed that there indeed existed numbers such that n! + p was prime, but it
didn't hold true for all of them. But consider the ability to define primes using these. Because of how the last proof
is worded, you can tell that it should hit every prime with certain values of n and p. This is definitely possible if we
are trying to approach some prime number.
So: If q > n >= 1 and (n!; p) = 1 then all primes can be written in at least one form of n! + p and these forms are
unique
Consider a few examples with :
2 = 1! + 1
3 = 1! + 2 2! + 1
5 = 1! + 4 2! + 3 3! - 1 4! - 19
7 = 1! + 6 2! + 5 3! + 1 4! - 17
: : : : : : : : : : : : : : : : : :
59 = 1! + 58 2! + 57 3! + 53 4! + 35
Notice that in some cases p isn't prime. This is what was shown in Section 1, that when p is odd, it can be either
prime or composite, as long as the result is the prime number and p and n! have no common factors. This is harder to
prove but is also easier to believe when looking at using factorials to find primes because of our findings in Section
2. Also notice that since q > n, when finding a very high prime number, there should exist more and more different
ways in which to write that prime number using factorials.

And regarding uniqueness:

Considering when q <= n, n always has a factor of q. p does as well, so the result constantly tends to q(1), so
these terms are never really unique, so we are more interested in q > n.

Also went ahead and wrote that other paper I was meaning to write on understanding expanding polynomials better by referring to basic multiplication. Easy and neat.

This post has been edited by Elnendil: Oct 29 2010, 09:38 AM

[Raijinili]

Oh. You have to clarify what's what (n is a natural number, p is an integer, q is a prime).

What's q(1)?

Also, is it true for just primes, or any natural number?

[Elnendil]

Ah, sorry. They are all integers. q has to be prime, since thats the result you want to get. In this concept you want to look up primes and write factorial representations of them. You'll then notice for each n up to but not q, both n! and p don't have common factors. The point is to write a prime in a different form like "5!-107 is a representation of 13". Yeah you can simplify it further using subtraction, but this is about writing primes in some factorial form. And those forms when q>n>=1 show unique representations.


When I say q(1), I mean that when you use n>=q, you can always pull out the prime itself from both n! and p, and the result inside the parenthesis results is 1 (With bigger and bigger factorials, of course the numbers tend to be pretty ridiculously high so you have to subtract to get back to the prime you want, but the subtraction cancels itself out back to 1 every time). Example:

7=7!-5033 -> 7=7(720-719)
7=8!-40313 -> 7=7(5760-5759)

When considering say, composite numbers, you tend to get a lot of results that have a similar way of writing it elsewhere. 10=2!+8, or 2(5). 3!+4 or 2(5) 4!-14 or 2(5) Then 5!-110 or 10(12-11) or 10(1). 6!-710 or 10(72-71) or 10(1). Follows some different rules. With composite numbers its more of the idea that once the factorial has numbers it can pull out the number you want (say 10 here) the parenthesis always results in 1. So for 10 its either 2(5) or 10(1), nothing very interesting. The focus was on primes because they have unique ways of writing them. I think it says a few things on the properties of primes possibly.

EDIT: Looking it over one more time, i'm wondering if I should omit forms of 2 and 3, because the only "unique" forms are forms in which the factorial could be placed elsewhere. Like 3=2!+1 or 1!+2. Thats not very interesting and isn't as unique as I thought.. I'll give it some more thought.

This post has been edited by Elnendil: Oct 29 2010, 08:40 PM

[aerozero]

So what are you guys doing for Halloween?