researcher

C. Pomerance

44 papers hereh-index 407.3k citations278 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position

sole author4
first author10
middle author9
last author20

Across the 43 of 44 papers where every author was matched, so the position is known.

fields

math.NT44

identity via Semantic Scholar / OpenAlex

activity

20042023

most citedThe iterated Carmichael λ-function and the number of cycles of the power generator

17 citations · 93 across the 37 of their papers we have counts for

collaborators

Showing 2010Show all

2 papers · 1 filter

math.NT2010

Primitive sets with large counting functions

Greg Martin, Carl Pomerance

A set of positive integers is said to be primitive if no element of the set is a multiple of another. If $S$ is a primitive set and $S (x)$ is the number of elements of $S$ not exce…

math.NT2010★ 1 cited

On numbers $n$ dividing the $n$ th term of a linear recurrence

Juan Jose Alba Gonzalez, Florian Luca, Carl Pomerance +1

Here, we give upper and lower bounds on the count of positive integers $n \leq x$ dividing the $n$ th term of a nondegenerate linearly recurrent sequence with simple roots.

◍wovepaper

Papers, researchers and institutions, woven together.

Explore

Search
Researchers
Institutions

Account

Library
Chat

Data

arXiv.org
Semantic Scholar
OpenAlex
Latest RSS

About Contact Privacy Developers llms.txt openapi.json

Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.

Primitive sets with large counting functions

On numbers n dividing the nth term of a linear recurrence

On numbers $n$ dividing the $n$ th term of a linear recurrence