mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 17 of 17
Search took 0.02 seconds.
Search: Posts Made By: pvaldivia
Forum: Homework Help 2022-05-14, 16:28
Replies: 7
Views: 1,136
Posted By pvaldivia
That is definitely an awesome power! One that I...

That is definitely an awesome power! One that I would use quite often. To your question, now that I think of it, I might have some anti-powers. The power of inefficient code and the power of...
Forum: Homework Help 2022-05-13, 22:45
Replies: 7
Views: 1,136
Posted By pvaldivia
I hadn't when you posted, but that is very...

I hadn't when you posted, but that is very helpful. Thank you!
Forum: Homework Help 2022-05-12, 15:34
Replies: 7
Views: 1,136
Posted By pvaldivia
Thanks for this response - I had no idea that...

Thanks for this response - I had no idea that division would be the bottleneck! Also, since you mentioned current methods of finding factors of Mersenne numbers, are there references available that...
Forum: Homework Help 2022-05-11, 15:31
Replies: 7
Views: 1,136
Posted By pvaldivia
OK, I think I've found a proof. We...

OK, I think I've found a proof.


We start by guessing the answer and then showing that it's true.

(2^(p-1)-1)/p ?= (2^(period)-1)/p [2^(period*(p-1)/period-1) +...
Forum: Homework Help 2022-05-08, 03:59
Replies: 7
Views: 1,136
Posted By pvaldivia
Unfinished factoring puzzle

Hello, I'd like to ask another question of this forum: can the following be proven or disproven? Any tips or hints would be appreciated, or if you prefer to just post a solution, then by all means!
...
Forum: Number Theory Discussion Group 2022-04-17, 02:44
Replies: 16
Views: 1,990
Posted By pvaldivia
After spending a little more time with it, it...

After spending a little more time with it, it seems that the formulae to compute f(n-1)%p and f(n+1)%p the the primes p in f(n) are exactly the same as that to compute f(n) % p. This can be seen by...
Forum: Number Theory Discussion Group 2022-04-16, 17:33
Replies: 16
Views: 1,990
Posted By pvaldivia
There may be a way to strengthen the test and...

There may be a way to strengthen the test and redefine the problem. I've noticed that if we take g(n) to have the same definition as f(n) but before taking the final modulus, then for a prime p...
Forum: Number Theory Discussion Group 2022-04-16, 02:17
Replies: 16
Views: 1,990
Posted By pvaldivia
Unfortunately, I have to report that using the...

Unfortunately, I have to report that using the convenient formula, I was able to go up to higher values on n much more quickly and believe that I have found a pseudoprime.

n = 3*19*19937*37493 ...
Forum: Number Theory Discussion Group 2022-04-15, 16:50
Replies: 16
Views: 1,990
Posted By pvaldivia
Ah, the only solutions are 1 and p2-1. I also...

Ah, the only solutions are 1 and p2-1. I also found this a second way: if (p1^2-1) = mp2, then (p1+1)*(p1-1) can have no factor of p2. Then it remains to be proven that f(n) is nonzero for numbers...
Forum: Number Theory Discussion Group 2022-04-14, 20:56
Replies: 16
Views: 1,990
Posted By pvaldivia
So if I understand correctly, then by the...

So if I understand correctly, then by the arguments that you’ve presented, the problem has been reduced to that of odd, square-free composites. I’ve done some algebra, and arrived at what seems to...
Forum: Number Theory Discussion Group 2022-04-14, 01:51
Replies: 16
Views: 1,990
Posted By pvaldivia
Ah, Fermat -- then I suppose we can use CRT to...

Ah, Fermat -- then I suppose we can use CRT to get f(n). This looks quite promising, thanks again!!!
Forum: Number Theory Discussion Group 2022-04-13, 18:56
Replies: 16
Views: 1,990
Posted By pvaldivia
This is great; and I think we're beginning to...

This is great; and I think we're beginning to crack the problem. By arguments like these it can be shown that f(n) is nonzero for n=4m+2. And by counting the number of even and odd numbers between...
Forum: Number Theory Discussion Group 2022-04-12, 20:10
Replies: 16
Views: 1,990
Posted By pvaldivia
Actually, this helps quite a bit. The problem...

Actually, this helps quite a bit. The problem that I chose to look at today was why f(2p) appears to be equal to 2p-3 for a prime p >= 5. While I haven't been able to get the exact value 2p-3 yet,...
Forum: Number Theory Discussion Group 2022-04-10, 15:49
Replies: 16
Views: 1,990
Posted By pvaldivia
Ideas for a proof

Hi all, just for fun --

I'd like to prove or disprove the following, see it be proved/disproved, and/or hear your thoughts on what may be useful methods in pursuit of a proof. If there's an...
Forum: Wagstaff PRP Search 2022-03-31, 01:57
Replies: 10
Views: 12,078
Posted By pvaldivia
Related set of primes

Hello all,

A following is to my knowledge unproven (although I might be ignorant since I’m a recreational type), but also may relate to some of the interest in finding a Lucas-Lehmer-like...
Forum: Homework Help 2022-03-27, 17:11
Replies: 4
Views: 1,826
Posted By pvaldivia
Thanks for this excellent answer! I appreciate...

Thanks for this excellent answer! I appreciate the insight. There are so many fascinating properties of the Fibonacci and Lucas sequences that it’s no wonder there is an entire journal devoted to...
Forum: Homework Help 2022-03-25, 00:58
Replies: 4
Views: 1,826
Posted By pvaldivia
Question on a sequence

Hello, hope this is the right place to post this....

I noticed that in the first sequence that the entries in the sequence A077262(A144769(n)) appear to be divisible by the nth prime for n>=2. ...
Showing results 1 to 17 of 17

 
All times are UTC. The time now is 00:24.


Sat Aug 13 00:24:33 UTC 2022 up 36 days, 19:11, 2 users, load averages: 1.10, 1.14, 1.15

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.

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