All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info
Home > Digest
Recently posted problems (2 days):
Show Digest for last: 2 Days | 3 Days | 5 Days | 1 Week | 2 Weeks
Years ago, U.S. Savings Bonds were sold via payroll deductions. Say a bond worth $25 at maturity was sold for $18.75. You could have a certain amount deducted each pay period and when you built up enough in your bond account to pay the purchase price, you'd get a savings bond, and you might still have an amount left over in you account to go toward you next bond.

Say you had started with 3.75 taken out each pay period. After five such deductions you'd have exactly enough to buy an 18.75 bond. But suppose at some time when you happened to have 7.50 built up in your account you decided you wanted to get bonds more frequently and shifted to having 6.25 taken out each pay period so you'd get a bond every three pay periods. Next pay period you'd have 13.75 in your account, then next time you'd have $20, which is enough to get a bond and have 1.25 left over in your account, followed by a balance of 7.50 the next time, and this cycle would repeat forever, with your balance never going below 1.25. That 1.25 that hangs around in your balance is not helping you get your bond any sooner.

Devise an algorithm or formula so you can determine if such "dead money" is in a person's account, and how large that perpetually low balance is, based on a bond purchase price, the current balance, and the amount deducted each period, so that that lowest balance in the cycle can be refunded to the employee and the cycle will include a zero balance at some point.

Make sure your method allows for the fact that it may take a while before the balance goes to zero. The number given above were chosen to be simple, but allow for deduction amounts that may bear no simple relation to the purchase price.

(No Solution Yet, 1 Comments) Submitted on 2025-04-01 by Charlie    

Consider a perfect square having 3 as the first digit (reading left to right).

Determine the minimum value of N such that N remains a perfect square when the first digit is changed to 5.

(No Solution Yet, 2 Comments) Submitted on 2025-03-31 by K Sengupta    

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (2)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (4)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2025 by Animus Pactum Consulting. All rights reserved. Privacy Information