Forum: Factoring
2013-03-21, 07:08
|
Replies: 148
Views: 28,017
|
Forum: Factoring
2013-03-21, 06:59
|
Replies: 148
Views: 28,017
I confirm the length, the two C472's are the...
I confirm the length, the two C472's are the product of earlier terms, +/- 1 (not sure whether this is a particular challenge and/or interesting for any reason beyond calculating some more terms)
...
|
Forum: Factoring
2013-03-21, 06:16
|
Replies: 148
Views: 28,017
Sean's list on the OEIS wiki
Following posts by Charles and Sean on the SeqFan list, I've created https://oeis.org/wiki/OEIS_sequences_needing_factors
I hope it might be useful to maintain Sean's list. (Maybe it could / should...
|
Forum: storflyt32
2013-03-21, 06:09
|
Replies: 16
Views: 1,787
I think anyone who comes to this forum with at...
I think anyone who comes to this forum with at least half-way serious intentions has already seen the well known factorization of 2^ab - 1 which is also valid for any other x^ab - 1 and based on the...
|
Forum: Math
2012-05-16, 23:24
|
Replies: 42
Views: 4,103
another 3 cents...
Well, in a case like this one, it is not *so* bad to write 9^(9^9) to make things 100% unambiguous. (Though I concede that a^b^c should mean a^(b^c), in particular because (a^b)^c could (and thus...
|
Forum: Puzzles
2009-10-23, 19:47
|
Replies: 35
Views: 2,195
|
Forum: Lounge
2009-10-23, 18:09
|
Replies: 745
Views: 60,667
|
Forum: Puzzles
2009-10-19, 06:09
|
Replies: 10
Views: 623
|
Forum: Conjectures 'R Us
2009-10-19, 06:01
|
Replies: 886
Views: 86,364
|
Forum: Math
2009-10-01, 21:38
|
Replies: 17
Views: 1,895
How?
(This is an incredulous "how" -
Do...
How?
(This is an incredulous "how" -
Do you claim that this is possible?? (even, "theoretically" ?)
It is not, definitely! There are several irrefutable obstacles that make it provably...
|
Forum: Math
2009-10-01, 20:43
|
Replies: 13
Views: 1,566
To oversimplify a bit: I think he essentially...
To oversimplify a bit: I think he essentially wanted to know whether there are 2 different x such that x^2-2 = 0 (in Z/qZ).
Of course, if x is a solution, then -x is a solution too; e.g. 16 = -111...
|
Forum: Information & Answers
2009-10-01, 20:24
|
Replies: 14
Views: 967
Maybe the answer the O.P. was looking for is...
Maybe the answer the O.P. was looking for is rather something like
int factorial(int n){ int f=1; while( n>1 ) f *= n--; return(f); }
main(){ int n; for( n=1; n<10; n++ ) printf( "%d ! = %d\n",...
|
Forum: Lounge
2009-07-09, 02:09
|
Replies: 8
Views: 935
|
Forum: Puzzles
2009-04-11, 22:29
|
Replies: 33
Views: 1,934
|
Forum: Puzzles
2009-04-09, 22:51
|
Replies: 31
Views: 2,060
|
Forum: Puzzles
2009-04-09, 20:37
|
Replies: 31
Views: 2,060
|
Forum: Puzzles
2009-04-08, 23:49
|
Replies: 33
Views: 1,934
|
Forum: Miscellaneous Math
2009-04-05, 20:40
|
Replies: 62
Views: 2,647
|
Forum: Puzzles
2009-03-29, 22:32
|
Replies: 43
Views: 2,447
|
Forum: Lounge
2009-03-28, 18:23
|
Replies: 4,207
Views: 285,385
[Calendar...
[Calendar (http://www.mersenneforum.org/calendar.php)] in the above navigation bar...???
|
Forum: Math
2009-02-22, 15:24
|
Replies: 26
Views: 1,411
That's a good point. Common speak would be in...
That's a good point. Common speak would be in favour of the latter (and btw not 0...999 but 1...1000, but since the 000 is unlikely to yield a prime, there's no problem) - and mathematically speaking...
|
Forum: Math
2009-02-22, 14:22
|
Replies: 26
Views: 1,411
|
Forum: Software
2009-02-22, 01:58
|
Replies: 5
Views: 1,376
There are different things.
First, creating...
There are different things.
First, creating an array on runtime is not any different from "hard coding" it. And anyway, since you know the limits for a and x, you can create it once at the...
|
Forum: Homework Help
2009-02-01, 19:01
|
Replies: 50
Views: 6,186
|
Forum: Lounge
2009-02-01, 14:13
|
Replies: 4,207
Views: 285,385
|