benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / If n is a positive integer, let s(n) denote the sum of the digits of n. We say that n is zesty if there exist positive integers x and y greater than 1 such that xy=n and …

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

If nn is a positive integer, let s(n)s(n) denote the sum of the digits of nn. We say that nn is zesty if there exist positive integers xx and yy greater than 1 such that xy=nx y=n and s(x)s(y)=s(n)s(x) s(y)=s(n). How many zesty two-digit numbers are there?
Plain-text mathematical notation (without MathML)
If n is a positive integer, let s(n) denote the sum of the digits of n. We say that n is zesty if there exist positive integers x and y greater than 1 such that xy=n and s(x)s(y)=s(n). How many zesty two-digit numbers are there?
Original LaTeX notation
If $n$ is a positive integer, let $s(n)$ denote the sum of the digits of $n$. We say that $n$ is zesty if there exist positive integers $x$ and $y$ greater than 1 such that $x y=n$ and $s(x) s(y)=s(n)$. How many zesty two-digit numbers are there?

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

task_id
4058144b-9105-5939-98a5-08d097663bf3
task_key
test--4058144b-9105-5939-98a5-08d097663bf3
task_revision_id
1
config / split
/ test

Official source

initial import