Help: Pollard's p-1, correct way to build M

I need some help regarding one of the steps in Pollard's p-1.

What I understood: We are assuming that there exists pp, a prime factor of nn, such that p1p-1 is BB-powersmooth for some BB (not BB-smooth!) and that we're trying to build a number MM (to be used as an exponent) such that (p1)M(p-1)|M. Most commonly this is done in two ways:

  1. M=B!M = B!
  2. M=qaM = \prod {q^a} , for all primes q<=Bq <= B and aa sufficiently large.

Let's focus on the second. My confusion comes from the value of a. Using the main assumption we made (p1p-1 is BB-powersmooth) it seems clear that a=logqBa = \lfloor log_q{B} \rfloor. However, some sources (including Wikipedia) use a=logqna = \lfloor log_q{n} \rfloor. Since we can assume n>>Bn >> B this works too but makes aa unnecessarily large.

At first I thought it's just an error on Wikipedia and I made a correction, but I found several revisions in page history that change this both ways (BB to nn and back), with no real discussion, which makes me unsure. Can someone explain why nn makes more sense than BB here, or confirm that nn was just an error?

Note by Nikola Jovanović
1 year, 8 months ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

Sort by:

Top Newest

The confusion seems to be whether we're assuming p1p-1 is BB-powersmooth or BB-smooth, right? If it's BB-powersmooth, then we can use the smaller bound, but if it's BB-smooth, then we have to use the larger one.

The Wikipedia page cites the smaller bound, but the example (n=299,n=299, B=5B=5) appears to use the larger bound.

Patrick Corn - 1 year, 7 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...