Code in Java only You are given an integer A. Let's define an infinite sequence S(A) = A%P, A²%P, A³%P,..., where P = 10⁹ +7 is a prime and % is the modulo operator. Let's also define a decreasing sum D(S) as the sum of all elements of a sequence S which are strictly smaller than all preceding elements of S. When S is a sequence of non-negative integers, the number of such elements is clearly finite. Find D(S(A)). Input • The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows. • The first and only line of each test case contains a single integer A. Output For each test case, print a single line containing one integer D(S(A)). Input Output 2 3 2 100000006 100000007

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Karma dubike following. The integral part should. 

 

Code in Java only
You are given an integer A. Let's define an infinite sequence
S(A) = A%P, A²%P, A³%P,..., where P = 108 +7 is a prime and % is
the modulo operator.
Let's also define a decreasing sum D(S) as the sum of all elements of a
sequence S which are strictly smaller than all preceding elements of S. When S is
a sequence of non-negative integers, the number of such elements is clearly finite.
Find D(S(A)).
Input
• The first line of the input contains a single integer T denoting the number of
test cases. The description of T test cases follows.
• The first and only line of each test case contains a single integer A.
Output
For each test case, print a single line containing one integer D(S(A)).
Input
Output
3
2
2
100000006
100000007
Transcribed Image Text:Code in Java only You are given an integer A. Let's define an infinite sequence S(A) = A%P, A²%P, A³%P,..., where P = 108 +7 is a prime and % is the modulo operator. Let's also define a decreasing sum D(S) as the sum of all elements of a sequence S which are strictly smaller than all preceding elements of S. When S is a sequence of non-negative integers, the number of such elements is clearly finite. Find D(S(A)). Input • The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows. • The first and only line of each test case contains a single integer A. Output For each test case, print a single line containing one integer D(S(A)). Input Output 3 2 2 100000006 100000007
Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Knowledge Booster
Arrays
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education