[QUOTE=flouran;204092]Don't they occasionally have arranged marriages in Israel?[/QUOTE]

That's just a guarantee that you'll get laid, but it's not a guarantee that the sex will a) be any good and b) you wouldn't rather be doing her much hotter sister, who unfortunately happens to be in madly in love with a [I]real[/I] phony.

Hm, that was fun...maybe I should write plots for soap-operas and leave the mathy-algorithmy-programmy stuff to people who get paid for it.

[QUOTE=__HRB__;204098]That's just a guarantee that you'll get laid, but it's not a guarantee that the sex will a) be any good[/QUOTE]
Good sex is teachable. Good looks aren't.

[QUOTE=flouran;204099]Good sex is teachable.[/QUOTE]

Not everybody is a skilled autodidact.

[quote=flouran;204099]Good sex is teachable. Good looks aren't.[/quote]
Confirms my prejudice against American pornography:
Sex by numbers, looks by cosmetic surgery and vacuous dialogue.

[QUOTE=davieddy;204124]... vacuous dialogue.[/QUOTE]You mean it [i]has[/i] dialogue? Oh. :redface:

OMG
 

[quote=flouran;204099]Good sex is teachable. Good looks aren't.[/quote]

[quote=retina;204125]You mean it [I]has[/I] dialogue? Oh. :redface:[/quote]

[URL]http://www.youtube.com/watch?v=yHgO7yh06V0[/URL]

Love it.

[QUOTE=davieddy;204138][URL]http://www.youtube.com/watch?v=yHgO7yh06V0[/URL]

Love it.[/QUOTE]

We were expecting a link to pornography with exiting sex, natural looks and oscar-wildesque dialog. Consider yourself in the doghouse for using bait-and-switch.

A rewrite of my conjecture:

n is a natural number.
m is a natural number.
a is a natural number.
p is a prime number.
n|m n is a factor of m.
2n+1|m 2n+1 is an odd factor of m.
p[sub]g[/sub] is a prime number that agrees these terms:
The smallest n for n|p[sub]g[/sub]-1 that agrees 2[sup]n[/sup]>p[sub]g[/sub] must be odd, and will be shown as s.

The conjecture: [tex]2^{sa}\equiv 1\(mod p[sub]g[/sub])[/tex]

And now for the amazing 431:
431-1=430.
n|430
n=43,2,10,215,86.
The smallest n that agrees the terms is 10 as we know.
10 isn't an odd number which means 431=\=p[sub]g[/sub].

I hope I wrote it better!

anything you think "really" is true

you feel



( 5 ? )


[COLOR="Silver"]( btw : we are kings of cranks )[/COLOR]

Here's my guess as to what you mean. Is this right?

Denote by f(N) the smallest factor of N-1 such that 2^f(N) > N. Let s = f(p) where p is an odd prime. Conjecture: if s is odd, then [tex]2^s\equiv1\pmod p[/tex].

[quote=CRGreathouse;204148]Here's my guess as to what you mean. Is this right?

Denote by f(N) the smallest factor of N-1 such that 2^f(N) > N. Let s = f(p) where p is an odd prime. Conjecture: if s is odd, then [tex]2^s\equiv1\pmod p[/tex].[/quote]
Ho thank you so much CRGreathouse,
You understood what I meant and now i'll use the sybols.

Tomer