ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Is this easier to prove for the sum of three 3-full numbers?) (b) Are all sufficiently large integers in A? (Presumably not – indeed, probably the density of A is < 1. Are there any t \in R such that f (1 + it) = 0? (Presumably not.) This was asked by Erdős and Ingham in connection with Tauberian theorems. (Proposed by Julia Brandes) (1) How many palindromic squares are there? There are infinitely many, but how many are there in [1, X]? Editor’s note: Keith [9] has given four infi- nite families of palindromic squares, and asks whether there are infinitely many aside from these. (2) How many non-palindromic squares are there which remain a square when the digits are reversed? For example 144 and 169. This is OEIS A033294. Are there infinitely many?

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.