mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 25 of 42
Search took 0.01 seconds.
Search: Posts Made By: synergy
Forum: Math 2004-12-02, 14:27
Replies: 11
Views: 2,859
Posted By synergy
Cool Not strictly polynomials but...

Though they aren't strictly polynomials (I don't know if you say my previous posts), these will give a lot of early primes without composites...

105 - 2^x
15 - 2^x
45 - 2^x
70 - 3^x
75 - 2^x
...
Forum: Miscellaneous Math 2004-11-29, 20:47
Replies: 3
Views: 2,131
Posted By synergy
Talking I'm not sure what this is, what language the code...

I'm not sure what this is, what language the code is for, or what the original author was thinking, etc. :alien:
What I am sure of is that every element in the sets proposed has x as a factor....
Forum: Homework Help 2004-11-05, 17:21
Replies: 3
Views: 2,226
Posted By synergy
Stupid me :razz: , Tychonoff's theorem was in one...

Stupid me :razz: , Tychonoff's theorem was in one of the hints the professor posted!
Aaron
Forum: Homework Help 2004-11-05, 17:18
Replies: 3
Views: 2,226
Posted By synergy
Smile Thanks

Thanks a bunch, Zeta-Flux.
Yeah, it's homework. I never seem to have enough time, that's the big problem. This'll help alot.
Thanks again.
Aaron
Forum: Homework Help 2004-11-05, 01:59
Replies: 3
Views: 2,226
Posted By synergy
Question Topology Question - Help ?!

:question:
Does anybody have any suggestions on how to prove that a topological space X is COUNTABLY compact (i.e. every COUNTABLE open cover has a finite subcover), IF AND ONLY IF, EVERY NESTED...
Forum: Miscellaneous Math 2004-10-26, 16:57
Replies: 3
Views: 1,231
Posted By synergy
Smile Amateur, I just read your post in the other...

Amateur,
I just read your post in the other thread. If you'd like help writing it in easy to understand mathematical language some time, I'd be willing to help. Though, I'm beginning to learn that...
Forum: Miscellaneous Math 2004-10-26, 02:02
Replies: 3
Views: 1,231
Posted By synergy
Smile If you can get a Texas Instruments graphing...

If you can get a Texas Instruments graphing calculator, I'll send you a copy of the program. I have the program on a TI-85, if you get an 83 or an 86, I'll have to modify the program a bit (I've...
Forum: Miscellaneous Math 2004-10-26, 01:54
Replies: 3
Views: 1,231
Posted By synergy
Smile New post for us "crackpots"

Hey, if any of you want to continue the "calling out" thread, okay, but I think it might be time to let it go. When I work out the "121" thing I'm going to do, I'll put it here.
Amateur, when I...
Forum: Miscellaneous Math 2004-10-25, 20:39
Replies: 17
Views: 2,696
Posted By synergy
Red face By the way, after this and the above post...

By the way, after this and the above post referring to certain "inconsistencies in communication on the part of both parties" to try to phrase things in a non-personal fashion, after these two posts...
Forum: Miscellaneous Math 2004-10-25, 18:32
Replies: 17
Views: 2,696
Posted By synergy
Question Bob said (10) "uniqueness". More unqualified...

Bob said
(10) "uniqueness". More unqualified hyperbolee.
You would be much better off if you READ ABOUT THIS SUBJECT.
Until you do, I simply can't be bothered looking at your work. It isn't worth...
Forum: Miscellaneous Math 2004-10-23, 02:13
Replies: 17
Views: 2,696
Posted By synergy
Red face :surrender I just read a posting by Bob on...

:surrender
I just read a posting by Bob on another website, wherein he explains why my theory is "rediculous". Basically, the number of computations, even if we can ensure optimal partitioning,...
Forum: Miscellaneous Math 2004-10-23, 01:57
Replies: 17
Views: 2,696
Posted By synergy
Red face Okay, maybe it was a little over the top, but it...

Okay, maybe it was a little over the top, but it was meant a little humorously, and like amateur said (thank you), he makes unsupported claims that my posts are "rediculous" and "not well defined". ...
Forum: Miscellaneous Math 2004-10-22, 18:19
Replies: 17
Views: 2,696
Posted By synergy
Exclamation Bob, I'm calling you out!

Bob (you know who you are),

I posted this on the other forum you frequent, but in case you don't catch it, her it is again.

I challenge you to find one inconsistency or one ill-defined phrase...
Forum: Math 2004-10-20, 15:32
Replies: 13
Views: 2,025
Posted By synergy
Thanks, Luigi, I'll check it out. Sorry it took...

Thanks, Luigi, I'll check it out. Sorry it took me so long to respond, I was on fall break.
Aaron
Forum: Math 2004-10-16, 00:20
Replies: 13
Views: 2,025
Posted By synergy
Cool Thanks, Luigi, I'll look those things up when...

Thanks, Luigi, I'll look those things up when time permits. Admittedly, I have little experience at the computer side of this endeaver, I am more comfortable with the theoretical math, hence I'm...
Forum: Math 2004-10-15, 18:16
Replies: 13
Views: 2,025
Posted By synergy
Smile Here's a couple examples of my algorithm: Let's...

Here's a couple examples of my algorithm:
Let's look at the absolute value of 15 plus or minus 2^x, for outputs less than 7^2=49. No such output can have a factor of 2,3, or 5. This is one of a...
Forum: Math 2004-10-15, 17:35
Replies: 13
Views: 2,025
Posted By synergy
Talking Nice to see some of you are seeing what I'm...

Nice to see some of you are seeing what I'm getting at...
For anybody still not sure, I've simplified it somewhat:

Let's pick a range, say all x between 10^9 and 10^10.
Now, let e=the efficiency...
Forum: Math 2004-10-14, 22:07
Replies: 13
Views: 2,025
Posted By synergy
Cool A bit more clarifying...

I guess that exactly the question I have is, how fast must it run to find ALL OF the primes in a range at the same rate that the second program finds them, given that the second program checks every...
Forum: Math 2004-10-14, 18:23
Replies: 13
Views: 2,025
Posted By synergy
I'm not saying my method does exactly that, but...

I'm not saying my method does exactly that, but it's close to working like that, and I'm sure that it's not efficient enough, yet, but I have plans to "tweak" the method.
Aaron
Forum: Math 2004-10-14, 18:21
Replies: 13
Views: 2,025
Posted By synergy
say you input 10000 and it gives you the 10000th...

say you input 10000 and it gives you the 10000th prime, which requires some time to compute
then you input 10001 and it gives you 10001th prime
then you input 10002 and it gives you 10002th prime...
Forum: Miscellaneous Math 2004-10-14, 18:14
Replies: 13
Views: 2,050
Posted By synergy
check out the "clarification" post

check out the "clarification" post
Forum: Math 2004-10-14, 15:59
Replies: 13
Views: 2,025
Posted By synergy
Lightbulb Clarification: Test VS Generator

Okay, a test is a function f: positive integers --> {0,1} such that it outputs a zero if the integer is composite and a one if the integer is prime.

A generator is a function f: positive integers...
Forum: Miscellaneous Math 2004-10-14, 15:53
Replies: 13
Views: 2,050
Posted By synergy
Exclamation Amateur, No, your method still has to test all...

Amateur,
No, your method still has to test all composites, while mine outputs only the primes.
Forum: Miscellaneous Math 2004-10-14, 00:01
Replies: 13
Views: 2,050
Posted By synergy
I meant (10^9)+2001

I meant (10^9)+2001
Forum: Miscellaneous Math 2004-10-13, 23:58
Replies: 13
Views: 2,050
Posted By synergy
Cool Question of efficiency: Test VS Generator

Someone has probably already proven something about this, but I haven't seen it in any research I've done, so maybe somebody here knows the answer.

Say we test 1000 consecutive odds from, say 10^9...
Showing results 1 to 25 of 42

 
All times are UTC. The time now is 15:39.


Mon Nov 28 15:39:10 UTC 2022 up 102 days, 13:07, 0 users, load averages: 1.45, 1.45, 1.46

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

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔