Mathematics Asked on August 2, 2020

Can you prove or disprove the following claim:

Let $Phi_m(x)$ be the mth cyclotomic polynomial , and let $n$ be a natural number greater than one . If there exists an integer $a$ such that $$Phi_{n-1}(a) equiv 0 pmod{n}$$ then $n$ is prime.

You can run this test here. I have verified this claim for all prime numbers less than $1000000$ .

Quoting from Dickson, History of the Theory of Numbers, Volume 1, page 378:

A. Hurwitz [L'intermediaire des math. 2 (1895) 41] gave a generalization of Proth's theorem. Let $F_n(x)$ denote an irreducible factor of degree $phi(n)$ of $x^n-1$. Then if there exists an integer $q$ such that $F_{p-1}(q)$ is divisible by $p$, $p$ is a prime.

I haven't been able to find the Hurwitz paper.

Correct answer by Gerry Myerson on August 2, 2020

Get help from others!

Recent Answers

- Lex on Does Google Analytics track 404 page responses as valid page views?
- haakon.io on Why fry rice before boiling?
- Jon Church on Why fry rice before boiling?
- Joshua Engel on Why fry rice before boiling?
- Peter Machado on Why fry rice before boiling?

Recent Questions

- How can I transform graph image into a tikzpicture LaTeX code?
- How Do I Get The Ifruit App Off Of Gta 5 / Grand Theft Auto 5
- Iv’e designed a space elevator using a series of lasers. do you know anybody i could submit the designs too that could manufacture the concept and put it to use
- Need help finding a book. Female OP protagonist, magic
- Why is the WWF pending games (“Your turn”) area replaced w/ a column of “Bonus & Reward”gift boxes?

© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP