mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 6 of 6
Search took 0.00 seconds.
Search: Posts Made By: axn
Forum: Puzzles 2010-12-13, 16:09
Replies: 183
Views: 14,448
Posted By axn
Verified the first 7 terms: 11, 751, 1129,...

Verified the first 7 terms:
11, 751, 1129, 361649, 361649, 12462809, 12462809.
Forum: Puzzles 2010-04-07, 01:01
Replies: 183
Views: 14,448
Posted By axn
While we're at it, some results for the cubes: ...

While we're at it, some results for the cubes:
3:5:160
51:233:143309500
1095:8783:167992435025000
2739:24763:9495929161130000
401785:5828099:18803849605481106073200000...
Forum: Puzzles 2010-04-07, 00:48
Replies: 183
Views: 14,448
Posted By axn
Pari concurs with your first seven ...

Pari concurs with your first seven

p=2;s=0;ten=10;for(i=2,10000000,s=s+p;if(Mod(s,ten)==0, ten=ten*10;print(i,":",p, ":",s)); p=nextprime(p+1))

4:5:10
10:23:100
3796:35677:63731000...
Forum: Puzzles 2010-03-18, 19:59
Replies: 183
Views: 14,448
Posted By axn
That sequence is the first occurrence of 10^n....

That sequence is the first occurrence of 10^n. 977 repeats (not a typo!) because it ends in 000 and comes before any other 00. So it stands at positions 2 & 3.

EDIT:- Mine is merely the first four...
Forum: Puzzles 2010-03-18, 19:02
Replies: 183
Views: 14,448
Posted By axn
I think CRG's sequence is more "worthy". It is...

I think CRG's sequence is more "worthy". It is also the solution of OP.



I can think of two ways to generalize: to other bases and other powers (other than squares).
Forum: Puzzles 2010-03-18, 14:26
Replies: 183
Views: 14,448
Posted By axn
s=0;forprime(p=2,1000,s=s+p^2;if(Mod(s,10)==0,...

s=0;forprime(p=2,1000,s=s+p^2;if(Mod(s,10)==0, print(p, ":",s)))
907:37464550
967:44505630
977:46403000
991:48351370
Showing results 1 to 6 of 6

 
All times are UTC. The time now is 08:07.

Wed Oct 21 08:07:49 UTC 2020 up 41 days, 5:18, 0 users, load averages: 2.01, 1.61, 1.44

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.