mersenneforum.org  

Go Back   mersenneforum.org > Math Stuff > Computer Science & Computational Number Theory > PARI/GP

Reply
 
Thread Tools
Old 2010-08-13, 21:25   #408
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26×131 Posts
Default

part I have trouble with is the above and below part for sum I use under and over but that creates fractions not just under or over respectively.
science_man_88 is offline   Reply With Quote
Old 2010-08-13, 21:34   #409
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26×131 Posts
Default

figured it out(except the infinity symbol) lol took a look at flouran's post in the LaTeX thread.

Last fiddled with by science_man_88 on 2010-08-13 at 21:35
science_man_88 is offline   Reply With Quote
Old 2010-08-13, 21:35   #410
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

B5C16 Posts
Default

Example:

f(x)=\sum_{n=1}^{x}n^{2}

with:

[tex]f(x)=\sum_{n=1}^{x}n^{2}[/tex]


\infty


[tex]\infty[/tex]


And:
Here is an example of the Law of small numbers.

That conjecture was verified upto n=2.3M, so not really small compared to n=1, 2 or 3,
but the first counterexample was higher than that level found the next day!

Last fiddled with by kar_bon on 2010-08-13 at 21:40
kar_bon is offline   Reply With Quote
Old 2010-08-13, 21:40   #411
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

100000110000002 Posts
Default

Quote:
Originally Posted by kar_bon View Post
Example:

f(x)=\sum_{n=1}^{x}n^{2}

with:

[tex]f(x)=\sum_{n=1}^{x}n^{2}[/tex]


\infty


[tex]\infty[/tex]
so it's \pi = \sum^\infty_{k=0} I got into trouble with the fraction god not as easy lol.
science_man_88 is offline   Reply With Quote
Old 2010-08-13, 21:42   #412
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

22·727 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
so it's \pi = \sum^\infty_{k=0} I got into trouble with the fraction god not as easy lol.
The key is using the brackets { and } !
kar_bon is offline   Reply With Quote
Old 2010-08-13, 21:43   #413
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26·131 Posts
Default

Quote:
Originally Posted by kar_bon View Post
The key is using the brackets { and } !
will that help me I know frac is \frac{} but I have no idea what to do with it.
science_man_88 is offline   Reply With Quote
Old 2010-08-13, 21:46   #414
3.14159
 
3.14159's Avatar
 
May 2010
Prime hunting commission.

24·3·5·7 Posts
Default

Hey: Can anyone solve this? $71^6 \equiv 1(mod 22!)$

In other words: Find a number of the form (k * 1124000727777607680000 + 1) which is divisible by 716.

Last fiddled with by 3.14159 on 2010-08-13 at 21:48
3.14159 is offline   Reply With Quote
Old 2010-08-13, 21:48   #415
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

838410 Posts
Default

\pi = 4\sum^{\infty}_{k=0}\frac{(-1)^{k}{2k+1}}

this is the best I could do.
science_man_88 is offline   Reply With Quote
Old 2010-08-13, 21:51   #416
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

22×727 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
\pi = 4\sum^{\infty}_{k=0}\frac{(-1)^{k}{2k+1}}

this is the best I could do.
Try this:

[tex]\pi=4\sum_{k=0}^{\infty}\frac{(-1)^k}{2k+1}[/tex]


\pi=4\sum_{k=0}^{\infty}\frac{(-1)^k}{2k+1}
kar_bon is offline   Reply With Quote
Old 2010-08-13, 21:54   #417
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26×131 Posts
Default

Quote:
Originally Posted by kar_bon View Post
Try this:

[tex]\pi=4\sum_{k=0}^{\infty}\frac{(-1)^k}{2k+1}[/tex]


\pi=4\sum_{k=0}^{\infty}\frac{(-1)^k}{2k+1}
thanks karbon maybe now I can finally express something most people who can help  stand \over will lol.
science_man_88 is offline   Reply With Quote
Old 2010-08-13, 22:00   #418
3.14159
 
3.14159's Avatar
 
May 2010
Prime hunting commission.

69016 Posts
Default

Also: Found a decent factorial-based prime:

20019 * 426! + 1 is an SPRP. (It has 936 digits - Too small. I need somewhat larger primes.)

Sadly, there are no sieve implementations except one I programmed: But that's actually doing the same as pform.

I found a 2293-digit composite pseudoprime. Bummer.

20004 * 901! + 1 is prime! (≈2280-2285 digits)

Last fiddled with by 3.14159 on 2010-08-13 at 22:55
3.14159 is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
Why do I sometimes see all the <> formatting commands when I quote or edit? cheesehead Forum Feedback 3 2013-05-25 12:56
Passing commands to PARI on Windows James Heinrich Software 2 2012-05-13 19:19
Ubiquity commands Mini-Geek Aliquot Sequences 1 2009-09-22 19:33
64-bit Pari? CRGreathouse Software 2 2009-03-13 04:22
Are these commands correct? jasong Linux 2 2007-10-18 23:40

All times are UTC. The time now is 22:48.


Fri Aug 6 22:48:22 UTC 2021 up 14 days, 17:17, 1 user, load averages: 4.23, 4.25, 3.91

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.