Happy Thanksgiving! Please note that there are no classes November 25th-December 1st.

MIT PRIMES/Art of Problem Solving

CROWDMATH 2018: Neural Codes

G
Topic
First Poster
Last Poster
polynomial
pritam01   0
Jun 2, 2020
What I've tried so far:

<Describe what you have tried so far here. That way, we can do a better job helping you!>

Where I'm stuck:

<Describe what's confusing you, or what your question is here!>
0 replies
pritam01
Jun 2, 2020
0 replies
More Cushing-Pascoe problems
DCushing   24
N Jan 4, 2019 by SW1
It’s been great to see all this work so I thought I’d post a few extra problems for people to try:

Let P_k be the set Of k-powerful numbers.

1) Enunerate P_3 as a_1<a_2<a_3 ...

Show that lim inf |a_{n+1}-a_{n}| = infinity

2) Let P be a polynomial with integer coefficients and at least 3 simple roots. Is it true that P(n) is
powerful only finitely often?

3) Pell’s Equation can be used to generate infinitely many pairs of powerful numbers. Can this or something similar be used to generate infinitely many pairs of powerful numbers inside a coprime arithmetic progression

I have a few more problems that I can post in due course









24 replies
DCushing
Jan 12, 2018
SW1
Jan 4, 2019
No more topics!
a