Some cryptographic algorithm requires matching natural numbers that can be represented as a sum of t...: ответ на тест 1054945 - Информатика

Some  cryptographic algorithm requires matching natural numbers that can be represented as a sum of two different prime numbers using more than k ways, thus all the three numbers (the unknown and two summands) should have the same number of digits. For example: number 30 matches k-1 case as it can be represented as follows:  and . Number 32 doesn’t match as it can be represented by only one sum: 19+13.
The quantity of 4-digit  decimals for k= 10 is …
Варианты ответов
Вариантов нет (ответ точный)
Правильный ответ
Помогли ответы? Ставь лайк 👍
Расскажи другу:
Вопрос задал(а): Анонимный пользователь, 13 Ноябрь 2020 в 18:02
На вопрос ответил(а): Анастасия Степанова, 13 Ноябрь 2020 в 18:02
Все Предметы (168)