Toda primes

Abstract

A Toda prime of an integer n is an odd prime p such that 4n=(p-1)k with k coprime to p. We conjecture that every positive integer admits at least two Toda primes. We give a partial proof that every positive integer admits at least one Toda prime. We conclude by discussing connections to denominators of Bernoulli numbers and a generalization of Sophie Germain primes.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…