Home Competitions AHSME 1961 Problem 35
The number 695 695 695 is to be written with a factorial base of numeration, that is, 695 = a 1 + a 2 × 2 ! + a 3 × 3 ! + … a n × n ! 695=a_1+a_2\times2!+a_3\times3!+ \ldots a_n \times n! 695 = a 1 + a 2 × 2 ! + a 3 × 3 ! + … a n × n !
where a 1 , a 2 , a 3 . . . a n a_1, a_2, a_3 ... a_n a 1 , a 2 , a 3 ... a n are integers such that 0 ≤ a k ≤ k , 0 \le a_k \le k, 0 ≤ a k ≤ k , and n ! n! n ! means n ( n − 1 ) ( n − 2 ) . . .2 × 1 n(n-1)(n-2)...2 \times 1 n ( n − 1 ) ( n − 2 ) ...2 × 1 . Find a 4 a_4 a 4
(A) 0 (B) 1 (C) 2 (D) 3 (E) 4 \textbf{(A)}\ 0 \textbf{(B)}\ 1 \textbf{(C)}\ 2 \textbf{(D)}\ 3 \textbf{(E)}\ 4 (A) 0 (B) 1 (C) 2 (D) 3 (E) 4
Dataset text NuminaMath-1.5 . Quoted with source.
Show the answer
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Add a solution
Similar problems
These problems have the most words in common with this statement.
Locator ahsme/1961/p35 · Tag WGNNB9D7DX · Edit this page on GitHub · Keys: j next, k previous