benchmarks.wiki / Public workspace

MBPP / 288 / Write a function to count array elements having modular inverse under given…

Problem

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

test list

  • assert modular_inverse([ 1, 6, 4, 5 ], 4, 7) == 2
  • assert modular_inverse([1, 3, 8, 12, 12], 5, 13) == 3
  • assert modular_inverse([2, 3, 4, 5], 4, 6) == 1

text

Write a function to count array elements having modular inverse under given prime number p equal to itself.

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. 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. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

Official source

initial import